Abstract: In some implementations, a memory device may identify a key-value pair set associated with a root node, wherein the key-value pair set includes a plurality of key-value pairs, and wherein the root node is associated with a log-structured merge-tree. The memory device may determine that a plurality of keys in the key-value pair set are associated with a leaf node based on the plurality of keys corresponding to an edge key associated with the leaf node, wherein the leaf node is associated with the log-structured merge-tree. The memory device may associate the key-value pair set with the leaf node based on a metadata update of the key-value pair set, wherein the key-value pair set becomes decoupled from the root node.

Abstract: In some implementations, a memory device may determine, from a list of key-value pair sets, a key-value pair set. The memory device may identify, from the key-value pair set selected from the list of key-value pair sets, a first key that is included in at least one other key-value pair set from the list of key-value pair sets. The memory device may identify, from the key-value pair set selected from the list of key-value pair sets, a second key that is not included in at least one other key-value pair set from the list of key-value pair sets. The memory device may form a new key-value pair set that excludes the first key and includes the second key. The memory device may replace the key-value pair set selected from the list of key-value pair sets with the new key-value pair set.

Abstract: An event trigger to flush key-value data from a volatile memory device is detected. In response to detection of the event trigger, a determination is made whether the key-value data comprises uncommitted data for one or more active database transactions. If the key-value data comprises uncommitted data for one or more active database transactions, the uncommitted data is moved to a hold aside buffer in the volatile memory device, and committed data in the key-value data is stored on a non-volatile memory device.

Abstract: A global lock is used to access a first set of data structures. An active transaction having a transaction start identifier is identified as a globally oldest active transaction associated with the first set of data structures. A first marker value of a first data structure of a second set of data structures is compared to the transaction start identifier to determine satisfaction of a first condition. In response to satisfying the first condition, the first data structure is accessed to identify a first set of data locks associated with one or more transactions each having a transaction completion identifier that satisfies a second condition when compared to the transaction start identifier. In response to satisfying the second condition, the first set of data locks is released.

Abstract: A first data structure lock to access a first data structure of a first set of data structures to perform an operation associated with a transaction is acquired. The operation associated with the transaction is executed, wherein the operation is one of inserting the transaction into the first data structure or removing the transaction from the first data structure. An oldest active transaction of the first data structure is identified. A globally oldest active transaction of the set of the data structures in view of the oldest active transaction is determined. A second set of data structures is accessed, the second set of data structures including information associated with completed transactions to identify a set of data locks associated with completed transactions each having a transaction completion identifier that satisfies a condition when compared to a transaction start identifier associated with the globally oldest active transaction. The set of data locks are released.

Abstract: A first data structure lock to access a first data structure of a first set of data structures to perform an operation associated with a transaction is acquired. The operation associated with the transaction is executed, wherein the operation is one of inserting the transaction into the first data structure or removing the transaction from the first data structure. An oldest active transaction of the first data structure is identified. A globally oldest active transaction of the set of the data structures in view of the oldest active transaction is determined. A second set of data structures is accessed, the second set of data structures including information associated with completed transactions to identify a set of data locks associated with completed transactions each having a transaction completion identifier that satisfies a condition when compared to a transaction start identifier associated with the globally oldest active transaction. The set of data locks are released.