Bloom filter based on hash fingerprints

A filter and multi-dimensional sub-Bloom technology, applied in instruments, special data processing applications, electrical digital data processing, etc., can solve problems such as difficult hardware implementation, complex genetic algorithm solution, complex algorithm, etc.
CN110716931APending Publication Date: 2020-01-21杉树岭网络科技有限公司
2 Cites 1 Cited by

Patent Information

Authority / Receiving Office
CN · China
Current Assignee / Owner
杉树岭网络科技有限公司
Publication Date
2020-01-21

Smart Images

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

Abstract

The invention discloses a Bloom filter based on a hash fingerprint. The Bloom filter based on the hash fingerprint is formed by the following steps: dividing the structure of a counting type Bloom filter into a plurality of sub-Bloom filters; dividing each dimensional sub-Bloom filter into a plurality of barrels again; and then introducing a hash fingerprint method to enable the storage unit of each bucket to be obtained through calculation of a corresponding hash function. According to the Bloom filter based on the hash fingerprint, concise storage and rapid query of set elements are achieved. The Bloom filter (HFBF) based on the hash fingerprint has relatively low error probability and calculation complexity, and meanwhile, relatively high space utilization rate can be maintained.
Need to check novelty before this filing date? Find Prior Art

Description

technical field

[0001] The present invention relates to a highly spatially multiplexed summary data structure Bloom filter, more specifically, a Bloom filter based on a hash fingerprint. Background technique

[0002] With the continuous expansion of the scale of the Internet, the rapid expansion of the number of users, and the increasingly complex business environment, the scale of shared data has shown geometric growth, which has brought huge challenges to the storage, access, interaction, and management of network resources. How to quickly represent and query large-scale data, and effectively extract and store content summary information is the key to network and distributed system resource sharing, and has always been a research hotspot in domestic and foreign academic circles.

[0003] Bloom Filter (Bloom Filter) is a highly spatially multiplexed synopsis data structure (SynopsisData Structure), which supports collection element representation and query, and is widely us...

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