Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

A Bloom Filter Circuit for Approximate Membership Query in Hamming Space

A technique of approximate member query and Bloom filter, applied in the direction of logic circuit with logic function, XOR circuit, electrical digital data processing, etc., can solve the problem of lack of hardware circuit and lack of Bloom filter, etc.

Active Publication Date: 2022-01-14
NINGBO UNIV
View PDF6 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

At present, there is still a lack of Bloom filters that can be used for approximate membership queries in Hamming spaces. In addition, the current Bloom filters are mainly implemented by software, and there is still a lack of circuits composed of hardware.

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

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A Bloom Filter Circuit for Approximate Membership Query in Hamming Space
  • A Bloom Filter Circuit for Approximate Membership Query in Hamming Space
  • A Bloom Filter Circuit for Approximate Membership Query in Hamming Space

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0018] Example: such as Figure 1~3 As shown, a Bloom filter circuit for approximate membership query in Hamming space includes multiple parallel filter units and an OR gate 1, and the output terminal of the OR gate outputs a filter signal.

[0019] The filter unit includes a random flip module 2, a plurality of parallel bit string modules 3, a random hash module 4 corresponding to the bit string module 3 and an AND gate 5 corresponding to the bit string module 3, and the random hash module 4 and the AND gate 5 A plurality of parallel multiplexers 6 are arranged between the gates 5, and the random flipping module 2 is composed of four XOR gates to form a four-bit random flipping module, and the output data is Q 0 , Q 1 , Q 2 and Q 3 , the bit string module 3 is composed of two selectors to form a 2-bit bit string module, the input terminals of the two selectors are connected in parallel, and the input signals are both Q 0 , Q 1 , Q 2 and Q 3 , the selection signal input...

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 Bloom filter circuit for approximate membership query in Hamming space, which is characterized in that it comprises a plurality of parallel filter units and an OR gate, the input end of the filter unit is connected with the input signal, and the output end of the filter unit is connected with the input signal. The input end of the OR gate is connected, and the output end of the OR gate outputs the filtered signal. The advantage is that multiple parallel filter units and an OR gate form a Bloom filter circuit for approximate membership query in Hamming space, which realizes Approximate membership query problem, and can be applied to approximate membership query of different granularities.

Description

technical field [0001] The invention relates to a Bloom filter, in particular to a Bloom filter circuit for approximate membership query in Hamming space. Background technique [0002] There are a large number of set membership query problems in real life, that is, judging whether a query object is a member of a data set. For example, a security officer wants to check whether an unknown substance (with some detectable high-dimensional features) is a listed hazardous chemical; a network administrator wants to know whether a user's behavioral characteristics are harmful; Checking whether a submitted photo is similar to a photo in a large database, the above problems can be collectively referred to as approximate membership query. These queries all need to judge the distance between the query data and the data in the collection. The closer the query data is to the target data, the more valuable the data is. If it is a small low-dimensional data set, it can be solved by linea...

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): H03K19/20H03K19/21G06F16/2458
CPCH03K19/20H03K19/21
Inventor 钱昱成钱江波黄志鹏陈叶芳陈华辉
Owner NINGBO UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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