Expandable Bloom filter enquiring method and element inserting method thereof

A query method and filter technology, applied in the field of extensible Bloom filter query method and its element insertion, can solve the problems of high query time complexity, rapid growth rate of misjudgment rate, limited degree of mitigation, etc.

CN101082923AInactive Publication Date: 2007-12-05HUNAN UNIV
0 Cites 13 Cited by

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Publication Date
2007-12-05
Estimated Expiration
Not applicable · inactive patent

Smart Images

  • Figure 1
    Figure 1
  • Figure 2
    Figure 2
  • Figure 3
    Figure 3
Patent Text Reader

Abstract

The invention discloses an inquiring method of scalable Bloom filter and element inserting method of the inquiring method of scalable Bloom filter, which is characterized by the following: adding filter with length increased times by times to keep low error judging rate under data set element increasing condition; controlling the error judging rate at 1%; obtaining the one-time element inquiring time at 20us in the CPU machine at 3.0GHz with faster speed than DBF inquiry; possessing widely applying prospect due to supporting dynamic expansion of set.
Need to check novelty before this filing date? Find Prior Art

Description

technical field

[0001] The invention relates to the technical field of distributed computing, in particular to an application in which a large amount of data is generated by a distributed system and requires interactive query, and specifically relates to an extensible Bloom filter query method and an element insertion method thereof. Background technique

[0002] With the rapid development of computing technology and the Internet, the amount of data continues to increase, the heterogeneity and complexity of the network continue to increase, and the increasingly diverse and complex computer environment requires multiple levels of form, scale, function and performance. Conduct scalability research on computing systems. The scalability of storage systems is a hotspot in current computer research. The Bloom filter uses a bit string to represent the data set and can effectively support the hash lookup of the elements. It is a concise data structure that can represent the set and...

Examples

Embodiment Construction

[0131] This embodiment provides a H-based 3 Extensible Bloom filter implemented by hash function, in which H 3 Hash function is a kind of universal hash function (universal Hash) defined by Carter and Wegman. h 3 The function has a strong hash property and is a common implementation function of Bloom filter; and because the hash calculation of each input element only requires simple "AND" and "XOR" operations, it is convenient Implementations, especially hardware implementations, are among the most commonly used hash functions for computer hardware.

[0132] h 3 A hash function is a linear transformation B T =Q r×w A T , the element A=a of w-bit length 1 a 2 La w Hash address converted to r-bit B=b 1 b 2 Lb r ,Right now

[0133] b 1 b 2 M ...