Index tree construction method and system for key value storage system

Abstract

The invention relates to an index tree construction method for a key value storage system, which comprises the following steps of: sorting and dividing prefixes of key values of key value data to generate a dictionary tree serving as an upper layer structure of an index tree; constructing a hash table by using the hash value of the key value, and generating a lower layer structure of the index tree by using the hash table; and establishing a corresponding relation between the key value data, the hash table and the dictionary tree, and generating the index tree. According to the index tree construction method, key value data indexing operation is conducted through the constructed index tree of the upper-layer and lower-layer structure, more excellent single operation capacity O(L+K) is achieved, lower space cost and higher efficiency are achieved, and range finding and dynamic data increasing processing are supported.

Description

technical field [0001] The invention belongs to the technical field of key-value storage and index stored in a computer, and in particular relates to a method and system for constructing an index tree oriented to a key-value storage system. Background technique [0002] For a storage system, how to efficiently organize and index these data has become a key factor affecting the efficiency of a storage system. For the design of memory indexes, the index types that are widely used at this stage mainly include the following: [0003] 1. B+tree (B+tree): A multi-fork search tree in which a node can have more than 2 child nodes. It is capable of storing data, sorting it, and allowing data structures that perform lookups, sequential reads, insertions, and deletions to run in O(log n) time complexity. The B+tree algorithm is widely used in databases and file systems. Invented "A B+ tree read cache method and related devices" (public number: CN109492005A), which discloses a B+ tre...

AI Technical Summary

Problems solved by technology

[0007] In order to solve the problem of low retrieval efficiency in the above-mentioned storage system, the present invention uses an index tree with upper and lower index structures to meet the needs of the key-value storage system for efficient retrieval of key-value data

Images