Technique for deleting duplicate records referenced in an index of a database

• US 20020049753A1
• Filed: 08/03/2001
• Published: 04/25/2002
• Est. Priority Date: 08/07/2000
• Status: Active Grant

• Current Assignee: Eureka Database Solutions, LLC (Dominion Harbor Enterprises, LLC)
• Original Assignee: AltaVista Company (Apollo Global Management, Inc.)
• Inventors: Burrows, Michael
• Granted Patent: US 6,745,194 B2
• Time in Patent Office: Days
• US Class Current: 707/3
• CPC Class Codes: G06F 16/319 Inverted lists
• CPC Class Codes: G06F 16/328 Management therefor
• 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/99935 Query augmenting and refining, e.g. inexact access
• CPC Class Codes: Y10S 707/99936 Pattern matching access
• CPC Class Codes: Y10S 707/99942 Manipulating data structure, e.g. compression, compaction, compilation
• 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 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.

2. The method of claim 1 where each constraint is 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.

3. The method of claim 2 further comprising:

satisfying one of the constraints by reading locations of the second index entry until the current location of the second index entry is at least equal to the current location of the first index entry plus the predetermined constant.

4. The method of claim 1 further comprising:

satisfying a constraint having a greater current location before satisfying a constraint having a lesser current locations.

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.