公开(公告)号：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

IPC: H04L45/48 ,  G06F16/22

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.

公开(公告)号：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

IPC: H04L45/48 ,  G06F16/22

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.

公开(公告)号：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

IPC: H04L45/48 ,  G06F16/22 ,  H04L12/40

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.