Monochromatic and bichromatic reverse skyline search over uncertain databases
Open Access
- 9 June 2008
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 213-226
Abstract
Reverse skyline queries over uncertain databases have many important applications such as sensor data monitoring and business planning. Due to the existence of uncertainty in many real-world data, answering reverse skyline queries accurately and efficiently over uncertain data has become increasingly important. In this paper, we model the probabilistic reverse skyline query on uncertain data, in both monochromatic and bichromatic cases, and propose effective pruning methods to reduce the search space of query processing. Moreover, efficient query procedures have been presented seamlessly integrating the proposed pruning methods. Extensive experiments have demonstrated the efficiency and effectiveness of our proposed approach with various experimental settings. Copyright 2008 ACMKeywords
This publication has 21 references indexed in Scilit:
- Probabilistic Verifiers: Evaluating Constrained Nearest-Neighbor Queries over Uncertain Data2008
- On High Dimensional Indexing of Uncertain Data2008
- Probabilistic Similarity Join on Uncertain Data2006
- Multidimensional reverse kNN searchThe VLDB Journal, 2005
- Robust and fast similarity search for moving object trajectories2005
- Querying imprecise data in moving object environmentsIEEE Transactions on Knowledge and Data Engineering, 2004
- Evaluating probabilistic queries over imprecise data2003
- An optimal and progressive algorithm for skyline queries2003
- A model for the prediction of R-tree performance1996
- R-trees1984