-
1.发明申请公开(公告)号：US20250094351A1
公开(公告)日：2025-03-20
申请号：US18968771
申请日：2024-12-04
Applicant: MICRON TECHNOLOGY, INC.
Inventor： Alexander Tomlinson , Gaurav Sanjay Ramdasi , Gregory Alan Becker
IPC: G06F12/0875
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.
-
公开(公告)号：US12088497B2
公开(公告)日：2024-09-10
申请号：US17886865
申请日：2022-08-12
Applicant: Micron Technology, Inc.
Inventor： Alexander Tomlinson , Gaurav Sanjay Ramdasi , Greg Alan Becker , Nabeel Meeramohideen Mohamed , Steven Andrew Moyer , Tristan Antonio Partin
CPC classification number: H04L45/48 , G06F16/2246
Abstract: Methods, systems, and devices for techniques to balance log structured merge trees are described. A computing system may rebalance a tree structure having an ordered set of leaf nodes by splitting or joining leaf nodes of the tree structure. To split a leaf node, the computing system may select a key to evenly partition key and value data stored in the leaf. The computing system may place each key block of the leaf node having keys less than or equal to the selected key in a first new leaf node, and may place each key block of the leaf node having keys greater than the selected key in a second new leaf node. To join leaf nodes of the tree structure, the computing system may place each key block and each value block of the leaf node and the adjacent leaf node in a new leaf node.
-
公开(公告)号：US20200257669A1
公开(公告)日：2020-08-13
申请号：US16856920
申请日：2020-04-23
Applicant: Micron Technology, Inc.
Inventor： David Boles , John M. Groves , Steven Moyer , Alexander Tomlinson
IPC: G06F16/22 , G06F16/2455
Abstract: A KVS tree and operations thereon are described herein. A key-value set (kvset) is received to store in a key-value data structure on at least one machine readable medium. The kvset includes a mapping of unique keys to values with the keys and the values of the kvset being immutable. The key-value data structure is organized as a tree with nodes of the tree including a temporally ordered sequence of kvsets. The kvset, once received, is written to a sequence of kvsets of a root-node of the tree.
-
公开(公告)号：US20240056387A1
公开(公告)日：2024-02-15
申请号：US17886865
申请日：2022-08-12
Applicant: Micron Technology, Inc.
Inventor： Alexander Tomlinson , Gaurav Sanjay Ramdasi , Greg Alan Becker , Nabeel Meeramohideen Mohamed , Steven Andrew Moyer , Tristan Antonio Partin
CPC classification number: H04L45/48 , G06F16/2246 , H04L12/40195
Abstract: Methods, systems, and devices for techniques to balance log structured merge trees are described. A computing system may rebalance a tree structure having an ordered set of leaf nodes by splitting or joining leaf nodes of the tree structure. To split a leaf node, the computing system may select a key to evenly partition key and value data stored in the leaf. The computing system may place each key block of the leaf node having keys less than or equal to the selected key in a first new leaf node, and may place each key block of the leaf node having keys greater than the selected key in a second new leaf node. To join leaf nodes of the tree structure, the computing system may place each key block and each value block of the leaf node and the adjacent leaf node in a new leaf node.
-
公开(公告)号：US11100071B2
公开(公告)日：2021-08-24
申请号：US16156440
申请日：2018-10-10
Applicant: Micron Technology, Inc.
Inventor： Alexander Tomlinson , Greg A. Becker , Gaurav Sanjay Ramdasi
Abstract: 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.
-
Patent Agency Ranking
公开(公告)号：US20200349139A1
公开(公告)日：2020-11-05
申请号：US16933532
申请日：2020-07-20
Applicant: Micron Technology, Inc.
Inventor： David Boles , John M. Groves , Steven Moyer , Alexander Tomlinson
IPC: G06F16/22
Abstract: Systems and techniques for stream selection from multi-stream storage devices. Notification of a KVS tree write request for a multi-stream storage device is received. The notification includes a KVS tree scope corresponding to data in the write request. A stream identifier (ID) is assigned to the write request based on the KVS tree scope and a stability value of the write request. The stream ID is returned to govern stream assignment to the write request, the stream assignment modifying a write operation of the multi-stream storage device.
-
公开(公告)号：US10706105B2
公开(公告)日：2020-07-07
申请号：US15428912
申请日：2017-02-09
Applicant: Micron Technology, Inc.
Inventor： David Boles , John M. Groves , Steven Moyer , Alexander Tomlinson
IPC: G06F16/901
Abstract: Systems and techniques for collecting and using merge tree garbage metrics are described herein. A kvset is created for a node in a KVS tree. Here, a set of kvset metrics for the kvset are computed as part of the node creation. The kvset is added to the node. The node is selected for a compaction operation based on a metric in the set of kvset metrics. The compaction operation is performed on the node.
-
公开(公告)号：US20180225322A1
公开(公告)日：2018-08-09
申请号：US15428951
申请日：2017-02-09
Applicant: Micron Technology, Inc.
Inventor： David Boles , John M. Groves , Steven Moyer , Alexander Tomlinson
IPC: G06F17/30
Abstract: Systems and techniques for merge tree modifications for maintenance operations are described herein. A request for a KVS tree is received. Here, the KVS tree is a data structure including nodes and the nodes include a temporally ordered sequence of kvsets that store keys in sorted order. A parameter set for the KVS tree is received. The request is executed on the KVS tree by modifying operation of the KVS tree in accordance with the parameter.
-
公开(公告)号：US20250039084A1
公开(公告)日：2025-01-30
申请号：US18806290
申请日：2024-08-15
Applicant: Micron Technology, Inc.
Inventor： Alexander Tomlinson , Gaurav Sanjay Ramdasi , Greg Alan Becker , Nabeel Meeramohideen Mohamed , Steven Andrew Moyer , Tristan Antonio Partin
Abstract: Methods, systems, and devices for techniques to balance log structured merge trees are described. A computing system may rebalance a tree structure having an ordered set of leaf nodes by splitting or joining leaf nodes of the tree structure. To split a leaf node, the computing system may select a key to evenly partition key and value data stored in the leaf. The computing system may place each key block of the leaf node having keys less than or equal to the selected key in a first new leaf node, and may place each key block of the leaf node having keys greater than the selected key in a second new leaf node. To join leaf nodes of the tree structure, the computing system may place each key block and each value block of the leaf node and the adjacent leaf node in a new leaf node.
-
公开(公告)号：US20240143585A1
公开(公告)日：2024-05-02
申请号：US18497145
申请日：2023-10-30
Applicant: MICRON TECHNOLOGY, INC.
Inventor： Jacob Mulamootil Jacob , Gaurav Sanjay Ramdasi , Alexander Tomlinson
IPC: G06F16/2453 , G06F16/215 , G06F16/2455
CPC classification number: G06F16/2453 , G06F16/215 , G06F16/24562
Abstract: A system includes a memory device a processing device, operatively coupled to the memory device. The processing device is configured to receive a request to identify a target key in a key-value store based on a specified key; identify, in at least one of a plurality of sequences of memory keys, the target key based on the specified key, where the plurality of sequences of memory keys includes a sequence of memory keys and a sequence of media keys that comprises designated media keys, where each of the designated media keys is designated as being deleted, where the identifying comprises comparing each of the designated media keys to the specified key; and perform a database operation using the target key.
-
-
-
-
-
-
-
-
-
Search Results
36
records
(took 0.017 seconds)
