×

Database method and apparatus using hierarchical bit vector index structure

  • US 6,070,164 A
  • Filed: 05/09/1998
  • Issued: 05/30/2000
  • Est. Priority Date: 05/09/1998
  • Status: Expired due to Fees
First Claim
Patent Images

1. A computer-readable memory for storing a database and indexes used to locate data within the database, comprisinga non-volatile data storage device;

  • a database comprising a plurality of records stored on said data storage device in a computer-readable format, each of said records having a number of data fields with at least some of said data fields having a data value stored therein;

    wherein said records are logically separated into groups of records with each group containing a preselected maximum number n of records, and wherein said groups of records are logically organized into one or more sets, with each set containing a preselected maximum number m of groups, whereby each set contains a maximum of n*m records;

    a plurality of indexes, each of which is associated with a different one of said data fields and each of which comprises a number of keys associated with said one data field, whereby at least some of said data fields are indexed;

    wherein each of said data values that are stored within an indexed data field has one or more fine keys and one or more coarse keys associated therewith, wherein said fine keys arc each associated with one of said groups and with a fine bit vector that identifies which of the records contained within that group include the data value associated with that key, and wherein said coarse keys are each associated with one of said sets and with a coarse bit vector that identifies which of said groups include at least one record having that data value stored therein.

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