Abstract: Provided are a method, system, and program for making data available to an application program. A cursor is generated positioned with respect to a result table, wherein the cursor specifies a search criteria, and wherein the result table includes rows from a base table that satisfy the search criteria. A fetch request is received indicating to position the cursor on a plurality of rows of the result table. The cursor is positioned on the plurality of rows of the result table indicated in the fetch request that satisfy the search criteria.

Abstract: Provided are a method, system, and program for managing a database. A request is processed to create an index on at least one key column of a table in a computer readable medium. A determination is made of table partitions in which rows of the table are stored. One index partition is generated for each determined table partition, wherein each index partition includes nodes, wherein each node in each index partition includes a key value from at least one column in a corresponding table row in the table partition associated with the index partition and a location identifier identifying the corresponding table row in the corresponding table partition. In certain embodiments, a technique is implemented during queries to limit the search to a subset of the multiple index partitions when possible and return rows in the order of the key columns of the index while the same range of key values can exist across multiple index partitions.

Abstract: A method, apparatus and article of manufacture, implementing the method, for operating a database management system stores information in at least one entry. Each entry is associated with a row. At least one entry comprises one or more columns. At least one of the columns has a varying length. At least one entry comprises an offset array having one or more offsets associated with the columns having the varying length. In another aspect of the invention, a column extraction table is built and used, with the offset array, to access a specified column of an entry. Alternately, code is generated to access a specified column based on the offset array of an entry. In yet another aspect of the invention, a comparison table is built and used, with the offset array, to compare subsets of the entries.

Abstract: Traditional update semantics are provided when updates change the location of records in a database. The system detects that an update to a record will cause the record to change locations in a database from an original location to an updated location. The system selectively prevents activity in the database between the original location and update location until the updated record has changed locations in the database from the original location to the updated location.

Abstract: Provided are a method, system, and program for managing a database. A request is processed to create an index on at least one key column of a table in a computer readable medium. A determination is made of table partitions in which rows of the table are stored. One index partition is generated for each determined table partition, wherein each index partition includes nodes, wherein each node in each index partition includes a key value from at least one column in a corresponding table row in the table partition associated with the index partition and a location identifier identifying the corresponding table row in the corresponding table partition. In certain embodiments, a technique is implemented during queries to limit the search to a subset of the multiple index partitions when possible and return rows in the order of the key columns of the index while the same range of key values can exist across multiple index partitions.

Abstract: Provided is a method, system, program, and data structures for making data available to an application program. A result table is generated including rows corresponding to a subset of rows in a base table having data in one or more columns that satisfy a query predicate clause. The result table includes, for each row, a location identifier of the corresponding row in the base table and a column for each column in a query select list. The result table is accessed to return requested data from the base table to the application program.

Abstract: A system and a method are described for selectively locking the partitions of a partitioned table in a relational database. The database system locks only those partitions of the table that are accessed by an application. Other partitions are available for concurrent access by other applications, regardless of the strength of the lock needed.

Abstract: A method, apparatus and article of manufacture, implementing the method, for operating a database management system stores information in at least one entry. Each entry is associated with a row. At least one entry comprises one or more columns. At least one of the columns has a varying length. At least one entry comprises an offset array having one or more offsets associated with the columns having the varying length. In another aspect of the invention, a column extraction table is built and used, with the offset array, to access a specified column of an entry. Alternately, code is generated to access a specified column based on the offset array of an entry. In yet another aspect of the invention, a comparison table is built and used, with the offset array, to compare subsets of the entries.

Abstract: Provided is a method, system, program, and data structures for making data available to an application program. A result table is generated including rows corresponding to a subset of rows in a base table having data in one or more columns that satisfy a query predicate clause. The result table includes, for each row, a location identifier of the corresponding row in the base table and a column for each column in a query select list. The result table is accessed to return requested data from the base table to the application program.

