公开(公告)号：US11379431B2

公开(公告)日：2022-07-05

申请号：US16707369

申请日：2019-12-09

申请人： Microsoft Technology Licensing, LLC

发明人： Yogesh Bansal ,  Anil Ruia ,  Alexandre Costa ,  Tobias Klima ,  Brett Shirley ,  Ian Jose ,  Andrew Goodsell ,  Serguei Martchenko ,  Umair Ahmad

IPC分类号： G06F16/00 ,  G06F16/18 ,  G06F16/17 ,  G06F16/16 ,  G06F16/22 ,  G06F9/54 ,  G06F9/50 ,  G06F16/245

摘要： A system for write optimization in transactional data management systems is described. The system stores a tree data structure that comprises a root, a plurality of internal nodes, and a plurality of leaf nodes. Each internal node comprises a pivot key and a child pointer. Each leaf node stores key-value pairs sorted by a corresponding key. The system forms a plurality of hybrid nodes. The hybrid nodes comprise a layer of internal nodes that are immediate parents of the plurality of leaf nodes. A buffer is formed only for each internal node of the plurality of hybrid nodes. The buffer is used to store a message that encodes an operation. The message is to be applied to the corresponding leaf nodes of the plurality of hybrid nodes.

公开(公告)号：US20210173819A1

公开(公告)日：2021-06-10

申请号：US16707369

申请日：2019-12-09

申请人： Microsoft Technology Licensing, LLC

发明人： Yogesh Bansal ,  Anil Ruia ,  Alexandre Costa ,  Tobias Klima ,  Brett Shirley ,  Ian Jose ,  Andrew Goodsell ,  Serguei Martchenko ,  Umair Ahmad

IPC分类号： G06F16/18 ,  G06F16/17 ,  G06F16/16 ,  G06F16/22 ,  G06F16/245 ,  G06F9/54 ,  G06F9/50

摘要： A system for write optimization in transactional data management systems is described. The system stores a tree data structure that comprises a root, a plurality of internal nodes, and a plurality of leaf nodes. Each internal node comprises a pivot key and a child pointer. Each leaf node stores key-value pairs sorted by a corresponding key. The system forms a plurality of hybrid nodes. The hybrid nodes comprise a layer of internal nodes that are immediate parents of the plurality of leaf nodes. A buffer is formed only for each internal node of the plurality of hybrid nodes. The buffer is used to store a message that encodes an operation. The message is to be applied to the corresponding leaf nodes of the plurality of hybrid nodes.