Key-Value storage system-oriented indexed searching method and system

Abstract

The invention discloses a Key-Value storage system-oriented indexed searching method and system. The method comprises the steps of S1, acquiring a Key-Value data item, storing the Key-Value data item into block, and generating a prefix complete binary tree according to block nodes; S2, acquiring a key value, and determining a key value digit number k according to the height of the binary tree, wherein the key value is a binary number; S3, acquiring first k digits of the key value, traversing from the first digit of the first k digits of the key value, searching the first 1 in the first k digits of the key value, recording a number j of digits in front of the first 1; S4, judging whether j is smaller than k or not, if j is smaller than k, enabling an objective result i to be equal to 2j, and executing S5, and if j is not smaller than k, enabling the objective result i to be equal to 2k-1-1, and executing S6; S5, cyclically searching from a (j+2)th digit of the key value, and when 1 is searched, enabling i to be equal to 2*(i+1); otherwise, enabling i to be equal to 2*i+1; stopping searching to obtain the objective result i when j is equal to k, and executing S6; S6, through the i value, searching block[i] in the prefix complete binary tree, judging whether the block[i] is not-null or not, and if the block[i] is not-null, outputting a value of the objective result i ; if the block[i] is null, enabling k to be equal to k-1, and then executing S3 until k is equal to 0.

Description

technical field [0001] The invention relates to the technical field of data index query, in particular to an index query method and system oriented to a Key-Value storage system. Background technique [0002] With the rapid development of the Internet, the world today has entered the era of "big data". The latest report of the international data company IDC predicts that within ten years from 2014, the total amount of data generated globally every year will increase by 40%, or about The total amount of data will double every two years, and by 2020 the total amount of global data will reach 44ZB. With the rapid growth of data volume, the form of data is also developing from traditional structured data to unstructured or semi-structured data forms. Traditional relational databases are stretched for the storage capacity of these data. Indexing, web serving of high-traffic sites, and sending streaming media data. In addition, for a specific system, most of the retrieval is bas...

AI Technical Summary

Problems solved by technology

[0003] Key-value databases generally use a tree structure to organize data. With the advent of the era of big data, it is necessary to find specific data in massive amounts of data. If the traditional tree traversal form is used, it will undoubtedly cause huge time overhead. , so an algorithm that can quickly index specific data is essential

Images