Back to results
US 11,080,251 B1Granted
Optimization of memory usage while creating hash table
OwnerViktor Boldyshevinventor
Life of this patent
Estimating the term…
Abstract
There is provided a method to optimize memory usage in hash tables by organizing data storage in the hash table with arrays instead of linked lists where sizes of arrays can be predicted with high accuracy. The method has certain conditions and range of applicability, including where hash function of key provides uniform distribution of values. The method is more applicable if the number of entries is more than 60,000.
Claims10
A method to optimize memory usage when creating hash tables comprising:
- organizing a data storage in a hash table whereas said hash table includes keys and values;
- calculating a key for each real object, using a hash function, to create said keys and said values and uniting said keys and said values in groups;
- storing elements of said groups in arrays instead of linked lists;
- predicting sizes of said arrays using binomial distribution method;
- and
- optimizing memory usage by reducing memory space required for system operation and speeding up access to each of said elements by using said arrays for storing said elements of said groups instead of said linked lists.
3 more elements
Dependencies are inferred from the claim text.