Efficient rank based KNN query processing over uncertain data
- 1 January 2010
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636382,p. 28-39
Abstract
Uncertain data are inherent in many applications such as environmental surveillance and quantitative economics research. As an important problem in many applications, KNN query has been extensively investigated in the literature. In this paper, we study the problem of processing rank based KNN query against uncertain data. Besides applying the expected rank semantic to compute KNN, we also introduce the median rank which is less sensitive to the outliers. We show both ranking methods satisfy nice top-k properties such as exact-k, containment, unique ranking, value invariance, stability and fairfulness. For given query q, IO and CPU efficient algorithms are proposed in the paper to compute KNN based on expected (median) ranks of the uncertain objects. To tackle the correlations of the uncertain objects and high IO cost caused by large number of instances of the uncertain objects, randomized algorithms are proposed to approximately compute KNN with theoretical guarantees. Comprehensive experiments are conducted on both real and synthetic data to demonstrate the efficiency of our techniques.Keywords
This publication has 26 references indexed in Scilit:
- Top- k queries on uncertain data2009
- Evaluating probability threshold k-nearest-neighbor queries over uncertain data2009
- Semantics of Ranking Queries for Probabilistic Data and Expected Ranks2009
- Ranking with Uncertain ScoresInternational Conference on Data Engineering, 2009
- Orion 2.02008
- Ranking queries on uncertain data2008
- MCDB2008
- Efficient Top-k Query Evaluation on Probabilistic Data2007
- Querying imprecise data in moving object environmentsIEEE Transactions on Knowledge and Data Engineering, 2004
- Evaluating probabilistic queries over imprecise data2003