Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2005-10-18
2005-10-18
Mofiz, Apu (Department: 2165)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000
Reexamination Certificate
active
06957216
ABSTRACT:
A method, apparatus, software and data structure is disclosed for more efficient access times for linear operations in a hash table, including finding the nearest logical record. A plurality of actual data records and a plurality of marker data records are inserted in a hash table using a hash function. The actual data records and marker data records have a logical ordering specified by a key and are threaded into the hash table to allow linear access by walking the hash table. The logical ordering of the actual data records and marker records is lost upon entry into the hash table, and the keys of the marker data records are distributed at known positions throughout the range of the keys of the actual data records. If when hashing a given key no record exists in the database for the given key, one of the keys for the marker data records are hashed to locate the associated marker data record in the hash table. A nearest logical record may thus be retrieved entering the hash table through the marker data record.
REFERENCES:
patent: 6256622 (2001-07-01), Howard, Jr. et al.
patent: 6272486 (2001-08-01), Garth et al.
patent: 6289337 (2001-09-01), Davies et al.
patent: 6480858 (2002-11-01), Boa et al.
patent: 6560599 (2003-05-01), Boa et al.
Waldvogel et al., Scalable High Speed IP Routing Lookups, 1997 ACM, pp. 25-36.
Alter, “A model for automating file and program design in business application systems”, Jun., 1979, Communications of the ACM, vol. 22, Issue 6.
Robinson, “Order preserving linear hashing using dynamic key statistics”, Jun., 1985, Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems.
Wuytack et al., “Transforming set data types to power optimal data structures”, Apr., 1995, Proceedings 1995 international symposium on Low Power design.
Boa Douglas S.
Meacham Simon M.
Nolte Barry M.
Hennings Mark R.
Merchant & Gould P.C.
Mofiz Apu
LandOfFree
Method and apparatus for finding nearest logical record in a... 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 apparatus for finding nearest logical record in a..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for finding nearest logical record in a... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3441690