Hash table building method based on cuckoo hash and Bloom filter

A Bloom filter and filter table technology, applied in database indexing, structured data retrieval, etc., to reduce selection restrictions, improve space utilization, and high flexibility

Active Publication Date: 2022-01-21
PLA STRATEGIC SUPPORT FORCE INFORMATION ENG UNIV PLA SSF IEU +1
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Its disadvantages are also obvious. The more elements are inserted, the greater the probability of misjudging "in the set"

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
  • Hash table building method based on cuckoo hash and Bloom filter
  • Hash table building method based on cuckoo hash and Bloom filter
  • Hash table building method based on cuckoo hash and Bloom filter

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0032] Such as figure 1 As shown, a Hash table building method based on cuckoo hash and Bloom filter of the present invention, the method divides the storage space into m groups, each group includes a storage table and n filter tables, that is, there are m Storage table, corresponding to ST(1), ST(2)...storage table ST(m), that is, corresponding to storage table 1, storage table 2...storage table m; there are m*n filter tables, corresponding to FT(11 ), FT(12)...FT(1n), FT(21), FT(22)...FT(2n),..., FT(m1), FT(m2)...FT(mn), which correspond to the first group The 1st filter table, the 1st group 2nd filter table... the 1st group nth filter table, the 2nd group 1st filter table, the 2nd group 2nd filter table... the 2nd group nth filter table , ..., the first filter table of the mth group, the second filter table of the mth group ... the nth filter table of the mth group; the length of the storage table is 2 k , the width is k bits; the length of the filtering table is 2 k , t...

Embodiment 2

[0040] Such as figure 2 As shown, another Hash table building method based on cuckoo hash and Bloom filter of the present invention.

[0041] The method divides the storage space into m groups, each group includes a storage table and n filter tables, there are integers i∈[1,m], integers j∈[1,n], and the expression of the storage table is ST (i), the representation of the filter table is FT(ij); that is, there are m storage tables, corresponding to ST(1), ST(2) ... storage table ST(m), that is, corresponding to storage table 1 and storage table 2 ...storage table m; there are m*n filter tables, corresponding to FT(11), FT(12)...FT(1n), FT(21), FT(22)...FT(2n),...,FT(m1 ), FT(m2)...FT(mn), corresponding to the first filter table of the first group, the second filter table of the first group...the nth filter table of the first group, and the first filter table of the second group , the 2nd filter table of the 2nd group...the n-th filter table of the 2nd group, ..., the 1st fil...

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 relates to a Hash table building method based on cuckoo hash and Bloom filter. The present invention divides the storage space into m groups, each group includes a storage table and n filter tables, each filter table corresponds to a Hash function, and there are m*n different Hash functions; in addition, m*n different Hash functions are selected The Hash function is reserved; define a max_insert value, if the number of operations on a certain input data exceeds the max_insert value, it means that the form filling fails. The table building method provided by the invention effectively improves the space utilization rate and is beneficial to design and development in limited hardware storage space. And there is no limit to the value of m. m can take any value that the designer thinks is appropriate. Compared with many traditional Hash table building methods, it has higher flexibility. Simultaneously, the present invention eliminates the restriction on Hash function selection, and is easier to use.

Description

technical field [0001] The invention belongs to the technical field of Hash table algorithm design, in particular to a Hash table building method based on cuckoo hash and Bloom filter. Background technique [0002] The Chinese name of the Hash table is a hash table, also known as a hash table, which can provide fast insertion and search operations. Using a single Hash function to build a Hash table is difficult to balance effectively in solving Hash conflicts and improving space utilization or program efficiency. [0003] Therefore, a Hash table construction algorithm based on multiple Hash functions was invented. Among them, cuckoo hash and Bloom filter are two relatively efficient algorithms. [0004] The cuckoo hash method is proposed to solve the problem of Hash conflicts. The original algorithm uses hash1 and hash2 to calculate the position of the corresponding key when inserting. When any position of the two hashes is empty, select a position to insert; when two hashe...

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): G06F16/22
Inventor 于洪魏帅黄雅静杨镇西沈剑良宋克吕平刘勤让张帆陈博
Owner PLA STRATEGIC SUPPORT FORCE INFORMATION ENG UNIV PLA SSF IEU
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap