Method and data structure for a low memory overhead database

Details Method and data structure for a low memory overhead database Method and data structure for a low memory overhead database

2006-06-06

2006-06-06

Pardo, Thuy N. (Department: 2165)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000, C707S793000, C707S793000, C707S793000, C707S793000, C711S216000

Reexamination Certificate

active

07058642

ABSTRACT:
Method and data structure for a low memory overhead database and apparatus for implementing the same. Under one embodiment, the data structure includes an index table for storing a plurality of entries, each of the entries corresponding to one of a plurality of hash values, with each entry including a section pointer to identify a memory address of one of a plurality of sections of a key database and including valid bits to indicate a size of the respective section of the key database. The key database is stores a plurality of data entries, with each data entry including a search key having one of the plurality of hash values, and wherein the data entries are grouped into the plurality of sections, with each section storing data entries with search keys having the same hash value.

REFERENCES:
patent: 4611272 (1986-09-01), Lomet
patent: 5386413 (1995-01-01), McAuley et al.
patent: 5446881 (1995-08-01), Mammel, Jr.
patent: 5551020 (1996-08-01), Flax et al.
patent: 5649143 (1997-07-01), Parady
patent: 5687361 (1997-11-01), Sarkar
patent: 5761667 (1998-06-01), Koeppen
patent: 5813040 (1998-09-01), Rathke
patent: 5943674 (1999-08-01), Schofield
patent: 5949696 (1999-09-01), Threewitt
patent: 5960454 (1999-09-01), Mandal et al.
patent: 5978795 (1999-11-01), Poutanen et al.
patent: 5987468 (1999-11-01), Singh et al.
patent: 6029225 (2000-02-01), McGehearty et al.
patent: 6044369 (2000-03-01), Black
patent: 6067547 (2000-05-01), Douceur
patent: 6081522 (2000-06-01), Hendel et al.
patent: 6097724 (2000-08-01), Kartalopoulos
patent: 6141344 (2000-10-01), DeLong
patent: 6181698 (2001-01-01), Hariguchi
patent: 6185569 (2001-02-01), East et al.
patent: 6236658 (2001-05-01), Essbaum et al.
patent: 6292795 (2001-09-01), Peters et al.
patent: 6307855 (2001-10-01), Hariguchi
patent: 6311216 (2001-10-01), Smith et al.
patent: 6331984 (2001-12-01), Luciani
patent: 6912645 (2005-06-01), Dorward et al.
patent: 2002/0002549 (2002-01-01), Lunteren
patent: 2002/0032691 (2002-03-01), Rabii et al.
patent: 2002/0129033 (2002-09-01), Hoxie et al.
patent: 2003/0018878 (2003-01-01), Dorward et al.
patent: 2003/0210689 (2003-11-01), Davis et al.
patent: 2004/0148306 (2004-07-01), Moulton et al.
patent: WO 99/05586 (1999-02-01), None
Arun Iyengar, “Scalability of Dynamic Storage Allocation Algorithms”, IBM Research Divison, 1996 IEEE, pp. 223-232.

Affiliated with

Also associated with

Rating

Method and data structure for a low memory overhead database does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and data structure for a low memory overhead database, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and data structure for a low memory overhead database will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3692096