Data storage and query method based on matrix hash

Abstract

The invention relates to a data storage and query method based on matrix hashes. The method comprises the steps that 1), a hash table data structure is established, wherein the structure comprises z child tables, z is an even number, and the sizes of the child tables decrease progressively in equal difference; for 1<=i<= , the i child table is combined with the (z-i+1) child table to obtain child tables with the same size; 2), an auxiliary data structure is established, wherein the structure comprises z Bloom filters corresponding to the z child tables, and the sizes of the Bloom filters decrease progressively in equal difference; for 1<=i<= , the i Bloom filter is combined with the (z-i+1) Bloom filter to obtain Bloom filters with the same size, and the Bloom filtersare added together to form a multi-bit Bloom filter; 3), a key-value pair is inserted by using the hash table data structure and the auxiliary data structure to achieve data storage. By means of themethod, rapid update and rapid query can be achieved.

Description

technical field [0001] The invention belongs to the technical field of memory databases, in particular to a method for organizing, indexing and storing data based on a matrix hash algorithm. Background technique [0002] Compared with disk databases, in-memory databases have higher flexibility and ease of use. In-memory databases can be divided into relational in-memory databases and key-value in-memory databases in terms of paradigms. The key-value-based in-memory database (Key ValueStore) has the advantages of flexibility, simplicity, memory saving, and fast query. Compared with the relational in-memory database, it has unique advantages, so it is widely used in major Internet companies, such as Amazon and Facebook. , Youtube, Baidu, Sina, Sohu, etc. The data in the key-value storage system exists in the form of key-value pairs and is stored in a hash table. Therefore, the hash algorithm, as the core technology of the key-value storage system, is a key factor that directl...

AI Technical Summary

Problems solved by technology

[0007] In order to solve the problem of hash table conflicts and query time, and overcome the defects of high collision rate, low memory usage efficiency, and low loading rate in existing hash tables, the present invention provides a multi-subtable hash and Bloom filter A new hash table design scheme combining , bitmap - "matrix hash"

Images