Hashing method based on double-counting bloom filter and hashing device

A counter and counter value technology, applied in the field of data query, can solve problems such as difficult to adapt to high-speed data packet processing and fast search applications, and achieve the effects of reducing off-chip storage requirements, improving time efficiency and space efficiency, and reducing update overhead

Active Publication Date: 2010-02-24
INST OF COMPUTING TECH CHINESE ACAD OF SCI
View PDF0 Cites 29 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0008] The purpose of the present invention is to overcome the defect that existing hash tables are difficult to adapt to high-speed data packet processing and fast search applications, thereby providing a fast and efficient hash method and corresponding hash devices

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
  • Hashing method based on double-counting bloom filter and hashing device
  • Hashing method based on double-counting bloom filter and hashing device
  • Hashing method based on double-counting bloom filter and hashing device

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0056] The present invention will be described in detail below in conjunction with the accompanying drawings and specific embodiments.

[0057] Before describing the hash method of the present invention, the hash table used in the method will be described first. The hash table of the present invention includes multiple storage buckets, each storage bucket includes two counters, and one counter is called an insertion counter, which is used to record the number of inserted elements in the storage bucket. Another counter is called delete counter, which is used to record the number of deleted elements in the bucket. Each storage bucket also includes an off-chip element link table for storing specific information of the elements to be stored. In the hash table, the insertion counters and deletion counters of all storage buckets form a double-count Bloom filter, so the hash table of the present invention is also called a hash table based on a double-count Bloom filter (Double-coun...

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 provides a hashing method for realizing hashing insert operation on a hash table; the hash table comprises a plurality of buckets, the bucket comprises an insert counter and a delete counter, the insert counter is used for recording the number of insert elements in the bucket, and the delete counter is used for recording the number of the delete elements in the bucket; the method comprises the following steps: the element to be operated is mapped to at least one bucket of the hash table according to hash function, and the bucket is called as a candidate bucket; a target bucket isfound from the candidate buckets according to selection principle of the target bucket; the elements to be inserted are inserted in the target bucket; weather the inserted elements have effect on thestorage position of the stored elements in the candidate bucket is judged, if the storage positions of the stored elements can not meet the selection principle of the target bucket, the storage positions of the stored elements are re-adjusted; the hashing method also comprises the step of accumulating the value of the insert counter of the bucket.

Description

technical field [0001] The invention relates to the field of data query, in particular to a double-count Bloom filter-based hash method and hash device. Background technique [0002] A hash table is a data structure that associates key values ​​with data values. It maps key values ​​to a storage location in the table through a hash function, thereby accessing related data values. Hash tables are widely used in many fields such as IP lookup, packet classification, and deep packet inspection. Although the hash table is helpful for fast data lookup, when the load of the hash table is large, multiple key values ​​will be mapped to the same storage location in the hash table, causing frequent conflicts in the hash table and increasing The access time of basic operations reduces the lookup performance of the hash table. In order to reduce the adverse effects of hash table collisions, those skilled in the art have proposed various conflict resolution methods including linear link...

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 Applications(China)
IPC IPC(8): G06F17/30G06F12/02
Inventor 黄昆谢高岗张大方
Owner INST OF COMPUTING TECH CHINESE ACAD OF SCI
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