Probabilistic information retrieval approach for ranking of database query results-Reference-Cited by-同舟云学术

Probabilistic information retrieval approach for ranking of database query results

Published:2006-09 Issue:3 Volume:31 Page:1134-1168
ISSN:0362-5915
Container-title:ACM Transactions on Database Systems
language:en
Short-container-title:ACM Trans. Database Syst.

Author:

Chaudhuri Surajit¹,Das Gautam²,Hristidis Vagelis³,Weikum Gerhard⁴

Affiliation:

1. Microsoft Research, Redmond, WA

2. University of Texas at Arlington, Arlington, TX

3. Florida International University, Miami, FL

4. Max Planck Institut fur Informatik, Saarbrücken, Germany

Abstract

We investigate the problem of ranking the answers to a database query when many tuples are returned. In particular, we present methodologies to tackle the problem for conjunctive and range queries, by adapting and applying principles of probabilistic models from information retrieval for structured data. Our solution is domain independent and leverages data and workload statistics and correlations. We evaluate the quality of our approach with a user survey on a real database. Furthermore, we present and experimentally evaluate algorithms to efficiently retrieve the top ranked results, which demonstrate the feasibility of our ranking system.

Publisher

Association for Computing Machinery (ACM)

Subject

Information Systems

Link

https://dl.acm.org/doi/pdf/10.1145/1166074.1166085

Reference58 articles.

1. Agrawal S. Chaudhuri S. and Das G. 2002. DBXplorer: A system for keyword based search over relational databases. In proceedings of ICDE. Agrawal S. Chaudhuri S. and Das G. 2002. DBXplorer: A system for keyword based search over relational databases. In proceedings of ICDE.

2. Agrawal S. Chaudhuri S. Das G. and Gionis A. 2003. Automated ranking of database query results. In proceedings of CIDR. Agrawal S. Chaudhuri S. Das G. and Gionis A. 2003. Automated ranking of database query results. In proceedings of CIDR.

3. Report on the DB/IR panel at SIGMOD 2005

4. Amer-Yahia S. Koudas N. Marian A. Srivastava D. and Toman D. 2005b. Structure and content scoring for XML. In proceedings of VLDB. Amer-Yahia S. Koudas N. Marian A. Srivastava D. and Toman D. 2005b. Structure and content scoring for XML. In proceedings of VLDB.

5. Agrawal R. Mannila H. Srikant R. Toivonen H. and Verkamo A. I. 1995. Fast discovery of association rules. In proceedings of KDD. Agrawal R. Mannila H. Srikant R. Toivonen H. and Verkamo A. I. 1995. Fast discovery of association rules. In proceedings of KDD.

Cited by 44 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A novel temporal recommendation method based on user query topic evolution;Knowledge-Based Systems;2022-04

2. An improved matrix factorization based model for many-objective optimization recommendation;Information Sciences;2021-11

3. Comprehensive Review and Future Research Directions on Dynamic Faceted Search;Applied Sciences;2021-08-31

4. Improving Recommendations for Online Retail Markets Based on Ontology Evolution;Electronics;2021-07-11

5. PRESS: A personalised approach for mining top-k groups of objects with subspace similarity;Data & Knowledge Engineering;2020-07