Invention Grant
US08700670B2 Insert optimization for B+ tree data structure scalability 有权
插入优化B +树数据结构的可扩展性

Insert optimization for B+ tree data structure scalability
Abstract:
A method, in one embodiment, can include receiving a key and associated data via a computing device. Furthermore, the method can include searching a B+ tree data structure using the key to find a leaf node. The B+ tree data structure is stored by a persistent storage coupled to the computing device. The B+ tree data structure can include a first plurality of nodes that each contains a key-value entry that is not maintained in a sorted order based on its key. In addition, the key and associated data are appended to the leaf node. A sector that includes the leaf node and the key and associated data can be flushed to the persistent storage.
Public/Granted literature
Information query
Patent Agency Ranking
0/0