Technique for ranking records of a database
First Claim
1. A computer implemented method for constrained searching of an index of a database, the information of the database stored as a plurality of records;
- sequentially assigning a unique location to each indexable portion of information of the database;
writing index entries in a memory, each index entry including a word entry representing a unique indexable portion of information, and one or more location entries for each occurrence of the unique indexable portion information;
sorting the index entries according to a collating order of the word entries, and sequentially according to the location entries of each index entry;
parsing a query to generate a first term and a second term related by an AND logical operator, the AND operator requiring that a first index entry corresponding to the first term and a second index entry corresponding to the second term must both have locations in the same record to satisfy query; and
sequentially searching the first and second index entries subject to one or more constraints which must be satisfied.
7 Assignments
0 Petitions
Accused Products
Abstract
A computer implemented method performs constrained searching of an index of a database. The information of the database is stored as a plurality of records. A unique location is assigned to each indexable portion of information of the database. Index entries are written to a memory where each index entry includes a word entry representing a unique indexable portion of information, and one or more location entries for each occurrence of the unique indexable portion information. The index entries are sorted according to a collating order of the word entries, and sequentially according to the location entries of each index entry. A query is parsed to generate a first term and a second term related by an AND logical operator, the AND operator requires that a first index entry corresponding to the first term and a second index entry corresponding to the second term both have locations in the same record to satisfy a query. The location entries of the first and second index entries are searched subject to one or more constraints which must be satisfied. The constraints are expressed as C(a)≦C(b)+K, where C(a) means a current location of the first index entry, C(b) means a current location of the second index entry, and K is a predetermined constant.
-
Citations
5 Claims
-
1. A computer implemented method for constrained searching of an index of a database, the information of the database stored as a plurality of records;
-
sequentially assigning a unique location to each indexable portion of information of the database;
writing index entries in a memory, each index entry including a word entry representing a unique indexable portion of information, and one or more location entries for each occurrence of the unique indexable portion information;
sorting the index entries according to a collating order of the word entries, and sequentially according to the location entries of each index entry;
parsing a query to generate a first term and a second term related by an AND logical operator, the AND operator requiring that a first index entry corresponding to the first term and a second index entry corresponding to the second term must both have locations in the same record to satisfy query; and
sequentially searching the first and second index entries subject to one or more constraints which must be satisfied. - View Dependent Claims (2, 3, 4)
-
-
5. The method where each index entry is associated with a scan rate for indicating how fast the locations of the index entry are being read, and satisfying a constraint associated with an index entry having a higher scan rate before satisfying a constraint associated with an index entry having a lower scan rate.
Specification