Microsoft Technology Licensing, LLC

Alexandre Costa

Anil K Ruia

Yogesh Bansal

Brett A Shirley

Serguei Martchenko

Andrew E Goodsell

Ian Jose

Umair Ahmad

Tobias Marius Klima

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.

Write optimization in transactional data management systems

Growing community of inventors

Redmond, WA, United States of America

Alexandre Costa