Efficient retrieval algorithm by query term discrimination

Details Efficient retrieval algorithm by query term discrimination Efficient retrieval algorithm by query term discrimination

2007-05-18

2010-10-26

Vy, Hung T (Department: 2163)

Data processing: database and file management or data structures

Database and file access

Preparing data for information retrieval

C707S758000, C707S769000

Reexamination Certificate

active

07822752

ABSTRACT:
Described is an efficient retrieval mechanism that quickly locates documents (e.g., corresponding to online advertisements) based on query term discrimination. A topmost subset (e.g., two) of search terms is selected according to their ranked importance, e.g., as ranked by inverted document frequency. The topmost terms are then used to narrow the number of rows of an inverted query index that are searched to find document identifiers and associated scores, such as computed offline by a BM25 algorithm. For example, for each document identifier of each important term, a fast search within each of the narrowed subset of rows (that also contain that document identifier) may be performed by comparing document identifiers to jump a pointer within each other row, followed by a binary search to locate a particular document. The scores of the set of particular documents may then be used to rank their relative importance for returning as results.

REFERENCES:
patent: 5263159 (1993-11-01), Mitsui
patent: 5765150 (1998-06-01), Burrows
patent: 5915249 (1999-06-01), Spencer
patent: 5920859 (1999-07-01), Li
patent: 6349308 (2002-02-01), Whang et al.
patent: 7062483 (2006-06-01), Ferrari et al.
patent: 7111000 (2006-09-01), Wen et al.
patent: 2004/0143564 (2004-07-01), Gross et al.
patent: 2004/0267725 (2004-12-01), Harik
patent: 2005/0138067 (2005-06-01), Billsus et al.
patent: 2005/0198076 (2005-09-01), Stata et al.
patent: 2005/0267872 (2005-12-01), Galai et al.
patent: 2006/0041560 (2006-02-01), Forman et al.
patent: 2006/0047656 (2006-03-01), Dehlinger et al.
patent: 2006/0259482 (2006-11-01), Altevogt et al.
patent: 2006/0277173 (2006-12-01), Li et al.
patent: 2007/0185871 (2007-08-01), Canright et al.
patent: 2007/0198459 (2007-08-01), Boone et al.
Cuenca-Acuna, et al., “Text-Based Content Search and Retrieval in ad hoc P2P Communities”, Date: Apr. 4, 2002, pp. 1-13, Piscataway, New Jersey, USA.
Moffat, et al., “Self-Indexing Inverted Files for Fast Text Retrieval”, Date: Feb. 1994, pp. 1-29, Victoria, Australia.
Robertson, Stephen; “Understanding inverse document frequency: on theoretical arguments for IDF;” Journal of Documentation; 2004; vol. 60; pp. 503-520.

Affiliated with

Also associated with

Rating

Efficient retrieval algorithm by query term discrimination does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficient retrieval algorithm by query term discrimination, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient retrieval algorithm by query term discrimination will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4230706