KV data writing and reading method and device based on multi-level index and storage medium

Abstract

The invention discloses a KV data writing and reading method and device based on multi-level indexing and a storage medium, the KV data writing and reading method based on multi-level indexing comprises a KV data writing process, and the KV data writing process comprises the following steps: performing hash operation on a key of KV data to obtain a hash value hash (key) of the key; selecting a corresponding B group tree according to the hash value hash (key); judging whether the value of the KV data exceeds a preset threshold value or not; if the judgment result is no, directly storing the KV data in the corresponding B-family tree; and if the judgment result is yes, storing the KV data in a hash index bitash file. Through the combination of the B-group tree and the hash index bitash file and the multi-level index, the time complexity of O (1) can be realized, the read operation efficiency is greatly improved on the premise of ensuring that the write operation performance is not weakened, a KV database storage engine with better performance is provided, and the KV database storage engine is suitable for a scene of massive read operation.

Description

technical field [0001] The present invention relates to the technical field of database storage, in particular to a multi-level index-based KV data writing and reading method, device and storage medium. Background technique [0002] The KV database refers to the Key-value database, which is a database that stores data in key-value pairs. In order to improve the query speed of the database, it is necessary to establish a database index for the database. There are three common database index data structures for the KV database: hash table, ordered array, and search tree. [0003] The hash table stores key-value key-value pairs. If you use a hash table to store the index, you must first use the hash function to convert the key into a corresponding Index position in the array, and then put the value in this position. If multiple keys get the same index after conversion, then in A linked list is added here to store key-value objects with the same hash value. If you are given a...

AI Technical Summary

Problems solved by technology

Although the use of the dichotomy can greatly improve the efficiency of the query, the time complexity of O(log(N)) still needs to be improved for the query efficiency of the database, and the key-value array is stored in an orderly manner. When the data needs to be updated It will be troublesome when you insert a record in the middle and you have to move all the records behind, which is too costly

Images