JP2015162042A5

JP2015162042A5 -

Info

Publication number: JP2015162042A5
Application number: JP2014036341A
Authority: JP
Filing date: 2014-02-27
Publication date: 2015-10-15
Anticipated expiration: 2034-02-27

Claims

An index management device that manages an index tree composed of leaf nodes and other internal nodes that are the lowest layers,
A hierarchy having the leaf node storing a set of a predetermined number of keys and a predetermined number of values is defined as a 0th hierarchy, the 0th hierarchy and the 1st hierarchy immediately above the lower hierarchy, and the 1st hierarchy. Also, the second hierarchy one level above is the middle hierarchy, the third hierarchy above the second hierarchy is the upper hierarchy,
In the lower hierarchy, the index tree search and update are managed by a first type node storing a set of a predetermined number of keys and a predetermined number of pointers representing positions of child nodes or a predetermined number of values. The hierarchy management department;
In the middle hierarchy, a predetermined number of keys and one group pointer representing the head position of the node group in the lower hierarchy are stored, and the pointer represents the position of each node in the node group, the first hierarchy A middle-tier management unit that manages the search and update of the index tree by a third type of node that stores a reduced pointer that is smaller in size than the pointer stored in the type of node;
In the upper hierarchy , an upper hierarchy management unit that manages the search and update of the index tree by a second type of node that stores a predetermined number of keys and one group pointer representing the head position of a node group in the lower hierarchy And an index management device.

The middle level manager searches for a key having the maximum value below the search key from the keys stored in the third type node, and stores the key in the same node together with the searched key. 2. The index management apparatus according to claim 1 , wherein a position specified by calculating an offset amount from a head position of a node group indicated by a group pointer based on the reduced pointer is traced. .

An index management device that manages an index tree composed of leaf nodes and other internal nodes that are the lowest layers,
A hierarchy with the above leaf nodes storing a set of a predetermined number of keys and a predetermined number of values is defined as a 0th hierarchy, and the 1st hierarchy and the nth hierarchy (n is “1 ≦ n <total number of hierarchies−1”). A predetermined number of keys and one group pointer representing the head position of a node group in the lower hierarchy, and sufficient to represent the position of each node in the node group A lower layer management unit that manages the search and update of the index tree by a third type of node that stores a reduced pointer of an appropriate size;
Searching and updating the index tree by a second type node storing a predetermined number of keys and one group pointer representing the head position of a node group in the lower hierarchy in the upper hierarchy above the nth hierarchy An index management apparatus comprising an upper layer management unit for managing

The lower layer management unit searches for a key having the maximum value below the search key from the keys stored in the third type node, and stores the key in the same node together with the searched key. It follows the position specified by calculating the offset amount from the head position of the node group indicated by the group pointer based on the reduced pointer,
The upper layer management unit searches for a key having the maximum value below the search key from the keys stored in the second type node, and stores the key in the same node together with the searched key. 4. The index management apparatus according to claim 3 , wherein the index management apparatus is configured to follow a position specified by calculating an offset amount from the head position of the node group indicated by the group pointer based on the node size.

The lower layer management unit searches for a key having the maximum value below the insertion key from the keys stored in the third type node, and stores the key in the same node together with the searched key. The leaf node to which the insertion key is to be inserted is searched by following the position specified by calculating the offset amount from the head position of the node group indicated by the group pointer based on the reduction pointer, and the searched leaf If there is an empty space in the node, the pair of the insertion key and value is inserted into the leaf node. On the other hand, if there is no empty space in the searched leaf node, the leaf node is divided and the insertion key and the pointer are inserted. Was made to insert a pair of
The upper layer management unit searches for a key having the maximum value below the insertion key from among the keys stored in the second type node, and is stored in the same node together with the searched key. 4. The index management apparatus according to claim 3 , wherein the index management apparatus is configured to follow a position specified by calculating an offset amount from the head position of the node group indicated by the group pointer based on the node size.