Constrained searching of an index

• US 6,105,019 A
• Filed: 07/26/1999
• Issued: 08/15/2000
• Est. Priority Date: 08/09/1996
• Status: Expired due to Term

• Current Assignee: Eureka Database Solutions, LLC (Dominion Harbor Enterprises, LLC)
• Original Assignee: Digital Equipment Corporation (HP Inc.)
• Inventors: Burrows, Michael
• Primary Examiner(s): AMSBURY, WAYNE P
• Application Number:
  US09/361,383
• Time in Patent Office: 386 Days
• Field of Search: 707/2
• US Class Current: 1/1
• CPC Class Codes: G06F 16/319 Inverted lists
• CPC Class Codes: G06F 16/328 Management therefor
• CPC Class Codes: G06F 16/3341 using boolean model
• CPC Class Codes: Y10S 707/99932 Access augmentation or optimizing
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching
• CPC Class Codes: Y10S 707/99934 Query formulation, input preparation, or translation
• CPC Class Codes: Y10S 707/99935 Query augmenting and refining, e.g. inexact access
• CPC Class Codes: Y10S 707/99936 Pattern matching access
• CPC Class Codes: Y10S 707/99937 Sorting
• CPC Class Codes: Y10S 707/99943 Generating database or data structure, e.g. via user interface

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.

Claims

1. A method for searching an index of stored information, the index including a plurality of index entries, each of the plurality of index entries including a word entry representing a unique indexable portion of the stored information, and one or more location entries representing each occurrence of the unique indexable portion of the stored information, the method comprising the steps of:

identifying a first word entry of a first index entry as corresponding to a first term of a query;

identifying a second word entry of a second index entry as corresponding to a second term of the query; and

searching the first index entry and the second index entry for respective location entries subject to a plurality of constraints, wherein each of the plurality of constraints must be satisfied, and wherein the order in which the plurality of constraints are satisfied is determined by which of the plurality of constraints is able to advance the search the farthest.

2. The method as defined in claim 1, wherein a first of the plurality of constraints has been determined to advance the search the farthest, further comprising the step of:

satisfying the first of the plurality of constraints before satisfying the others of the plurality of constraints.

3. The method as defined in claim 2, wherein the first index entry and the second index entry each have a plurality of location entries, wherein a particular one of the plurality of location entries in either the first index entry or the second index entry is a current location entry, and wherein the first of the plurality of constraints advances the search the farthest by advancing the current location entry the farthest in either the first index entry or the second index entry.

4. The method as defined in claim 3, wherein the plurality of constraints are invoked by at least one index stream reader object, wherein each index stream reader object maintains an estimated overshoot value, and wherein the estimated overshoot value is an estimate of how fast the corresponding index stream reader object is advancing through the location entries of either the first index entry or the second index entry.

5. The method as defined in claim 4, wherein the first of the plurality of constraints advances the current location entry the farthest in either the first index entry or the second index entry when the sum of a target value of the first of the plurality of constraints and the estimated overshoot value of the index stream reader object that invoked the first of the plurality of constraints is at a maximum.

6. The method as defined in claim 5, wherein each constraint is expressed as C|P(a)≦

C|P(b)±

K, wherein;

| stands for logical OR;

C(a) is a current location entry of the first index entry;

P(a) is a previous location entry of the first index entry;

C(b) is a current location entry of the second index entry;

P(b) is a previous location entry of the second index entry; and

K is a predetermined constant.

7. The method as defined in claim 6, wherein the target value of the first of the plurality of constraints is defined as the value of C|P(a)-K.

8. An article of manufacture for searching an index of stored information, the index including a plurality of index entries, each of the plurality of index entries including a word entry representing a unique indexable portion of the stored information, and one or more location entries representing each occurrence of the unique indexable portion of the stored information, the article of manufacture comprising:

at least one processor readable carrier; and

instructions contained on the carrier;

wherein the instructions are configured to be readable from the at least one carrier by one or more processors and thereby cause the one or more processors to operate so as to;

identify a first word entry of a first index entry as corresponding to a first term of a query;

identify a second word entry of a second index entry as corresponding to a second term of the query; and

