A Hash Data Representation and Query Method Based on Dynamic Counting Bloom Filter

A technology of data representation and query method, applied in electrical digital data processing, special data processing applications, computing, etc., can solve the problems of uncertain data volume of nodes, unable to delete elements at the same time, frequent dynamic changes of elements, etc., to save the network Bandwidth, the effect of improving query efficiency

Active Publication Date: 2017-02-08
HUZHOU TEACHERS COLLEGE
View PDF2 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, in the large-scale P2P information retrieval environment, the existing Bloom filter cannot both delete elements and adapt itself dynamically without the upper limit of set elements.
In order to solve this problem, we propose to establish multiple isomorphic counting Bloom filters to adaptively solve the problem of uncertain data volume of nodes and frequent dynamic changes of elements in P2P networks, that is, dynamic counting BloomFilter (hereinafter referred to as DCBF).

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

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0020] A kind of hash data representation and query method based on dynamic counting type Bloom filter of the present invention, comprises the following steps successively:

[0021] a) Calculate the number of counter bits m in the counting Bloom Filter according to the upper limit value n of elements representable by the set isomorphic counting Bloom Filter, the error rate fp, and the number k of Hash functions, and generate the initial counting BloomFilter;

[0022] b) Use k hash function sets h(x)={h 1 (x), h 2 (x)... h i (x)... h k (x)} Insert the original data set into the counting Bloom Filter;

[0023] c) Generate an additional counting Bloom Filter and record it as ACBF. ACBF is used to process the same element that appears in two or more counting Bloom Filters found in the isomorphic counting Bloom Filter, and insert this element into ACBF ;

[0024] d) When inserting an element, first search in the ACBF, if found, delete the element from the ACBF; if not found, t...

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 hashing data representing and querying method based on a dynamic counting type Bloom filter. The hashing data representing and querying method comprises the following steps of inserting data elements; deleting the data elements; and querying the data elements. A DCBF (digital continuous beam former) is established by establishing a plurality of isomorphism CBF (continuous beam formers) and an ACBF (analog continuous beam former); by using the DCBF, data are queried efficiency in a big dataset environment without upper limit of the number of the elements; functions of the DCBF are more powerful than functions of the original CBF and functions of a DBF (digital beam former); adaptive dynamic big dataset showing performance is acquired while high-efficiency query is realized; and the querying efficiency can be improved and the network bandwidth can be saved when query is carried out in environments such as a P2P (peer-to-peer) network of a big dataset and cloud computing.

Description

[0001] 【Technical field】 [0002] The invention relates to the technical field of data representation and query methods, in particular to the technical field of representation methods based on Bloom filter hash data. [0003] 【Background technique】 [0004] Bloom filter is a powerful hash data representation method, which can improve query efficiency and save network bandwidth, and has been widely used in data query in the fields of database, network, peer-to-peer (P2P) and cloud computing. However, existing Bloom filters cannot simultaneously delete elements and adapt to the problem of dynamic no-set element upper limit in a large-scale P2P information retrieval environment. In order to solve this problem, we proposed to establish multiple isomorphic counting Bloom filters to adaptively solve the problem of uncertain node data volume and frequent dynamic changes of elements in the P2P network, that is, dynamic counting BloomFilter (hereinafter referred to as DCBF). [0005] 【...

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): G06F17/30
CPCG06F16/2255G06F16/245
Inventor 蒋云良严华云范婧
Owner HUZHOU TEACHERS COLLEGE
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