Modified hash method, and application

Abstract

An improved Hash method includes providing Hash key code table with storage space table, providing key code page with key code item and pointer pointing to next key code page, providing key code item with effective flag position and key code as well as result pointer, providing actual stored item with actual information content corresponding to stored key code.

Description

technical field [0001] The invention relates to the computer field using HASH technology, in particular to the network communication field using HASH technology. Background technique [0002] The HASH method is a common method for information retrieval and storage in the computer field. The commonly used HASH methods include direct addressing, digital analysis, division and remainder, and multiplication and remainder rounding. [0003] The HASH method establishes a definite corresponding functional relationship Hash() between the storage location of the entry and its key code (KEY), so that each key code corresponds to a unique storage location in the structure (Address=Hash( Rec.key)). The conversion function used in the HASH method is called a HASH function, and the table or structure constructed in this way is called a HASH table. [0004] Using the HASH method to search does not need to compare the key code multiple times, so the search speed is relatively fast, and th...

AI Technical Summary

Problems solved by technology

[0010] The technical problem to be solved by the present invention is: to overcome the problems and defects that the number of times of memory that the hash method needs to access changes greatly in the prior art, and to provide an improved hash method and its application

Images