Data processing: database and file management or data structures – Database design – Data structure types
Patent
1997-08-12
2000-05-23
Black, Thomas G.
Data processing: database and file management or data structures
Database design
Data structure types
707102, G06F 1730
Patent
active
060675470
ABSTRACT:
Hash tables are used to index an internal database--one that resides in primary memory. The hash tables are segmented into a sequence of segments that increase geometrically in size. To expand a table, an additional segment is allocated which is twice as large as the previously allocated segment. This most recently allocated segment is referred to as an expansion segment, while the previously existing segments are referred to as base segments. As records are added, entries from the base segments are gradually split, and some of the records referenced by these entries are assigned to new entries in the expansion segment. This distributes address recalculations over time, while also using memory quite efficiently.
REFERENCES:
patent: 5414704 (1995-05-01), Spinney
patent: 5687361 (1997-11-01), Sarkar
patent: 5706462 (1998-01-01), Matousek
patent: 5734886 (1998-03-01), Grosse et al.
Litwin, W., "Linear Hasing: A New Tool For File And Table Addressing," Very Large Data Bases. Proceedings of the Sixth-International Conference, Oct. 1980, pp. 212-223.
Black Thomas G.
Coby Frantz
Microsoft Corporation
LandOfFree
Hash table expansion and contraction for use with internal searc does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Hash table expansion and contraction for use with internal searc, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hash table expansion and contraction for use with internal searc will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1844040