Abstract: Provided is a method, system, and program for performing a cursor operation. A result table is generated including rows corresponding to a subset of rows in a base table having data in one or more columns that satisfy a query predicate clause. A command is received to perform a cursor operation with respect to a subject row in the result table. A lock is obtained on a row in the base table corresponding to the subject row in the result table. An operation specified in the received command is performed with respect to the subject row after obtaining the lock. The lock on the row in the base table is released after performing the operation.

Abstract: Provided is a method, system, program, and data structures for making data available to an application program. A result table is generated including rows corresponding to a subset of rows in a base table having data in one or more columns that satisfy a query predicate clause. The result table includes, for each row, a location identifier of the corresponding row in the base table and a column for each column in a query select list. The result table is accessed to return requested data from the base table to the application program.

Abstract: Provided is a method, system, program, and data structures for making data available to an application program. A result table is generated including rows corresponding to a subset of rows in a base table having data in one or more columns that satisfy a query predicate clause. The result table includes, for each row, a location identifier of the corresponding row in the base table and a column for each column in a query select list. The result table is accessed to return requested data from the base table to the application program.

Abstract: Provided is a method, system, program, and data structures for making data available to an application program. A result table is generated including rows corresponding to a subset of rows in a base table having data in one or more columns that satisfy a query predicate clause. The result table includes, for each row, a location identifier of the corresponding row in the base table and a column for each column in a query select list. The result table is accessed to return requested data from the base table to the application program.

Abstract: A method for selectively releasing locks when rolling back to a savepoint includes: providing at least one savepoint in a transaction, where at least one lock is assigned to the at least one savepoint and at least one lock is assigned to the transaction; rolling back the transaction to the at least one savepoint; and releasing the at least one lock assigned to the at least one savepoint, where the at least one lock assigned to the transaction is maintained. Locks which are to persist until commit are assigned to the transaction. Locks which are to be released when rolled back to a savepoint are assigned to the savepoint. When a rollback to the savepoint occurs, locks assigned to the savepoint are released while locks assigned to the transaction are maintained. In this manner, selective release of locks is provided without incurring unduly burdensome overhead.

Abstract: Provided is a method, system, and program for performing a cursor operation. A result table is generated including rows corresponding to a subset of rows in a base table having data in one or more columns that satisfy a query predicate clause. A command is received to perform a cursor operation with respect to a subject row in the result table. A lock is obtained on a row in the base table corresponding to the subject row in the result table. An operation specified in the received command is performed with respect to the subject row after obtaining the lock. The lock on the row in the base table is released after performing the operation.

Abstract: Provided is a method, system, program, and data structures for making data available to an application program. A result table is generated including rows corresponding to a subset of rows in a base table having data in one or more columns that satisfy a query predicate clause. The result table includes, for each row, a location identifier of the corresponding row in the base table and a column for each column in a query select list. The result table is accessed to return requested data from the base table to the application program.

Abstract: Provided is a method, system, program, and data structures for making data available to an application program. A result table is generated including rows corresponding to a subset of rows in a base table having data in one or more columns that satisfy a query predicate clause. The result table includes, for each row, a location identifier of the corresponding row in the base table and a column for each column in a query select list. The result table is accessed to return requested data from the base table to the application program.

Abstract: Provided is a method, system, program, and data structures for making data available to an application program. A result table is generated including rows corresponding to a subset of rows in a base table having data in one or more columns that satisfy a query predicate clause. The result table includes, for each row, a location identifier of the corresponding row in the base table and a column for each column in a query select list. The result table is accessed to return requested data from the base table to the application program.

Abstract: Provided is a method, system, program, and data structures for making data available to an application program. A result table is generated including rows corresponding to a subset of rows in a base table having data in one or more columns that satisfy a query predicate clause. The result table includes, for each row, a location identifier of the corresponding row in the base table and a column for each column in a query select list. The result table is accessed to return requested data from the base table to the application program.

Abstract: A method, apparatus, and article of manufacture for a computer implemented insert system. Data is stored in a database stored on a data storage device connected to a plurality of computers. At least one look-aside space map is allocated to each of the computers. At each computer, when data is to be inserted into the database, a look-aside space map allocated to that computer is identified, and a free data page is located using the identified look-aside space map.