Abstract: In a high insert throughput in a database system, the database management system (DBMS) caches, asynchronously from data insert transactions, a list of storage location identifiers for storage locations in a table space in the database system. When a request for an insert transaction with an insert size is received from an agent, the DBMS identifies a storage location on the list with an amount of free space meeting the insert size. The DBMS removes the storage location identifier from the list and returns the storage location identifier for the storage location. When the insert transaction completes, the DBMS determines a remaining free space at the storage location and adds the storage location identifier to the list according to the remaining free space. By removing storage location identifiers from the list, another agent cannot receive the same storage location identifier for a parallel task. Thus, space contention is avoided.

Abstract: In a high insert throughput in a database system, the database management system (DBMS) caches, asynchronously from data insert transactions, a list of storage location identifiers for storage locations in a table space in the database system. When a request for an insert transaction with an insert size is received from an agent, the DBMS identifies a storage location on the list with an amount of free space meeting the insert size. The DBMS removes the storage location identifier from the list and returns the storage location identifier for the storage location. When the insert transaction completes, the DBMS determines a remaining free space at the storage location and adds the storage location identifier to the list according to the remaining free space. By removing storage location identifiers from the list, another agent cannot receive the same storage location identifier for a parallel task. Thus, space contention is avoided.

Abstract: In a high insert throughput in a database system, the database management system (DBMS) caches, asynchronously from data insert transactions, a list of storage location identifiers for storage locations in a table space in the database system. When a request for an insert transaction with an insert size is received from an agent, the DBMS identifies a storage location on the list with an amount of free space meeting the insert size. The DBMS removes the storage location identifier from the list and returns the storage location identifier for the storage location. When the insert transaction completes, the DBMS determines a remaining free space at the storage location and adds the storage location identifier to the list according to the remaining free space. By removing storage location identifiers from the list, another agent cannot receive the same storage location identifier for a parallel task. Thus, space contention is avoided.

Abstract: In a high insert throughput in a database system, the database management system (DBMS) caches, asynchronously from data insert transactions, a list of storage location identifiers for storage locations in a table space in the database system. When a request for an insert transaction with an insert size is received from an agent, the DBMS identifies a storage location on the list with an amount of free space meeting the insert size. The DBMS removes the storage location identifier from the list and returns the storage location identifier for the storage location. When the insert transaction completes, the DBMS determines a remaining free space at the storage location and adds the storage location identifier to the list according to the remaining free space. By removing storage location identifiers from the list, another agent cannot receive the same storage location identifier for a parallel task. Thus, space contention is avoided.

Abstract: Dropping of columns from a table with data availability, where the columns in the table are each associated with a column number, includes: executing a statement to drop a given column in the table and deferring an application of the statement until a reorganization of a current data set including the table. When the reorganization of the current data set is performed, the reorganization includes: updating column numbers for columns in each row of the table using a mapping data structure to remove the given column; loading the plurality of data rows with the updated column numbers into a shadow data set; applying to the shadow data set any changes to the table that are concurrent with the reorganization; updating a schema definition of the table with the updated column numbers; and switching the current data set to the shadow data set.

Abstract: Dropping of columns from a table with data availability, where the columns in the table are each associated with a column number, includes: executing a statement to drop a given column in the table and deferring an application of the statement until a reorganization of a current data set including the table. When the reorganization of the current data set is performed, the reorganization includes: updating column numbers for columns in each row of the table using a mapping data structure to remove the given column; loading the plurality of data rows with the updated column numbers into a shadow data set; applying to the shadow data set any changes to the table that are concurrent with the reorganization; updating a schema definition of the table with the updated column numbers; and switching the current data set to the shadow data set.

Abstract: Dropping of columns from a table with data availability, where the columns in the table are each associated with a column number, includes: executing a statement to drop a given column in the table and deferring an application of the statement until a reorganization of a current data set including the table. When the reorganization of the current data set is performed, the reorganization includes: updating column numbers for columns in each row of the table using a mapping data structure to remove the given column; loading the plurality of data rows with the updated column numbers into a shadow data set; applying to the shadow data set any changes to the table that are concurrent with the reorganization; updating a schema definition of the table with the updated column numbers; and switching the current data set to the shadow data set.

Abstract: Dropping of columns from a table with data availability, where the columns in the table are each associated with a column number, includes: executing a statement to drop a given column in the table and deferring an application of the statement until a reorganization of a current data set including the table. When the reorganization of the current data set is performed, the reorganization includes: updating column numbers for columns in each row of the table using a mapping data structure to remove the given column; loading the plurality of data rows with the updated column numbers into a shadow data set; applying to the shadow data set any changes to the table that are concurrent with the reorganization; updating a schema definition of the table with the updated column numbers; and switching the current data set to the shadow data set.

Abstract: A method and system for providing a scalable storage scheme for native hierarchically structured data of relational tables, includes a base table with indicator columns with information pertaining to hierarchically structured data of a document, data tables for storing the hierarchically structured data corresponding to the indicator columns, and node identifier indexes corresponding to the data tables for mapping between the indicator columns and the hierarchically structured data in the data tables. In an embodiment, actual data for each hierarchically structured data (such as XML) column is stored in a separate data table, and each data table has a separate node identifier index. The node identifier index is searched with a key containing the document identifier and a logical node identifier is used, and a record identifier of a record in the data table containing the node assigned the logical node identifier is retrieved.

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: A method and system for providing a scalable storage scheme for native hierarchically structured data of relational tables, includes a base table with indicator columns with information pertaining to hierarchically structured data of a document, data tables for storing the hierarchically structured data corresponding to the indicator columns, and node identifier indexes corresponding to the data tables for mapping between the indicator columns and the hierarchically structured data in the data tables. In an embodiment, actual data for each hierarchically structured data (such as XML) column is stored in a separate data table, and each data table has a separate node identifier index. The node identifier index is searched with a key containing the document identifier and a logical node identifier is used, and a record identifier of a record in the data table containing the node assigned the logical node identifier is retrieved.

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 accessing data in a database table. A fetch request is received to fetch data from a base table that satisfies a query predicate, wherein rows of the base table are stored in table partitions and wherein there is one index partition for each determined table partition, wherein each index partition includes nodes, wherein each node in each index partition includes at least one key column value from 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. A determination is made of a set of nodes, one from each index partition, whose key column value satisfies the query predicate. One node from the set is selected and data is returned from the table row identified by the location identifier in the selected node in response to the fetch request.

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 is a method, system, and program for implementing a database trigger. Upon detecting a trigger event, a determination is made of at least one row in a base table affected by the trigger event. For each column in the base table of a data type that is referenced in a triggered action associated with the trigger event, a reference is generated referencing the data of the data type. The reference is inserted in a transition table column including data of the data type from the affected row in the base table referenced in the triggered action. The reference is used to access the data of the data type when performing the triggered action.

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, 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.