DATABASE METHOD FOR B+ TREE BASED ON PRAM

摘要

There is provided a Database method for a B+ tree based on a PRAM. The database method is characterized of dividing each node into area 1 and area 2; inserting/retrieving/deleting a certain key value for the each node. Inserting a key value is characterized of firstly inserting a new key value to area 2, if area 2 in the node is not in a full state. Retrieving a key value is characterized of identifying whether the node is a leaf node; and if the node is a leaf node, retrieving area 1 and area 2 sequentially. Deleting a key value is characterized of: merging area 1 and area 2 in the node; and deleting a key value in the merged node. Therefore, the present disclosure provides advantages of enhancing durability and data processing capability.

主权项

1. A Database method for a B+ tree based on a PRAM, comprising the operations of:
dividing data storage space in each node into area 1 and area 2; and inserting, retrieving, and deleting a certain key value in record for the each node, wherein the operation of inserting the key value is characterized of preferentially inserting a new key value to the area 2 in case where area 2 in the node is not in a full state, wherein the operation of retrieving the key value is characterized of identifying whether the node is a leaf node, and sequentially retrieving the area 1 and the area 2 in case where the node is a leaf node, and wherein the operation of deleting the key value is characterized of merging area 1 and area 2 in the node, and deleting the key value in the merged node.