Abstract: According to one or more embodiments of the present invention, a computer-implemented method includes creating a hybrid index for a multi-zone data storage system in which a first zone has data that is organized for transaction processing, and a second zone that has data organized for analytic processing. Each index entry in the hybrid index includes an index key including an equality column, a begin-timestamp column, and a tuple-sequence-number column. The method further includes building an index run to be included in the hybrid index, the index run includes multiple index entries. An index run is created by selecting columns by scanning data blocks from the first zone, computing tuple-sequence-number values for the index entries to be included in the hybrid index, and sorting the index entries according to a predetermined order using the columns to be included in the index run.

Abstract: According to one or more embodiments of the present invention, a computer-implemented method includes creating a hybrid index for a multi-zone data storage system in which a first zone has data that is organized for transaction processing, and a second zone that has data organized for analytic processing. Each index entry in the hybrid index includes an index key including an equality column, a begin-timestamp column, and a tuple-sequence-number column. The method further includes building an index run to be included in the hybrid index, the index run includes multiple index entries. An index run is created by selecting columns by scanning data blocks from the first zone, computing tuple-sequence-number values for the index entries to be included in the hybrid index, and sorting the index entries according to a predetermined order using the columns to be included in the index run.

Abstract: Implementation of append mode concurrent insert operations in tables in a page-based concurrent relational database management system is carried out by defining a set of last pages as a current cache into which rows may be inserted by appenders. Append mode insert operations for each page in the current cache are serialized. Appenders seek to access the pages in the current cache using a two-pass process in which latches are sought to be acquired conditionally in the first pass and unconditionally in the second pass. A shared data structure is provided to define a current cache and a next cache for a table supporting append mode inserts in the relational database. The shared data structure includes information reflecting the unused space for each page in the current cache.

Abstract: Implementation of append mode concurrent insert operations in tables in a page-based concurrent relational database management system is carried out by defining a set of last pages as a current cache into which rows may be inserted by appenders. Append mode insert operations for each page in the current cache are serialized. Appenders seek to access the pages in the current cache using a two-pass process in which latches are sought to be acquired conditionally in the first pass and unconditionally in the second pass. A shared data structure is provided to define a current cache and a next cache for a table supporting append mode inserts in the relational database. The shared data structure includes information reflecting the unused space for each page in the current cache.

Abstract: Implementation of append mode concurrent insert operations in tables in a page-based concurrent relational database management system is carried out by defining a set of last pages as a current cache into which rows may be inserted by appenders. Append mode insert operations for each page in the current cache are serialized. Appenders seek to access the pages in the current cache using a two-pass process in which latches are sought to be acquired conditionally in the first pass and unconditionally in the second pass. A shared data structure is provided to define a current cache and a next cache for a table supporting append mode inserts in the relational database. The shared data structure includes information reflecting the unused space for each page in the current cache.