Unlock instant, AI-driven research and patent intelligence for your innovation.

Hashing data representing and querying method based on dynamic counting type Bloom filter

A data representation and query method technology, applied in the direction of electrical digital data processing, special data processing applications, calculations, etc., can solve the problems of uncertain node data volume, inability to delete elements at the same time, frequent dynamic changes of elements, etc., and achieve network saving Bandwidth, the effect of improving query efficiency

Active Publication Date: 2014-06-04
HUZHOU TEACHERS COLLEGE
View PDF2 Cites 2 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 to dynamic dynamics without the upper limit of set elements.
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 Bloom Filter (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

[0016] The present invention is a method for representing and querying hash data based on a dynamic count type Bloom filter, which sequentially includes the following steps:

[0017] a) Calculate the number of counter bits m in the CBF according to the set upper limit n of the elements that can be represented by the homogeneous CBF, the error rate fp, and the number of Hash functions k, and generate the initial CBF0;

[0018] 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 CBF0;

[0019] c) Generate an additional CBF and record it as ACBF. ACBF is used to process the same element that appears in 2 or more CBFs in the homogeneous CBF, and insert this element into the ACBF;

[0020] d) When inserting an element, first search it in ACBF, if it is found, delete the element from ACBF; if it is not found, search in the homogeneous CBF, if it is found, it will not be inserted again; If it is not queried in CBF, check if there is any ho...

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

【Technical Field】 [0001] The present 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. 【Background technique】 [0002] Bloom filter is a powerful hash data representation method, which can improve query efficiency and save network bandwidth. It has been widely used in data query in the fields of database, network, peer-to-peer (P2P) and cloud computing. However, the existing Bloom filter cannot delete elements at the same time in a large-scale P2P information retrieval environment, and can also adapt to the problem of dynamic non-set element upper limit. In order to solve this problem, we proposed the establishment of multiple homogeneous counting Bloom filters to adaptively solve the problem of uncertain node data and frequent dynamic changes of elements in P2P networks, namely, dynamic counting Bloom Filter (DCBF). [Content of the invention] [0003] ...

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