search the first index entry and the second index entry for respective location entries subject to a plurality of constraints, wherein each of the plurality of constraints must be satisfied, and wherein the order in which the plurality of constraints are satisfied is determined by which of the plurality of constraints is able to advance the search the farthest.

9. The article of manufacture as defined in claim 8, wherein a first of the plurality of constraints has been determined to advance the search the farthest, and wherein the instructions further cause the one or more processors to operate so as to:

satisfy the first of the plurality of constraints before satisfying the others of the plurality of constraints.

10. The article of manufacture as defined in claim 9, wherein the first index entry and the second index entry each have a plurality of location entries, wherein a particular one of the plurality of location entries in either the first index entry or the second index entry is a current location entry, and wherein the first of the plurality of constraints advances the search the farthest by advancing the current location entry the farthest in either the first index entry or the second index entry.

11. The article of manufacture as defined in claim 10, wherein the plurality of constraints are invoked by at least one index stream reader object, wherein each index stream reader object maintains an estimated overshoot value, and wherein the estimated overshoot value is an estimate of how fast the corresponding index stream reader object is advancing through the location entries of either the first index entry or the second index entry.

12. The article of manufacture as defined in claim 11, wherein the first of the plurality of constraints advances the current location entry the farthest in either the first index entry or the second index entry when the sum of a target value of the first of the plurality of constraints and the estimated overshoot value of the index stream reader object that invoked the first of the plurality of constraints is at a maximum.

13. The article of manufacture as defined in claim 12, wherein each constraint is expressed as C|P(a)≦

C|P(b)±

K, wherein;

| stands for logical OR;

C(a) is a current location entry of the first index entry;

P(a) is a previous location entry of the first index entry;

C(b) is a current location entry of the second index entry;

P(b) is a previous location entry of the second index entry; and

K is a predetermined constant.

14. The article of manufacture as defined in claim 13, wherein the target value of the first of the plurality of constraints is defined as the value of C|P(a)-K.

15. A system for searching an index of stored information, the index including a plurality of index entries, each of the plurality of index entries including a word entry representing a unique indexable portion of the stored information, and one or more location entries representing each occurrence of the unique indexable portion of the stored information, the system comprising:

at least one storage device for storing the index; and

at least one processor connected to the at least one storage device, the at least one processor configured to;

identify a first word entry of a first index entry as corresponding to a first term of a query;

identify a second word entry of a second index entry as corresponding to a second term of the query; and

search the first index entry and the second index entry for respective location entries subject to a plurality of constraints, wherein each of the plurality of constraints must be satisfied, and wherein the order in which the plurality of constraints are satisfied is determined by which of the plurality of constraints is able to advance the search the farthest.

16. The system as defined in claim 15, wherein a first of the plurality of constraints has been determined to advance the search the farthest, the at least one processor further configured to:

satisfy the first of the plurality of constraints before satisfying the others of the plurality of constraints.

17. The system as defined in claim 16, wherein the first index entry and the second index entry each have a plurality of location entries, wherein a particular one of the plurality of location entries in either the first index entry or the second index entry is a current location entry, and wherein the first of the plurality of constraints advances the search the farthest by advancing the current location entry the farthest in either the first index entry or the second index entry.

18. The system as defined in claim 17, wherein the plurality of constraints are invoked by at least one index stream reader object, wherein each index stream reader object maintains an estimated overshoot value, and wherein the estimated overshoot value is an estimate of how fast the corresponding index stream reader object is advancing through the location entries of either the first index entry or the second index entry.

19. The system as defined in claim 18, wherein the first of the plurality of constraints advances the current location entry the farthest in either the first index entry or the second index entry when the sum of a target value of the first of the plurality of constraints and the estimated overshoot value of the index stream reader object that invoked the first of the plurality of constraints is at a maximum.

20. The system as defined in claim 19, wherein each constraint is expressed as C|P(a)≦

C|P(b)±

K, wherein;

| stands for logical OR;

(a C(a) is a current location entry of the first index entry;

P(a) is a previous location entry of the first index entry;

C(b) is a current location entry of the second index entry;

P(b) is a previous location entry of the second index entry; and

K is a predetermined constant.

21. The system as defined in claim 20, wherein the target value of the first of the plurality of constraints is defined as the value of C|P(a)-K.