Probabilistic ranking for relational databases based on correlations

Jaehui Park, Sang Goo Lee

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

This paper proposes a ranking method to exploit statistical correlations among pairs of attribute values in relational databases. For a given query, the correlations of the query are aggregated with each of the attribute values in a tuple to estimate the relevance of that tuple to the query. We extend Bayesian network models to provide a probabilistic ranking function based on a limited assumption of value independence. Experimental results show that our model improves the retrieval effectiveness on real datasets and has a reasonable query processing time compared to related work.

Original languageEnglish
Title of host publicationProceedings of the 3rd Workshop on Ph.D. Students in Information and Knowledge Management, PIKM'10, Co-located with 19th International Conference on Information and Knowledge Management, CIKM'10
Pages79-82
Number of pages4
DOIs
StatePublished - 2010
Event3rd Workshop on Ph.D. Students in Information and Knowledge Management, PIKM'10, Co-located with 19th International Conference on Information and Knowledge Management, CIKM'10 - Toronto, ON, Canada
Duration: 26 Oct 201030 Oct 2010

Publication series

NameInternational Conference on Information and Knowledge Management, Proceedings

Conference

Conference3rd Workshop on Ph.D. Students in Information and Knowledge Management, PIKM'10, Co-located with 19th International Conference on Information and Knowledge Management, CIKM'10
Country/TerritoryCanada
CityToronto, ON
Period26/10/1030/10/10

Keywords

  • Attribute value
  • Bayesian networks
  • Correlation
  • Keyword search over structured data
  • Ranking

Fingerprint

Dive into the research topics of 'Probabilistic ranking for relational databases based on correlations'. Together they form a unique fingerprint.

Cite this