Supercharge Your Innovation With Domain-Expert AI Agents!

Bloom filter tree structure and key-value pair storage method for dynamically storing key-value pairs

A filter and Bloom's technology, which is applied in the field of Bloom tree's storage structure for key-value pairs, can solve problems such as unsupported, and achieve the effect of reducing time and resource consumption

Active Publication Date: 2020-06-16
HUNAN UNIV
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] But the traditional Bloom filter can only support the dependent query of whether the element exists in the set
If the element is a key, it can only support the subordinate query of whether the key exists in the collection, but cannot support the (key, value) operation
Because Bloom filters cannot store values ​​directly, traditional Bloom filters cannot be used to operate on key-value pairs

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
  • Bloom filter tree structure and key-value pair storage method for dynamically storing key-value pairs
  • Bloom filter tree structure and key-value pair storage method for dynamically storing key-value pairs
  • Bloom filter tree structure and key-value pair storage method for dynamically storing key-value pairs

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0023] When processing static data in this implementation, the selected memory size m=2 20 bit, the root node occupies 95325bit, and H with 18 rows and 8 columns is selected 3 For the base matrix of hash functions, the first 16 rows of the base matrix are extracted on the root node, and k=3 hash functions are selected for each group, and the number of groups g=1024 is processed, and the tree height h=10 at this time. figure 1 It is a schematic diagram of the static Bloom tree structure, from which the key-value pair insertion and query process can be analyzed.

[0024] Insert operation Insert(key, value) process: Find the leaf node corresponding to the value according to the value, get the position code of the leaf node, and then determine a unique path from the root node to the leaf node. Calculate two sets of hash functions for the root node, and use k hash functions h for the key (i,1) , h (i,2) ,..., h (i,k) (i represents the group number of the selected hash function)...

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 discloses a Bloom filter tree structure of a dynamic storage key value pair and a key value pair storage method. The Bloom filter tree structure comprises complete d fork trees and is characterized in that each node of each complete d fork tree is a Bloom filter, each node of each complete d fork tree represents one value, the size of a storage unit of each node is one half of the size of a storage unit of the father node of the node, each root node includes d*k different Hash functions, namely each root node includes d Hash groups, and each group includes k Hash functions. By adopting the Bloom filter tree structure in the fields of applications such as database interaction query, high-speed network resource positioning and computer network monitoring producing massive data and needing key value query, the set query time can be greatly shortened, resource consumption can be reduced, reached data can be dynamically processed, and a network environment is adapted.

Description

technical field [0001] The invention relates to the field of computer network and computer system storage, especially the application field of high-performance, high-throughput interactive query, and specifically relates to an expandable Bloom tree storage structure and method for key-value pairs. Background technique [0002] In recent years, with the rapid development of computers, the size of collections in databases, networks, and other applications has grown geometrically. Storing and querying key-value pairs (key, value) is a common task in computer systems, which requires the design of corresponding key-value pair storage data structures to support fast key-value pair queries. Key-value pair operations often appear in network and storage systems, such as key-value database MongoDB, CouchDB. Each unique key put into the key-value pair storage system corresponds to a value. For example, (3, 5) is a key-value pair whose key is 3 and value is 5. Store (3, 5) in After th...

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/22G06F16/245
CPCG06F16/2246G06F16/245
Inventor 潘海娜凌纯清谢鲲
Owner HUNAN UNIV
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More

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

© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com