REAL-TIME HASH MAP
First Claim
1. A method for implementing a hash map to improve performance consistency, the method comprising:
- providing a hash map comprising a set of tables, the set of tables comprising a first table;
when the first table is full, augmenting the hash map by adding a second table to the set of tables;
when the second table is full, augmenting the hash map by adding a third table to the set of tables; and
using the same hash code to search for a value in any of the tables belonging to the set of tables.
2 Assignments
0 Petitions
Accused Products
Abstract
A method for implementing a hash map to improve performance consistency is disclosed herein. In one embodiment, such a method includes providing a hash map comprising a set of tables, the set of tables initially containing a first table. When the first table is full, the method augments the hash map by adding a second table to the set of tables. Similarly, when the second table is full, the method augments the hash map by adding a third table to the set of tables. A similar technique may be used to add additional tables to the hash map. When searching for a value in any of the tables in the hash map, the method uses the same hash code. A corresponding computer program product and apparatus are also disclosed herein.
-
Citations
25 Claims
-
1. A method for implementing a hash map to improve performance consistency, the method comprising:
-
providing a hash map comprising a set of tables, the set of tables comprising a first table; when the first table is full, augmenting the hash map by adding a second table to the set of tables; when the second table is full, augmenting the hash map by adding a third table to the set of tables; and using the same hash code to search for a value in any of the tables belonging to the set of tables. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A computer program product to implement a real-time hash map, the computer program product comprising a computer-usable storage medium having computer-usable program code embodied therein, the computer-usable program code comprising:
-
computer-usable program code to provide a hash map comprising a set of tables, the set of tables comprising a first table; computer-usable program code to, upon detecting that the first table is full, augment the hash map by adding a second table to the set of tables; computer-usable program code to, upon detecting that the second table is full, augment the hash map by adding a third table to the set of tables; and computer-usable program code to use the same hash code to search for a value in any of the tables belonging to the set of tables. - View Dependent Claims (10, 11, 12, 13, 14, 15, 16)
-
-
17. An apparatus to implement a hash map to improve performance consistency, the apparatus comprising:
-
an establishment module to establish a hash map comprising a set of tables, the set of tables comprising a first table; an augment module to, upon detecting that the first table is full, augment the hash map by adding a second table to the set of tables; the augment module further configured to, upon detecting that the second table is full, augment the hash map by adding a third table to the set of tables; and a search module to use the same hash code to search for a value in any of the tables belonging to the set of tables. - View Dependent Claims (18, 19, 20, 21, 22, 23, 24)
-
-
25. A method for implementing a hash map to improve performance consistency, the method comprising:
-
providing a hash map comprising a set of tables, the set of tables comprising a first table having 2n array elements; when the first table is full, augmenting the hash map by adding a second table having 2n+1 array elements to the set of tables; when the second table is full, augmenting the hash map by adding a third table having 2n+2 array elements to the set of tables; and using the same hash code to search for a value in any of the tables belonging to the set of tables.
-
Specification