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

Method for efficiently and quickly solving hash conflicts

A fast and efficient technology, applied in database indexing, structured data retrieval, etc., can solve problems such as performance degradation, achieve the effects of improving utilization, accelerating indexing process, and optimizing search efficiency

Active Publication Date: 2019-05-24
深圳竹云科技股份有限公司
View PDF5 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

There is no accumulation phenomenon when the chain address method handles conflicts, but when the elements of the linked list gradually accumulate and become larger, the performance will decrease

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
  • Method for efficiently and quickly solving hash conflicts

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0015] In order to make the object, technical solution and advantages of the present invention clearer, the present invention will be further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described here are only used to explain the present invention, not to limit the present invention.

[0016] Such as figure 1 As shown, the steps of the method for efficiently and quickly resolving hash conflicts are: S1. Set up two Hash tables Table1 and Table2 to form a cuckoo hash table and a chain address hash table Table3; simultaneously create three Hash functions, hashA, hashB and hashC;

[0017] S2. After obtaining the key, calculate the hashcode according to the functions hashA and hashB, and check whether the addresses corresponding to the two tables Table1 and Table2 are empty. If one of them is empty, insert it directly into the empty address, and add the key frequency C (count ) By c...

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 method for efficiently and quickly solving hash conflicts. The invention relates to a method for efficiently and quickly solving hash conflicts, which realizes a hybrid hashtable searching method by combining a cuckoo hash idea with a chain address method algorithm and introducing an LRU algorithm for optimization, can optimize hash table construction and searching efficiency, and meanwhile, improves the utilization rate of hash tables. And the indexing process of the hash addressing key can be greatly accelerated.

Description

technical field [0001] The invention relates to a method for solving hash conflicts. , more specifically, relates to an efficient and fast method for resolving hash conflicts. Background technique [0002] The hash function can make the access process to a data sequence more rapid and effective. Through the hash function, the data elements will be located faster. However, the hash value space is usually much smaller than the input space, and different inputs may hash to the same output, so it is impossible to uniquely determine the input value from the hash value, which leads to hash conflicts. [0003] To resolve hash conflicts, open addressing can be used. The so-called open addressing method is to find the next empty hash address once a conflict occurs. As long as the hash table is large enough, the empty hash address can always be found and the record will be stored. This method can always find free addresses, but it is prone to data aggregation, so that the uniform d...

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): G06F16/22
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