Prioritized merging for full-text index on relational store

Details Prioritized merging for full-text index on relational store Prioritized merging for full-text index on relational store

2006-02-28

2006-02-28

Truong, Cam-Y (Department: 2162)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000, C707S793000, C707S793000, C707S793000

Reexamination Certificate

active

07007015

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.

REFERENCES:
patent: 5168565 (1992-12-01), Morita
patent: 5852826 (1998-12-01), Graunke et al.
patent: 6094649 (2000-07-01), Bowen et al.
patent: 6128613 (2000-10-01), Wong et al.
patent: 6349308 (2002-02-01), Whang et al.
patent: 6385611 (2002-05-01), Cardona
patent: 6609123 (2003-08-01), Cazemier et al.
patent: 6618720 (2003-09-01), On Au et al.
patent: 6665666 (2003-12-01), Brown et al.
Golovchinsky, G., “What the Query Told the Link: The Integration of Hypertext and Information Retrieval,”Eighth ACM Conference on Hypertext, Hypertext '97, 1997, Southampton, UK, 67-74.
Jennings, R., “SQL Server 2000 Gains on Oracle,”Visual Basic Programmer's Journal, 2000, 10(11), 20-9.

Affiliated with

Also associated with

Rating

Prioritized merging for full-text index on relational store does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Prioritized merging for full-text index on relational store, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Prioritized merging for full-text index on relational store will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3697657