×

Prioritized merging for full-text index on relational store

  • US 7,007,015 B1
  • Filed: 05/01/2002
  • Issued: 02/28/2006
  • Est. Priority Date: 05/01/2002
  • Status: Expired due to Fees
First Claim
Patent Images

1. A method of full-text searching of a database, the method comprising:

  • providing data to be indexed for the full-text searching;

    creating inverted lists in memory from a keyword memory by database management threads, the keyword memory accessed by a word breaker external to a database management system and by a database management system thread, wherein each inverted list comprises at least one of a plurality of keywords in the data, an identifier associated with the data and at least one occurrence of the at least one keyword in the data;

    generating instances of an index based on the data, the index comprising part of a database indexing system of the database management system, the instances of the index generated from the inverted lists;

    storing the instances of the index in a priority queue, wherein each instance is assigned a priority based on a number of keywords of the instance and a size of the instance;

    scheduling a merge to be run on the instances of the index based on query load and merge load;

    selecting instances to be merged based on the assigned priorities of the instances; and

    merging the selected instances based on a selected type of merge to generate an instance of the index.

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