Top-k Query Processing in Uncertain Databases

Top-k processing in uncertain databases is semantically and computationally different from traditional top-k processing. The interplay between score and uncertainty makes traditional techniques inapplicable. We introduce new probabilistic formulations for top-k queries. Our formulations are based on "marriage" of traditional top-k semantics and possible worlds semantics. In the light of these formulations, we construct a framework that encapsulates a state space model and efficient query processing techniques to tackle the challenges of uncertain data settings. We prove that our techniques are optimal in terms of the number of accessed tuples and materialized search states. Our experiments show the efficiency of our techniques under different data distributions with orders of magnitude improvement over na?ive materialization of possible worlds.

• Type: Conference
• Year: 2007
• Where: ICDE
• Authors: Mohamed A. Soliman, Ihab F. Ilyas, Kevin Chen-Chuan Chang
• Keywords: Database, ICDE 2007, Possible Worlds Semantics, Query Processing Techniques, Uncertain Data Settings