Probabilistic ranking of database query results

  • Chaudhuri S
  • Das G
  • Hristidis V
  • 42


    Mendeley users who have this article in their library.
  • N/A


    Citations of this article.


We investigate the problem of ranking answers to a database query
when many tuples are returned. We adapt and apply principles of probabilistic
models from Information Retrieval for structured data. Our proposed
solution is domain independent. It leverages data and workload statistics
and correlations. Our ranking functions can be further customized
for different applications. We present results of preliminary experiments
which demonstrate the efficiency as well as the quality of our ranking

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in


  • Surajit Chaudhuri

  • G Das

  • V Hristidis

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free