×

Method and data structure for a low memory overhead database

  • US 7,467,151 B2
  • Filed: 01/25/2006
  • Issued: 12/16/2008
  • Est. Priority Date: 03/20/2002
  • Status: Expired due to Fees
First Claim
Patent Images

1. A method comprising:

  • applying a hash function to a search key to create a hash value;

    accessing an entry in an index table corresponding to the hash value, the corresponding entry of the index table including a valid bit and a section pointer;

    accessing a section of a key database identified by the section pointer based at least in part on the valid bit, the accessed section including a number of data entries; and

    comparing the data entries contained in the accessed section with the search key.

View all claims
  • 0 Assignments
Timeline View
Assignment View
    ×
    ×