Probabilistic information retrieval approach for ranking of database query results
Authors:
Open Access
- 1 September 2006
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 31 (3) , 1134-1168
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.Keywords
This publication has 27 references indexed in Scilit:
- Report on the DB/IR panel at SIGMOD 2005ACM SIGMOD Record, 2005
- XIRQLACM Transactions on Information Systems, 2004
- An expressive and efficient language for XML information retrievalJournal of the American Society for Information Science and Technology, 2002
- A probabilistic model of information retrieval: development and comparative experimentsInformation Processing & Management, 2000
- A probabilistic model of information retrieval: development and comparative experimentsInformation Processing & Management, 2000
- ProbViewACM Transactions on Database Systems, 1997
- A probabilistic relational algebra for the integration of information retrieval and database systemsACM Transactions on Information Systems, 1997
- The management of probabilistic dataIEEE Transactions on Knowledge and Data Engineering, 1992
- VAGUE: a user interface to relational databases that permits vague queriesACM Transactions on Information Systems, 1988
- AN EVALUATION OF FEEDBACK IN DOCUMENT RETRIEVAL USING CO‐OCCURRENCE DATAJournal of Documentation, 1978