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

Look-up method of hash table

A table lookup and table lookup technology, which is applied in the field of table lookup operations on data based on the hash algorithm, can solve the problems of difficulty in greatly improving the utilization efficiency of the hash table, limited RAM resources, etc., and achieve a balance between resources and efficiency, Effect of Utilization Efficiency Improvement

Inactive Publication Date: 2007-02-14
四川南山之桥微电子有限公司
View PDF0 Cites 12 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0020] However, for the hash table under the traditional hardware structure, no matter increasing the number of hash buckets (address space) or increasing the maximum depth of each hash bucket, it means that the amount of RAM (memory) used is equal. ratio increases, while RAM resources are limited in the chip
If you want to keep the same RAM usage, you must make a balance between the number of hash buckets (address space) and the maximum depth of the hash bucket, which will make it difficult to increase the utilization efficiency of the hash table. improvement

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
  • Look-up method of hash table
  • Look-up method of hash table
  • Look-up method of hash table

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0030] The technical solution of the present invention will be described in detail below in conjunction with the accompanying drawings and embodiments.

[0031] In the technical solution of the present invention, a pointer table is introduced, which contains 2 p entries, which is the same as the number of equivalent buckets; each entry contains 2 n pointers, same as the equivalent bucket depth. In a speed-first design, 2 q A search engine parallel table lookup method, but also need to add 2 q address allocation engine. When performing parallel table lookup, its complexity is O(1+2 n p +1) (considering the operation of the address pointer table and the main table); when performing a serial table lookup, its complexity is O(1+2 n +1) (considering operations on the address pointer table and main table).

[0032] The technical scheme of the present invention is, a kind of hash table look-up method, comprises the following steps:

[0033] a. Extract the data keyword, and has...

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

This invention relates to a data process method and provides a method for looking up Hash list including: a, picking up data key words to Hash an address of bit p, b, reading out different addresses of 2n list items in the Hash drum at the address place in the address pointer list, c, reading the key word list based on the addresses to judge if it hits the target. Advantages: providing more and deeper Hash drums so as to greatly increase the usability of Hash table and supporting parallel or serial lookup.

Description

technical field [0001] The invention relates to a data processing method, in particular to a method for performing table lookup operations on data according to a hash algorithm. Background technique [0002] A traditional hash table implementation consists of 2 m bucket depth is 2 n hash bucket. Each bucket contains the element whose address points to that bucket after hashing. When using X to represent the element inserted into the table, use X i Represents the elements hashed to bucket i, with X j i Represents the jth element hashed to bucket i, using a i Indicates the number of elements hashed to bucket i (a i ≤2 n ),Available: [0003] X i = { X 1 i , X 2 i , X 3 i , . . . , X ...

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
IPC IPC(8): G06F17/30
Inventor 包雅林李为民王凯刘书勇屈仁杰游游
Owner 四川南山之桥微电子有限公司
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