Micron Technology Incorporated

Gaurav Sanjay Ramdasi

Alexander Tomlinson

Jacob Mulamootil Jacob

David Boles

Nabeel Meeramohideen Mohamed

Neelima Premsankar

Gregory Becker

Greg A Becker

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.

Hold-aside buffer for uncommitted write transactions in a log structured key-value database

A prefix probe component receives a request to perform a cursor operation to search for one or more data elements of a key-value data store, the request comprising a key identifier associated with the one or more data elements, and wherein the key-value data store comprises a tree structure with a plurality of nodes; traverses a portion of the plurality of nodes to identify data elements in the key-value data store that match the key identifier; determines whether a number of the data elements that match the key identifier satisfies a threshold condition; and responsive to determining that the number of data elements satisfies the threshold condition, performs the cursor operation for the data elements that match the key identifier.

Prefix probe for cursor operations associated with a key-value database system

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.

Cursor seek operations using deleted record spans

A request to retrieve data from a memory device of a memory sub-system can be received from a machine learning (ML) framework executing on a host system, where the data comprises a plurality of logical partitions. A set of parallel I/O threads can be initiated to retrieve the data from the memory device, where each I/O thread of the set of parallel I/O threads retrieves a different portion of the data from a different corresponding logical partition and stores the different portion of the data in a I/O buffer of a set of I/O buffers corresponding to the set of I/O threads in parallel. The different portion of the data can be successively provided from each I/O buffer to the ML framework, where the set of parallel I/O threads is to continually retrieve the data from the memory device until all of the data from the logical partitions has been provided to the ML framework.

Parallel iterator for machine learning frameworks

A key-value pair comprising a key and a value associated with the key is stored in a current segment of a data container. The key comprises a segment identifier identifying the current segment. The data container comprises a plurality of segments residing on a non-volatile memory device. Responsive to determining that a size of the current segment exceeds a threshold, a new segment is added to the container. The plurality of key-value pairs having respective current segment identifiers referencing one or more least recently created segments of the data container is deleted.

Using prefix-delete operations for data containers

Aspects of the present disclosure provide for operations of a key-value tree data structure that: merge key-value sets within a given node by merging and rewriting key blocks of the key-value sets while rewriting or deferring rewrite of value blocks of the merged key-value sets based on whether one or more child nodes of the given node comprise a leaf node; and move one or more portions of the merged key-value set into one or more child nodes of the given node.

Growing community of inventors

Pune, India

Gaurav Sanjay Ramdasi