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.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
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 ...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com