Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Approximate Evaluation of Range Nearest Neighbor Queries with Quality Guarantee
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Scalable continuous range monitoring of moving objects in symbolic indoor space
Proceedings of the 18th ACM conference on Information and knowledge management
Mining uncertain data with probabilistic guarantees
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Accelerating probabilistic frequent itemset mining: a model-based approach
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
k-nearest neighbors in uncertain graphs
Proceedings of the VLDB Endowment
Grid-based probabilistic skyline retrieval on distributed uncertain data
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications
Probabilistic Voronoi diagrams for probabilistic moving nearest neighbor queries
Data & Knowledge Engineering
Efficient computation of combinatorial skyline queries
Information Systems
Cost models for nearest neighbor query processing over existentially uncertain spatial data
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
Entity resolution for distributed probabilistic data
Distributed and Parallel Databases
| Hi-index | 0.00 |
We study the problem of answering spatial queries in databases where objects exist with some uncertainty and they are associated with an existential probability. The goal of a thresholding probabilistic spatial query is to retrieve the objects that qualify the spatial predicates with probability that exceeds a threshold. Accordingly, a ranking probabilistic spatial query selects the objects with the highest probabilities to qualify the spatial predicates. We propose adaptations of spatial access methods and search algorithms for probabilistic versions of range queries, nearest neighbors, spatial skylines, and reverse nearest neighbors and conduct an extensive experimental study, which evaluates the effectiveness of proposed solutions.