International Business Machines Corporation

Michael Stephen Schwartz

Clifford A Pickover

Naga A Ayachitula

Shu-Ping Chang

JoAnn Piersa Brereton

Bertrand M Grossman

Daniel James Winarski

James Gordon McLean

Anna Rosa Coden

Lenisha V Gandhi

James Sargent Lipscomb

Adarsh Gupta

Robert Charles Plotkin

Disclosed is a technique for result set management. One or more result sets are stored. Each result set was generated by executing a query. When at least one of a number of result sets that may be stored and a number of bucket tables that may hold result sets is modified, it is determined whether any of the one or more result sets are to be removed. When it is determined that one or more of the result sets are to be removed, those result sets are removed.

System and program for result set management

A software program () is configured to initiate, process, and terminate user sessions (). A resource deallocation module () is linked to the software program () to deallocate allocated external resources of each object of a user session responsive to an impending termination of said user session. An automatic memory management module () is invoked by the software program with respect to said user session subsequent to the deallocation performed by the resource deallocation module () and prior to the termination of said user session.

Method and system for resolving memory leaks and releasing obsolete resources from user session data

Result set management

The present invention is an application-aware method for allocating resources to applications based on a set of predefined policies comprising a Resource Allocation Program (RAP). The RAP is application-aware in that the RAP does not arbitrarily allocate resources to requesting applications. Instead, the RAP allocates resources to requesting applications based on predefined policies. The RAP allows a user to define the resource allocation for each policy in a Resource Allocation Table and associate the applications with the policies in a Policy Application Table. When an application requests resources, the RAP looks to the Policy Allocation Table to determine the policy associated with the application and looks to the Resource Allocation Table to determine the permissible amount of resources to allocate to the application associated with the policy. The RAP then allocates the resources to the requesting application.

Application-aware system that dynamically partitions and allocates resources on demand

An abstraction layer () is provided for facilitating accessing a database () containing database records each including a plurality of fields stored in one or more tables (). The abstraction layer () includes a control table () containing control records corresponding to database fields. Each control record contains metadata associated with the corresponding database field. The abstraction layer () also includes at least one additional table () containing additional metadata. Each database field is selectively associated with one or more selected portions of the additional metadata through metadata contained in the control record corresponding to the database field. A user database application () accesses the database () using metadata obtained from the abstraction layer ().

Data abstraction layer for a database

Query objects are created by a client process. The query objects have one or more sub-query objects and one or more execute methods that are capable of operating on their respective query object to produce one or more query expressions. All of the execute methods are capable of producing the respective query expression that is compatible with a structured query language. A compound query contains one or more boolean expressions of one or more of the query objects. The compound query has one or more compound execute methods which invoke one or more the execute methods of each of the query objects. Each of the execute methods returns their respective query expression and the compound execute method uses one or more common table expressions to combine the query expressions to form a single compound query expression that represents the boolean expression. This single expression can be execute against a database to return a result without executing any of the query expressions against the database individually.

System and method for performance complex heterogeneous database queries using a single SQL expression

A method and data processing system are disclosed for translating an ad-hoc user input string into Structured Query Language. A user input string is parsed placing joiner objects and left parentheses into a temporary pushdown stack and placing query clause objects into a postfix queue. After encountering a query clause object or a right parenthesis, the next item in the pushdown stack is placed in the postfix queue if it is a joiner object. Once the input string is parsed, objects in the postfix queue are placed into a second temporary pushdown stack and also used to form common table expressions using adjacent items in the second pushdown stack. Finally, an SQL SELECT statement is formed using a JOIN on the ids returned by the common table expressions.

Method and system for translating an ad-hoc query language using common

A method and system for facilitating the selection of icons. Those icons which are next likely to be used are selected and automatically moved towards a cursor thereby facilitating selection of the icons. Additionally, those icons likely to be used or other icons selected by a user may track the cursor such that those icons are always close to the cursor and capable of being easily selected. Further, in order to facilitate selection of icons, icons are provided with the capability of announcing themselves when a cursor comes close to the icon. In addition, it is possible to reduce the amount of clutter on a computer display so that icons may be easily selected. In order to clean up a computer display, icons which are least likely to be used are faded, eliminated or shrunk to a smaller size. In another embodiment, icons that are not used very often may disappear into a master icon and further, icons which have a conceptual relationship between them may be linked by a visual graphical representation.

Method and system for facilitating the selection of icons

When migrating legacy database systems to a new database system the relationships between tables need to be preserved. Also, base tables and their children have to maintain their relationship. A database system which creates a system generated unique key is stored with the data which is loaded. To enable load, search, and retrieval to be efficient a data remapping function is defined which uses the system generated key to maintain the relationships which were maintained by a unique key in the legacy systems.

Method and system for remapping an existing database to a new database

Method and system for automatically consolidating icons into a master

A method and system for facilitating the selection of one or more of a plurality of icons located on a computer display. A selection is made, from a plurality of icons, of one or more icons to announce itself, such that one or more selected icons is provided. Each of the one or more selected icons makes an announcement. In one example, the announcement includes a designation of the icon making the announcement. Further, the announcement may include sound or a display on the computer display. In one embodiment, in order to select the one or more icons to announce itself, a location of a cursor positioned on the computer display is determined and a further determination is made as to which of the plurality of icons are within a predetermined distance from the location. Those icons within the predetermined distance are the selected icons.

Growing community of inventors

Bronx, NY, United States of America

Michael Stephen Schwartz