IEEE Transactions on Knowledge and Data Engineering · 2008 · 72 citations · 14 references
ComputingComputer ScienceGeoinformaticsDatabasesGeographic Information ScienceGeographic Information SystemsGeographic Information RetrievalNearest Neighbor SearchRange SearchingSpatial Data ModelsSpatial Database SystemsSpatial DatabasesNearest Neighbor QueriesProbabilistic RankingRange QueriesSpatial Data RetrievalSpatial Query ProcessingSpatial QueryingSpatial SearchUncertainty In Spatial Databases
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.
14
The R*-tree: an efficient and robust access method for points and rectangles
Norbert Beckmann, Hans‐Peter Kriegel, Ralf Schneider et al. · 1990 · 4.2K citations · Full text
Antonin Guttman · ACM SIGMOD Record · 1984 · 1.6K citations · Full text
The R*-tree: an efficient and robust access method for points and rectangles
Norbert Beckmann, Hans‐Peter Kriegel, Ralf Schneider et al. · ACM SIGMOD Record · 1990 · 1.4K citations
Progressive skyline computation in database systems
Dimitris Papadias, Yufei Tao, Greg Fu et al. · ACM Transactions on Database Systems · 2005 · 886 citations