Threshold-based probabilistic top-k dominating queries

  • Authors:

  • Wenjie Zhang;Xuemin Lin;Ying Zhang;Jian Pei;Wei Wang

  • Affiliations:

  • The University of New South Wales and NICTA, Sydney, Australia;The University of New South Wales and NICTA, Sydney, Australia;The University of New South Wales and NICTA, Sydney, Australia;Simon Fraser University, Burnaby, Canada;The University of New South Wales and NICTA, Sydney, Australia

  • Venue:
  • The VLDB Journal — The International Journal on Very Large Data Bases
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recently, due to intrinsic characteristics in many underlying data sets, a number of probabilistic queries on uncertain data have been investigated. Top-k dominating queries are very important in many applications including decision making in a multidimensional space. In this paper, we study the problem of efficiently computing top-k dominating queries on uncertain data. We first formally define the problem. Then, we develop an efficient, threshold-based algorithm to compute the exact solution. To overcome some inherent computational deficiency in an exact computation, we develop an efficient randomized algorithm with an accuracy guarantee. Our extensive experiments demonstrate that both algorithms are quite efficient, while the randomized algorithm is quite scalable against data set sizes, object areas, k values, etc. The randomized algorithm is also highly accurate in practice.