Data query method based on A + tree data structure storage

• Main Authors: ZHONG SHIPING, LIANG QING, ZHONG RUI, JIANG ZHENDONG, LUO MANG, WU ZHIQIANG, TAN JIANHUI, HU ZONGPING, PENG AOCHEN, LI ZHI, SHU CAIWEI, YUE YIZUO, DENG ZHENHUA, WU KANGWEI, ZHONG SHENGPENG, LIU MINGZHE
• Format: Patent
• Language: Chinese; English
• Published: 22.11.2022
• Subjects: CALCULATING; COMPUTING; COUNTING; ELECTRIC DIGITAL DATA PROCESSING; PHYSICS

The invention relates to the technical field of computer data structures and data query methods, in particular to a data query method based on A + tree data structure storage, which comprises the following steps of: orderly segmenting key values of data to obtain a digital arrangement feature sequence; sequentially associating digits in the sequence with array subscripts in each hierarchical node of the tree structure to form a link expressed by combining the tree structure and arrays; and storing a data address or a data page address in an array of leaf sub-nodes, storing a secondary node address in an array of non-leaf nodes, and constructing a data query method based on A + tree data structure storage. Compared with a Hash algorithm, efficient data query is realized in a mode of combining dynamic and static tree nodes, data traversal is supported, and no Hash conflict exists; when the method is applied to an external memory, the A + tree effectively reduces I/O requests by combining links and data pages, a