Index tree construction method and system for key-value storage system

A storage system and construction method technology, applied in the field of index tree construction for key-value storage systems, can solve problems such as low retrieval efficiency, and achieve the effects of low space overhead and high efficiency

Active Publication Date: 2021-11-30
INST OF COMPUTING TECH CHINESE ACAD OF SCI
View PDF10 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

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

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Index tree construction method and system for key-value storage system
  • Index tree construction method and system for key-value storage system
  • Index tree construction method and system for key-value storage system

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0037] In order to make the purpose, technical solution and advantages of the present invention clearer, the method for constructing an index tree oriented to a key-value storage system proposed by the present invention will be further described in detail below in conjunction with the accompanying drawings. It should be understood that the specific implementation methods described here are only used to explain the present invention, and are not intended to limit the present invention.

[0038] The present invention proposes a method for constructing an index tree oriented to a key-value storage system. The index tree constructed by this method is called RH-Tree (Radix Hashing Tree, hash index tree). Compared with the tree index structure with operation complexity of O(logn) such as B+ tree, RH-Tree has a better single operation capability O(L+K); compared with hash index, RH-Tree On the one hand, it can support range search, and on the other hand, RH-Tree can dynamically handl...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention relates to a method for constructing an index tree oriented to a key-value storage system, comprising: sorting and dividing prefixes of key values ​​of key-value data to generate a dictionary tree as the upper structure of the index tree; value to build a hash table, and generate the lower structure of the index tree with the hash table; establish the corresponding relationship between key-value data-hash table-dictionary tree, and generate the index tree. The index tree construction method of the present invention performs key-value data index operations through the constructed index tree of the upper and lower layers, and has better single operation capability O(L+K), lower space overhead and higher efficiency , and supports range search and dynamically handles data growth.

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...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Patents(China)
IPC IPC(8): G06F16/22
CPCG06F16/2246
Inventor 韩书楷蒋德钧熊劲
Owner INST OF COMPUTING TECH CHINESE ACAD OF SCI
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap