B+ tree manipulation device with node index and method thereof

Abstract

The present application relates to information processing technology, and in particular, relates to a B+ tree operating device and its method, wherein, the B+ tree operating device includes: a node loading unit, a node searching unit, a node index register file, and a node searching device coupled to a node through multiple ports The node memory of the unit; wherein, the node loading unit obtains the node address stored in the node memory from the node index register file according to the node index, and obtains the address of one or more keywords of the node according to the address of the node; the node memory is loaded according to the node The address indicated by the unit provides one or more keys as comparison keys to the node search unit; the node search unit compares the comparison key with the search key, and outputs a search result. The present application uses hardware circuits to realize B+ tree operations, which utilizes the characteristics of hardware circuits to operate B+ trees, and realizes B+ tree operations faster.

Description

technical field [0001] The present application relates to information processing technology, and in particular, relates to a B+ tree operating device provided by integrated circuit hardware and a method for operating a B+ tree using the device. Background technique [0002] B+ tree is a data structure, and B+ tree is often used to store indexes in file systems and databases. figure 1 Shows the B+ tree. The B+ tree includes a root node, multiple intermediate nodes and multiple leaf nodes. Node 120 is the root node. Node 130, node 132, and node 134 are intermediate nodes, and intermediate nodes are nodes that are neither root nodes nor leaf nodes. Nodes (140, 142, 144...150, 152, 154) are leaf nodes. [0003] The intermediate nodes of the B+ tree include no more than m elements, and m is called the order of the B+ tree. Each element of the root node and the intermediate node of the B+ tree records a keyword (Key) and a pointer to a subordinate node. For example, node 130...

AI Technical Summary

Problems solved by technology

Dichotomy is the search algorithm with almost the best performance that software can obtain. However, in the era of big data, the increase in the number of data items makes the performance of the search algorithm for software operating B+ trees unable to meet the requirements.

Images