Performant and scalable merge strategy for text indexing

Details Performant and scalable merge strategy for text indexing Performant and scalable merge strategy for text indexing

2006-03-21

2006-03-21

Rimell, Sam (Department: 2164)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000, C707S793000

Reexamination Certificate

active

07016914

ABSTRACT:
A full-text search index system and method is generated by creating instances of a database index from an in-memory inverted list of keywords associated with a text identifier and the occurrences of the keyword in the text. Instances of the index are placed in a priority queue. A merge scheduling process determines when a merge should be initiated, selects instances of the index to be merged and selects a type of merge to perform. Instances of an index are assigned a temporal indicator (timestamp). A set of instances is selected to be merged. The set of instances is validated and merged.

REFERENCES:
patent: 6360215 (2002-03-01), Judd et al.
patent: 6638314 (2003-10-01), Meyerzon et al.
patent: 2002/0073115 (2002-06-01), Davis
patent: 2003/0004949 (2003-01-01), Hong et al.
patent: 2003/0028896 (2003-02-01), Swart et al.
U.S. Appl. No. 11/182,655.
Golovchinsky, G., “What the query told the link: The integration of hypertext and information retrieval,”Hypertext 97, Southampton, UK, 1997, 67-74.
Jennings, R., “SQL server 2000 has the potential to threaten oracle's database dominance. Learn why this in-depth analysis,”SQL Server in the Enterprise, Fall 2000, 20-29.

Affiliated with

Also associated with

Rating

Performant and scalable merge strategy for text indexing does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Performant and scalable merge strategy for text indexing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Performant and scalable merge strategy for text indexing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3564256