Index partitioning based on document relevance for document...

Data processing: database and file management or data structures – Database design – Data structure types

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C707S793000, C707S793000, C707S793000, C709S201000

Reexamination Certificate

active

10762823

ABSTRACT:
Indexed documents are arranged in the index according to a static ranking and partitioned according to static ranking. Index queries reference the first partition and move to a subsequent partition when a static rank for the subsequent partition is higher than a weighted portion of the target score added to a weighted portion of a dynamic rank corresponding to the relevance of the results set generated thus far. By changing the weight of the target score and dynamic ranks in the subsequent partition score, searches can be stopped when no more relevant results will be found in the next partition.

REFERENCES:
patent: 5375235 (1994-12-01), Berry et al.
patent: 5848409 (1998-12-01), Ahn
patent: 5864863 (1999-01-01), Burrows
patent: 5966710 (1999-10-01), Burrows
patent: 6070158 (2000-05-01), Kirsch et al.
patent: 6526440 (2003-02-01), Bharat
patent: 6529903 (2003-03-01), Smith et al.
patent: 6615209 (2003-09-01), Gomes et al.
patent: 6658423 (2003-12-01), Pugh et al.
patent: 6678681 (2004-01-01), Brin
patent: 7039631 (2006-05-01), Finger, II
patent: 2002/0123988 (2002-09-01), Dean et al.
patent: 2002/0133481 (2002-09-01), Smith et al.
patent: 2003/0158866 (2003-08-01), Goodwin et al.
patent: 2004/0083224 (2004-04-01), Yoshida
patent: 2004/0143707 (2004-07-01), Olarig et al.
patent: 2005/0102270 (2005-05-01), Risvik et al.
S. Brin and L. Page.The Anatomy of a Large-Scale Hypertextual Web Search Engine. Aug. 7, 2000. http://www7.scu.edu.au/programme/fullpapers/1921/com1921.htm.
D. Bahle, H. Williams and J. Zobel.Optimised Phrase Querying and Browsing of Large Text Database. 2001 IEEE. pp. 11-19.
J. Zobel and A. Moffat.Inverted Files Versus Signature Files for Text Indexing. 1999 ACM. pp. 453-490.
D. Bahle, H. Williams and J. Zobel.Efficient Phrase Querying with an Auxiliary Index. 2002 ACM. pp. 215-221.
D. Dreilinger and A. Howe.Experiences with Selecting Search Engines Using Metasearch. 1997 ACM. pp. 195-222.
N. Fuhr.Two Models of Retrieval with Probabilistic Indexing. 1986 ACM. pp. 249.
S. Bradshaw and K. Hammond.Automatically Indexing Documents: Content vs. Reference. 2002 ACM. pp. 180-181.
A. Keller and J. Basu.A predicate-based caching scheme for client-server database architectures. The VLDB Journal 1996. pp. 35-47.
J. French. A. Powell, F. Gey and N. Perelman.Exploiting a Controlled Vocabulary to Improve Collection Selection and Retrieval Effectiveness. 2001 ACM. pp. 199-206.
K. Lee, H. Leong and A. Si.Semantic Query Caching in a Mobile Environment. Mobile Computing and Communications Review, vol. 3, No. 2. Date unknown but prior to Dec. 30, 2003. pp. 28-36.
M. Rodriguez-Martinez and N. Roussopoulos.MOCHA: A Self-extensible Database Middleware System for Distributing Data Sources. 2000 ACM. pp. 213-224.
K. Jarvelin, J. Kristensen, T. Niemi, E. Sormunen and H. Keskustalo.a Deductive Data Model for Query Expansion. 1996 ACM. pp. 235-243.
R. Goldman and J. Widom.WSQ/DSQ: A Practical Approach for Combined Querying of Database and the Web. 2000 ACM. pp. 285-295.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Index partitioning based on document relevance for document... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Index partitioning based on document relevance for document..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Index partitioning based on document relevance for document... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3856176

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.