Index structure based on dictionary tree, data query optimization method and main memory manager

Abstract

The invention discloses an index structure based on a dictionary tree, a data query optimization method and a main memory manager, and belongs to the field of data storage. The index structure is composed of containers, wherein the containers store T nodes and S nodes; complete keys are divided into partial keys; the T nodes store the front m / 2 bits of the partial keys, and the S nodes store the rear m / 2 bits of the partial keys; and the partial keys passing through a certain node path from the root node of the dictionary tree are connected to form the complete keys. And the index structure ismore compact, so that the main memory space utilization rate is improved. The T node is directly skipped to a subsequent brother node by using a skipping relay, so that the comparison frequency is reduced, and the search performance is improved; a T node skip list is used for skipping a T node to an S node, a container skip list is used for skipping the S node to the T node, and the S node directly skips to the nearest target, so that a large number of unnecessary entries are skipped, and the searching performance is improved; and the index structure and the main memory address are completelydecoupled by a pointer P which is analyzed by the main memory manager and contains each hierarchical structure ID.

Description

technical field [0001] The invention belongs to the technical field of data storage, and more particularly, relates to a dictionary tree-based index structure, a data query optimization method, and a main memory manager. Background technique [0002] At this stage, due to the promotion of Moore's Law, both data and disk capacity are growing rapidly, while the capacity of DRAM (Dynamic Random Access Memory, hereinafter collectively referred to as "main memory") is growing relatively slowly. In the face of massive data, DRAM has become the bottleneck of system performance. Improving the utilization of DRAM storage capacity space is crucial to improving the overall performance of the system. Due to the limitation of main memory capacity, massive indexes cannot be completely stored in main memory, and are often partially stored in secondary storage devices, such as magnetic disks or solid-state disks. For applications such as database systems and file systems, it is very import...

AI Technical Summary

Problems solved by technology

[0005] Aiming at the defects of the prior art, the purpose of the present invention is to solve the technical problem of the low utilization rate of the main memory space by the index structure in the prior art

Images