Method and device for dynamically adapting for data by Hash table

Abstract

The invention is applicable to the field of data memory and provides a method and a device for dynamically adapting for data by a Hash table. The method comprises the following steps of: A: initiating the memory as a Hash table memory area, a Hash item memory area and a Hash key value memory area; B: when the Hash table is detected not to meet the memory requirement of the data, keeping the data of the Hash item memory area and the Hash key value memory area unchanged, and releasing the Hash table memory area; furthermore, re-allocating a new Hash table memory area meeting the data memory requirement; and adopting the Hash function adopted before re-allocating the Hash table memory area to re-calculate the data memorized in the Hash key value memory area, thus obtaining the data in the new Hash table memory area. In the embodiment, the Hash table can dynamically adapt for any data, and the problems that the memory is wasted due to excessively large Hash table memory area and the Hash table memory area can not meet any data requirement due to excessively small Hash table memory area is avoided.

Description

technical field [0001] The invention belongs to the field of data storage, and in particular relates to a method and a device for dynamically adapting a hash table to data. Background technique [0002] In a general data structure such as a linear table or a tree, when data is stored in the data structure, the relative position of the data in the data structure is random, and there is no definite relationship with the key of the data. When looking up data in the data structure, it is necessary to perform a series of comparisons between the keywords of the data and the keywords recorded in the data structure to find the data. The efficiency of the search is closely related to the number of comparisons. In many cases, the efficiency of data search is low . In order to avoid this problem, the prior art generally uses a hash function to process the data that needs to be stored to obtain a hash table, so that the key of the data corresponds to the unique storage location in the ...

AI Technical Summary

Problems solved by technology

[0004] The purpose of the embodiments of the present invention is to provide a method for a hash table to dynamically adapt to data, aiming to solve the problem of memory waste or insufficient memory caused by the inability of the existing hash table to dynamically adapt to data

Images