Merging of results in distributed information retrieval

Details Merging of results in distributed information retrieval Merging of results in distributed information retrieval

2011-07-19

2011-07-19

Padmanabhan, Kavita (Department: 2156)

Data processing: database and file management or data structures

Database and file access

Query optimization

C707S718000, C707S719000, C707S765000

Reexamination Certificate

active

07984039

ABSTRACT:
A method and system are provided of merging results in distributed information retrieval. A search manager is in communication with a plurality of components, wherein a component is a search engine working on a document collection and returning results in the form of a list of documents to a search query. The search manager submits a query to the plurality of components, receives results from each component in the form of a list of documents; estimates the success of a component in handling the query to generate a merit score for a component per query; applies the merit score to the results for the component; and merges results from the plurality of components by ranking in order of the applied merit score.

REFERENCES:
patent: 5742806 (1998-04-01), Reiner et al.
patent: 5826260 (1998-10-01), Byrd et al.
patent: 5864845 (1999-01-01), Voorhees et al.
patent: 6289334 (2001-09-01), Reiner et al.
patent: 6370527 (2002-04-01), Singhal
patent: 6574632 (2003-06-01), Fox et al.
patent: 6889254 (2005-05-01), Chandra et al.
patent: 7162512 (2007-01-01), Amit et al.
patent: 7206780 (2007-04-01), Slackman
patent: 7251222 (2007-07-01), Chen et al.
patent: 7363299 (2008-04-01), Dalvi et al.
patent: 7444348 (2008-10-01), Fries et al.
patent: 2002/0032676 (2002-03-01), Reiner et al.
patent: 2002/0184206 (2002-12-01), Evans
patent: 2003/0041054 (2003-02-01), Mao et al.
patent: 2004/0078251 (2004-04-01), DeMarcken
patent: 2004/0215607 (2004-10-01), Travis, Jr.
patent: 2005/0091193 (2005-04-01), Frank et al.
patent: 2005/0091209 (2005-04-01), Frank et al.
patent: 2005/0097092 (2005-05-01), Annau et al.
patent: 2005/0131893 (2005-06-01), Von Glan
patent: 2005/0193088 (2005-09-01), Dittrich et al.
patent: 2005/0283465 (2005-12-01), Dettinger et al.
patent: 2006/0143159 (2006-06-01), Chowdhury et al.
patent: 2006/0167842 (2006-07-01), Watson
patent: 2006/0173830 (2006-08-01), Smyth et al.
patent: 2008/0077570 (2008-03-01), Tang et al.
patent: 1353279 (2003-10-01), None
Rasolofo et al. Approaches to collection selection and results merging for distributed information retrieval. Conference on Information and Knowledge Management archive Proceedings of the tenth international conference on Information and knowledge management table of contents Atlanta, Georgia, pp. 191-198, Oct. 2001 ISBN:1-58113-436-3.
Wiegand et al. “Extending XML Web Querying to Hetrogeneous Geospatial Information” National Conference on Digital Government Research (2002, 2003, 2004) http://www.lic.wisc.edu/DG—Project/DGhomepage.html.
Chen et al. “NiagaraCQ: A Scalable Continuous Query System for Internet Databases” May 2000 ACM SIGMOD Record , Proceedings of the 2000 ACM SIGMOD international conference on Management of data SIGMOD '00, vol. 29 Issue 2 Publisher: ACM Press.
Kossmann, “The State of the Art in Distributed Query Processing” Dec. 2000 ACM Computing Surveys (CSUR), vol. 32 Issue 4 Publisher: ACM Press.
Ozcan et al. “Dynamic Query Optimization on a Distributed Object Management Platform” Software Research and Development Center Middle East Technical University (METU) 06531 Ankara Turkey.
Amati et al. “Query difficulty, robustness and selective application of Query expansion” Fondazione Ugo Bordoni Rome Italy.
Amsaleg et al. “Dynamic Query Operator Scheduling forWide-Area Remote Access” Distributed and Parallel Databases, 6, 217-246 (1998) 1998 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
Chen et al. “NiagaraCQ: A Scalable Continuous Query System for Internet Databases” Computer Sciences Department, University of Wisconsin-Madison ACM 2000.
Kossmann “The State of the Art in Distributed Query Processing” ACM Computing Surveys, vol. 32, No. 4, Dec. 2000, pp. 422-469.
Pan et al. “Mediator Systems in E-Commerce Applications” Proceedings of the 4th IEEE Int'l Workshop on Advanced Issues of E-Commerce and Web-Based Information Systems (WECWIS 2002).
Purvis et al. “The NZDIS Project: an Agent-Based Distributed Information Systems Architecture” Copyright 2000 IEEE. Published in the Proceedings of the Hawai'i International Conference on System Sciences, Jan. 4-7, 2000, Maui, Hawaii.
Si et al. “A Language Modeling Framework for Resource Selection and Results Merging”CIKM '02, Nov. 4-9, 2002, McLean, Virginia, USA Copyright 2002 ACM.
Selberg, Erik et al., (1995), “Multi-service search and comparison using the MetaCrawler”, Proceedings of the 4th International World-Wide Web Conference, Darmstadt, Germany.
Cori (J. Callan, Z. Lu, and W. Croft, “Searching distributed collections with inference networks”, in proceedings of the 18th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 21-28, Seattle, Washington, 1995).
ProFusion (Gauch, Susan et al., (1996), “Profusion: Intelligent fusion from multiple, distributed search engines”, Journal of Universal Computing, 2, 637-649).
Joachims, Thorsten, (2002), “Optimizing search engines using clickthrough data”, proceedings of the ACM Conference on Knowledge Discovery and Data Mining (KDD), Association of Computer Machinery.
U.S. Appl. No. 10/968,692, “Prediction of Query Difficulty for a Generic Search Engine”, David Carmel, et al., filed Oct. 19, 2004.

Affiliated with

Also associated with

Rating

Merging of results in distributed information retrieval does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Merging of results in distributed information retrieval, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Merging of results in distributed information retrieval will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2639993