Patent ID: 9454550
Filing Date: 2016-09-27
CPC Classification: G06F

Claim Text:
1. A Database method for a B+ tree having a predetermined B+ tree construction based on a processor executing instructions in a memory for processing data in a data storage space of a phase-change non-volatile random access memory (PRAM), comprising the operations of: dividing the data storage space in each of a plurality of nodes of a B+ tree into an area sequentially accessing said plurality of data records; and inserting, retrieving, and deleting a certain key value with respect to each of the sequentially accessed data records, and wherein the operation of inserting the key value inserts a new key value to the area wherein the operation of retrieving the key value identifies whether the node is a leaf node, and sequentially retrieving the area wherein the operation of deleting the key value merges area wherein said executing modifies the B+ tree construction which reduces a number of write operations to said PRAM and minimizes a concentration of write operations to a certain area of said PRAM.