The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Updating and Querying Databases that Track Mobile Units
Distributed and Parallel Databases - Special issue on mobile data management and applications
Indexing the positions of continuously moving objects
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Capturing the Uncertainty of Moving-Object Representations
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
Evaluating probabilistic queries over imprecise data
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Pattern Classification (2nd Edition)
Pattern Classification (2nd Edition)
Managing uncertainty in moving objects databases
ACM Transactions on Database Systems (TODS)
Querying Imprecise Data in Moving Object Environments
IEEE Transactions on Knowledge and Data Engineering
Indexing multi-dimensional uncertain data with arbitrary probability density functions
VLDB '05 Proceedings of the 31st international conference on Very large data bases
R-Trees: Theory and Applications (Advanced Information and Knowledge Processing)
R-Trees: Theory and Applications (Advanced Information and Knowledge Processing)
The Gauss-Tree: Efficient Object Identification in Databases of Probabilistic Feature Vectors
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Range search on multidimensional uncertain data
ACM Transactions on Database Systems (TODS)
The TPR*-tree: an optimized spatio-temporal access method for predictive queries
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Numerical Recipes 3rd Edition: The Art of Scientific Computing
Numerical Recipes 3rd Edition: The Art of Scientific Computing
Spatial Range Querying for Gaussian-Based Imprecise Query Objects
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
A generic framework for handling uncertain data with local correlations
Proceedings of the VLDB Endowment
Effectively indexing the multi-dimensional uncertain objects for range searching
Proceedings of the 15th International Conference on Extending Database Technology
Range searching on uncertain data
ACM Transactions on Algorithms (TALG)
Spatial query processing for fuzzy objects
The VLDB Journal — The International Journal on Very Large Data Bases
Hi-index | 0.00 |
Probabilistic range query is an important type of query in the area of uncertain data management. A probabilistic range query returns all the objects within a specific range from the query object with a probability no less than a given threshold. In this paper we assume that each uncertain object stored in the databases is associated with a multi-dimensional Gaussian distribution, which describes the probability distribution that the object appears in the multi-dimensional space. A query object is either a certain object or an uncertain object modeled by a Gaussian distribution. We propose several filtering techniques and an R-tree-based index to efficiently support probabilistic range queries over Gaussian objects. Extensive experiments on real data demonstrate the efficiency of our proposed approach.