The invention discloses a B + tree reading caching method. The method includes firstly, determining the capacity of a current available cache space; determining front N layers of B + tree non-leaf nodes of which the capacities can be cached, caching all node information of the first N layers; the invention discloses a method and a device for searching leaf nodes. in each longitudinal path; the number of the nodes cached in the cache space is the same; therefore, no matter what leaf node the data on, the number of times the node information needs to be acquired in the cache space is the same, and the number of times the node information needs to be acquired in the disk is the same, so that the access time to the leaf nodes of the same B + tree is very close, and the overall stability of data reading is improved. The invention further provides a B + tree reading caching system and device, and a computer readable storage medium which can also achieve the above technical effects.

B + tree reading caching method and related device

The embodiment of the invention relates to the technical field of data processing. In particular, the invention relates to a full N-way tree construction method and device. According to the method, calculating the required storage space sum of the full N-way tree based on the number of the nodes of the full N-way tree; obtaining a memory space according to the required storage space sum; allocating the memory space to each node in the full N-way tree based on a plurality of set index values.Therefore, the memory space can be distributed at one time; the problem that the number of times of memory space distribution is too large is solved, whether the memory space address pointed by the pointer is the same as the set memory space address or not is used for mutually storing the memory space addresses of the root node and the child node, the problem that data are excessively dispersed can be avoided, and then the Cache Misoning phenomenon is reduced.

A full N-way tree construction method and device

The embodiment of the invention provides a cache-coloring memory allocation method and device for search trees. The method includes: constructing the first search tree; determining that the first search tree has N layers of nodes; acquiring the number of the nodes which each layer in the N layers of nodes has; allocating corresponding colors in coloring colors of a memory for each layer of nodes according to the number of the nodes which each layer in the N layers of nodes has, wherein the corresponding colors allocated for all the layers of nodes are mutually different; and generating the second search tree after cache coloring according to the colors corresponding to each layer of nodes and the memory corresponding to the colors. Only the memory which can be mapped to the corresponding coloring colors is allocated when the memory is allocated for each layer of nodes according to the colors corresponding to each layer of nodes in the second search tree, mapping relationships exist between the memory and a Cache, thus an effect that the different layers of nodes cannot mutually compete for the Cache can be guaranteed, and thus search performance is improved.

Xie Gaogang

Papers

Cache-coloring memory allocation method and device for search trees