Abstract: Disclosed herein are system, method, and computer program product embodiments for managing timestamp information in memory systems. In an embodiment, an infrastructure may utilize a controller to manage sparse timestamp blocks. These sparse timestamp blocks may manage timestamp information in a persistent memory structure. Controller 110 may utilize a transient timestamp accessor to map the timestamp information for faster hash lookups. Controller 110 may also utilize a garbage collection map as a bitmap to further save processing steps. Controller 110 may utilize the sparse timestamp blocks, transient timestamp accessor, and garbage collection map to efficiently store timestamp data and to quickly retrieve the stored timestamp data.

Abstract: In one aspect, there is provided a method. The method may include accessing a multi-version concurrency control block providing row state for a block of rows in a table of a database, the multi-version concurrency control block including a header portion and a data portion, the header portion including a type indicator indicating whether all of the rows of the block are visible to a plurality of threads at a database management system or invisible to the plurality of threads at the database management system. Related systems, methods, and articles of manufacture are also disclosed.

Abstract: A method may include iterating through at least a portion of a table stored in a database by identifying a timestamp block associated with a range of rows forming the portion of the table. In response to determining that the timestamp block is a sparse timestamp block storing timestamps associated with only some of the rows in the first range of rows, generating a bitmap. Each of the binary values in the bitmap may correspond one of the rows in the range of rows. Moreover, each of the binary values in the bitmap may indicate whether the timestamp block includes a timestamp associated with a corresponding row from the range of rows. Iterating through the range of rows may include accessing, based on the bitmap, the timestamp block to read or write timestamps of transaction affecting the rows in the range of rows.

Abstract: A method may include performing a transaction on a row in a table stored in a database. In response to performing the transaction, a first timestamp block associated with a range of rows including the row may be retrieved. In response to determining that the first timestamp block is a sparse timestamp block that has reached maximum capacity, a second timestamp block may be allocated for storing the timestamp associated with the transaction. The sparse timestamp block may be allocated with sufficient storage space for storing some but not all of the timestamps associated with the range of rows. By contrast, the second timestamp block may be a dense timestamp block allocated with sufficient storage space for storing all of the timestamps associated with the range of rows. The timestamp associated with the transaction may be stored in the second timestamp block.

Abstract: Disclosed herein are system, method, and computer program product embodiments for managing timestamp information in memory systems. In an embodiment, an infrastructure may utilize a controller to manage sparse timestamp blocks. These sparse timestamp blocks may manage timestamp information in a persistent memory structure. Controller 110 may utilize a transient timestamp accessor to map the timestamp information for faster hash lookups. Controller 110 may also utilize a garbage collection map as a bitmap to further save processing steps. Controller 110 may utilize the sparse timestamp blocks, transient timestamp accessor, and garbage collection map to efficiently store timestamp data and to quickly retrieve the stored timestamp data.

Abstract: Disclosed herein are system, method, and computer program product embodiments for managing timestamp information in memory systems. In an embodiment, an infrastructure may utilize a controller to manage sparse timestamp blocks. These sparse timestamp blocks may manage timestamp information in a persistent memory structure. Controller 110 may utilize a transient timestamp accessor to map the timestamp information for faster hash lookups. Controller 110 may also utilize a garbage collection map as a bitmap to further save processing steps. Controller 110 may utilize the sparse timestamp blocks, transient timestamp accessor, and garbage collection map to efficiently store timestamp data and to quickly retrieve the stored timestamp data.

Abstract: In one aspect, there is provided a method. The method may include accessing a multi-version concurrency control block providing row state for a block of rows in a table of a database, the multi-version concurrency control block including a header portion and a data portion, the header portion including a type indicator indicating whether all of the rows of the block are visible to a plurality of threads at a database management system or invisible to the plurality of threads at the database management system. Related systems, methods, and articles of manufacture are also disclosed.

Abstract: A method may include iterating through at least a portion of a table stored in a database by identifying a timestamp block associated with a range of rows forming the portion of the table. In response to determining that the timestamp block is a sparse timestamp block storing timestamps associated with only some of the rows in the first range of rows, generating a bitmap. Each of the binary values in the bitmap may correspond one of the rows in the range of rows. Moreover, each of the binary values in the bitmap may indicate whether the timestamp block includes a timestamp associated with a corresponding row from the range of rows. Iterating through the range of rows may include accessing, based on the bitmap, the timestamp block to read or write timestamps of transaction affecting the rows in the range of rows.

Abstract: A method may include performing a transaction on a row in a table stored in a database. In response to performing the transaction, a first timestamp block associated with a range of rows including the row may be retrieved. In response to determining that the first timestamp block is a sparse timestamp block that has reached maximum capacity, a second timestamp block may be allocated for storing the timestamp associated with the transaction. The sparse timestamp block may be allocated with sufficient storage space for storing some but not all of the timestamps associated with the range of rows. By contrast, the second timestamp block may be a dense timestamp block allocated with sufficient storage space for storing all of the timestamps associated with the range of rows. The timestamp associated with the transaction may be stored in the second timestamp block.

Abstract: Disclosed herein are system, method, and computer program product embodiments for managing timestamp information in memory systems. In an embodiment, an infrastructure may utilize a controller to manage sparse timestamp blocks. These sparse timestamp blocks may manage timestamp information in a persistent memory structure. Controller 110 may utilize a transient timestamp accessor to map the timestamp information for faster hash lookups. Controller 110 may also utilize a garbage collection map as a bitmap to further save processing steps. Controller 110 may utilize the sparse timestamp blocks, transient timestamp accessor, and garbage collection map to efficiently store timestamp data and to quickly retrieve the stored timestamp data.