Architecture for an indexer

• US 7,743,060 B2
• Filed: 08/06/2007
• Issued: 06/22/2010
• Est. Priority Date: 01/26/2004
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Neumann, Andreas, Fontoura, Marcus Felipe, Rajagopalan, Sridhar, Shekita, Eugene J., Zien, Jason Yeong
• Primary Examiner(s): Vy; Hung T
• Application Number:
  US11/834,556
• Publication Number:
  US 20070271268A1
• Time in Patent Office: 1,051 Days
• Field of Search: 707/7, 707/2, 707/5, 707/100, 707/711, 707/728, 707/729, 707/731, 707/734, 707/741, 707/752, 707/753, 715/207, 715/205
• US Class Current: 707/737
• CPC Class Codes: G06F 16/313 Selection or weighting of terms for indexing
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques
• CPC Class Codes: Y10S 707/99932 Access augmentation or optimizing
• CPC Class Codes: Y10S 707/99937 Sorting
• 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

Disclosed is a technique for indexing data. For each token in a set of documents, a sort key is generated that includes a document identifier that indicates whether a section of a document associated with the sort key is an anchor text section or a context section, wherein the anchor text section and the context text section have a same document identifier; it is determined whether a data field associated with the token is a fixed width; when the data field is a fixed width, the token is designated as one for which fixed width sort is to be performed; and, when the data field is a variable length, the token is designated as one for which a variable width sort is to be performed. The fixed width sort and the variable width sort are performed. For each document, the sort keys are used to bring together the anchor text section and the context section of that document.

Claims

1. A method for indexing data, comprising:

for each token in a set of documents that each have an anchor text section and a context text section, using a computer including a processor,

generating a sort key that includes a document identifier that indicates whether a section of a document associated with the sort key is the anchor text section or the context section, wherein the anchor text section and the context text section have a same document identifier;

determining whether a data field associated with the token is a fixed width;

when the data field is a fixed width, designating the token as one for which fixed width sort is to be performed; and

when the data field is a variable length, designating the token as one for which a variable width sort is to be performed;

performing the fixed width sort on one of dual code paths and the variable width sort on the other of dual code paths; and

in response to performing the fixed width sort and the variable width sort, for each document, using the sort keys to bring together the anchor text section and the context section of that document based on the same document identifier associated with the anchor text section and the context section.

2. The method of claim 1, wherein the token is variable width and further comprising:

transforming the variable width token into a fixed width token.

3. The method of claim 1, wherein the sort key includes a token type, a token, a document section, and an offset in a document.

4. The method of claim 1, further comprising:

receiving the context section and the anchor text section of a document at different times.

5. The method of claim 1, further comprising:

using the sort keys generated for each token to create posting lists that simultaneously are ordered by token and by document identifier for each token.

6. The method of claim 1, further comprising:

sorting on certain bits of a sort key containing multiple bits.

7. The method of claim 6, further comprising:

sorting on uppermost bits of the sort key.

8. A computer system for indexing data, comprising:

hardware logic performing;

for each token in a set of documents that each have an anchor text section and a context text section,

generating a sort key that includes a document identifier that indicates whether a section of a document associated with the sort key is the anchor text section or the context section, wherein the anchor text section and the context text section have a same document identifier;

determining whether a data field associated with the token is a fixed width;

when the data field is a fixed width, designating the token as one for which fixed width sort is to be performed; and

when the data field is a variable length, designating the token as one for which a variable width sort is to be performed;

performing the fixed width sort on one of dual code paths and the variable width sort on the other of dual code paths; and

in response to performing the fixed width sort and the variable width sort, for each document, using the sort keys to bring together the anchor text section and the context section of that document based on the same document identifier associated with the anchor text section and the context section.

9. The computer system of claim 8, wherein the token is variable width and wherein the logic further comprises:

transforming the variable width token into a fixed width token.

10. The computer system of claim 8, wherein the sort key includes a token type, a token, a document section, and an offset in a document.

11. The computer system of claim 8, wherein the logic further comprises:

receiving the context section and the anchor text section of a document at different times.

12. The computer system of claim 8, wherein the logic further comprises:

using the sort keys generated for each token to create posting lists that simultaneously are ordered by token and by document identifier for each token.

13. The computer system of claim 8, wherein the logic further comprises:

sorting on certain bits of a sort key containing multiple bits.

14. The computer system of claim 13, wherein the logic further comprises:

sorting on uppermost bits of the sort key.

15. An article of manufacture comprising one of hardware logic and a computer readable medium including a program for indexing data, wherein the hardware logic or program causes operations to be performed, the operations comprising:

for each token in a set of documents that each have an anchor text section and a context text section,

generating a sort key that includes a document identifier that indicates whether a section of a document associated with the sort key is the anchor text section or the context section, wherein the anchor text section and the context text section have a same document identifier;

determining whether a data field associated with the token is a fixed width;

when the data field is a fixed width, designating the token as one for which fixed width sort is to be performed; and

when the data field is a variable length, designating the token as one for which a variable width sort is to be performed;

performing the fixed width sort on one of dual code paths and the variable width sort on the other of dual code paths; and

in response to performing the fixed width sort and the variable width sort, for each document, using the sort keys to bring together the anchor text section and the context section of that document based on the same document identifier associated with the anchor text section and the context section.

16. The article of manufacture of claim 15, wherein the token is variable width and wherein the operations further comprise:

transforming the variable width token into a fixed width token.

17. The article of manufacture of claim 15, wherein the sort key includes a token type, a token, a document section, and an offset in a document.

18. The article of manufacture of claim 15, wherein the operations further comprise:

receiving the context section and the anchor text section of a document at different times.

19. The article of manufacture of claim 15, wherein the operations further comprise:

using the sort keys generated for each token to create posting lists that simultaneously are ordered by token and by document identifier for each token.

20. The article of manufacture of claim 15, wherein the operations further comprise:

sorting on certain bits of a sort key containing multiple bits.

21. The article of manufacture of claim 20, wherein the operations further comprise:

sorting on uppermost bits of the sort key.