公开(公告)号：US20210200818A1

公开(公告)日：2021-07-01

申请号：US16913432

申请日：2020-06-26

Applicant: Micron Technology, Inc.

Inventor： Neelima Premsankar ,  Gaurav Sanjay Ramdasi ,  David Boles

IPC: G06F16/903 ,  G06F16/901

Abstract: An example method of cursor seek operations using deleted record spans in memory sub-systems comprises: receiving, by a processing device, a request to search for a first data element of a key-value data store, the request specifying a first key associated with the first data element; determining that the first key is within a range of deleted data elements comprising a plurality of deleted data elements of the key-value data store; identifying a tail key associated with a tail element of the range of deleted data elements; identifying a second data element in the key-value data store, wherein the second data element is associated with a second key that follows the tail key in a specified order of keys; and providing the second data element in response to the request.

公开(公告)号：US20210200721A1

公开(公告)日：2021-07-01

申请号：US16912168

申请日：2020-06-25

Applicant: Micron Technology, Inc.

Inventor： Gregory Alan Becker ,  Neelima Premsankar ,  David Boles

IPC: G06F16/176 ,  G06F16/18 ,  G06F16/17 ,  G06F16/22

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.

公开(公告)号：US11762913B2

公开(公告)日：2023-09-19

申请号：US16913432

申请日：2020-06-26

Applicant: Micron Technology, Inc.

Inventor： Neelima Premsankar ,  Gaurav Sanjay Ramdasi ,  David Boles

IPC: G06F16/903 ,  G06F16/901

CPC classification number: G06F16/90348 ,  G06F16/9024

Abstract: An example method of cursor seek operations using deleted record spans in memory sub-systems comprises: receiving, by a processing device, a request to search for a first data element of a key-value data store, the request specifying a first key associated with the first data element; determining that the first key is within a range of deleted data elements comprising a plurality of deleted data elements of the key-value data store; identifying a tail key associated with a tail element of the range of deleted data elements; identifying a second data element in the key-value data store, wherein the second data element is associated with a second key that follows the tail key in a specified order of keys; and providing the second data element in response to the request.

公开(公告)号：US11537565B2

公开(公告)日：2022-12-27

申请号：US16912168

申请日：2020-06-25

Applicant: Micron Technology, Inc.

Inventor： Gregory Alan Becker ,  Neelima Premsankar ,  David Boles

IPC: G06F16/176 ,  G06F16/22 ,  G06F16/17 ,  G06F16/18

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.