New data structures for orthogonal range queries
SIAM Journal on Computing
Computational geometry: an introduction
Computational geometry: an introduction
An optimal and progressive algorithm for skyline queries
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Querying Imprecise Data in Moving Object Environments
IEEE Transactions on Knowledge and Data Engineering
Maximal vector computation in large data sets
VLDB '05 Proceedings of the 31st international conference on Very large data bases
URank: formulation and efficient evaluation of top-k queries in uncertain databases
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Shooting stars in the sky: an online algorithm for skyline queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Efficient indexing methods for probabilistic threshold queries over uncertain data
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Probabilistic skylines on uncertain data
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Approaching the skyline in Z order
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Efficient Skyline Retrieval on Peer-to-Peer Networks
FGCN '07 Proceedings of the Future Generation Communication and Networking - Volume 02
Monochromatic and bichromatic reverse skyline search over uncertain databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Ranking queries on uncertain data: a probabilistic threshold approach
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Efficient search for the top-k probable nearest neighbors in uncertain databases
Proceedings of the VLDB Endowment
Probabilistic Verifiers: Evaluating Constrained Nearest-Neighbor Queries over Uncertain Data
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Probabilistic Skyline Operator over Sliding Windows
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Semantics of Ranking Queries for Probabilistic Data and Expected Ranks
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Computing all skyline probabilities for uncertain data
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Indexing correlated probabilistic databases
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
| Hi-index | 0.00 |
Significant research efforts have recently been dedicated to modeling and querying uncertain data. In this paper, we focus on skyline analysis of uncertain data, modeled as uncertain objects with probability distributions over a set of possible values called instances. Computing the exact skyline probabilities of instances is expensive, and unnecessary when the user is only interested in instances with skyline probabilities over a certain threshold. We propose two filtering schemes for this case: a preliminary scheme that bounds an instance's skyline probability for filtering, and an elaborate scheme that uses an instance's bounds to filter other instances based on the dominance relationship. We experimentally demonstrate the effectiveness of our filtering schemes on both real and synthetic data sets and show the efficiency of our schemes compared with other algorithms.