An improved algorithm for constructing kth-order voronoi diagrams
IEEE Transactions on Computers
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
Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Privacy-preserving data mining
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
SP-GiST: An Extensible Database Index for Supporting Space Partitioning Trees
Journal of Intelligent Information Systems
Fast Nearest Neighbor Search in High-Dimensional Space
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Voronoi Diagrams for Moving Disks and Applications
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Location-based spatial queries
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Evaluating probabilistic queries over imprecise data
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
The VLDB Journal — The International Journal on Very Large Data Bases
The new Casper: query processing for location services without compromising privacy
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Wireless Communications & Networks (2nd Edition)
Wireless Communications & Networks (2nd Edition)
Efficient query evaluation on probabilistic databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
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
Monochromatic and bichromatic reverse skyline search over uncertain databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Probabilistic Group Nearest Neighbor Queries in Uncertain Databases
IEEE Transactions on Knowledge and Data Engineering
Efficient search for the top-k probable nearest neighbors in uncertain databases
Proceedings of the VLDB Endowment
The V*-Diagram: a query-dependent approach to moving KNN queries
Proceedings of the VLDB Endowment
Clustering Uncertain Data Using Voronoi Diagrams
ICDM '08 Proceedings of the 2008 Eighth IEEE International Conference on Data Mining
Information Processing Letters
On Unifying Privacy and Uncertain Data Models
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Probabilistic Verifiers: Evaluating Constrained Nearest-Neighbor Queries over Uncertain Data
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Top-k Spatial Joins of Probabilistic Objects
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Efficient processing of probabilistic reverse nearest neighbor queries over uncertain data
The VLDB Journal — The International Journal on Very Large Data Bases
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient method for maximizing bichromatic reverse nearest neighbor
Proceedings of the VLDB Endowment
Probabilistic Reverse Nearest Neighbor Queries on Uncertain Data
IEEE Transactions on Knowledge and Data Engineering
Probabilistic nearest-neighbor query on uncertain objects
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
VoR-tree: R-trees with Voronoi diagrams for efficient processing of spatial nearest neighbor queries
Proceedings of the VLDB Endowment
Influence zone: Efficiently processing reverse k nearest neighbors queries
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
| Hi-index | 0.00 |
The Voronoi diagram is an important technique for answering nearest-neighbor queries for spatial databases. We study how the Voronoi diagram can be used for uncertain spatial data, which are inherent in scientific and business applications. Specifically, we propose the Uncertain-Voronoi diagram (or UV-diagram), which divides the data space into disjoint "UV-partitions". Each UV-partition $$P$$ is associated with a set $$S$$ of objects, such that any point $$q$$ located in $$P$$ has the set $$S$$ as its nearest neighbor with nonzero probabilities. The UV-diagram enables queries that return objects with nonzero chances of being the nearest neighbor (NN) of a given point $$q$$ . It supports "continuous nearest-neighbor search", which refreshes the set of NN objects of $$q$$ , as the position of $$q$$ changes. It also allows the analysis of nearest-neighbor information, for example, to find out the number of objects that are the nearest neighbors of any point in a given area. A UV-diagram requires exponential construction and storage costs. To tackle these problems, we devise an alternative representation of a UV-diagram, by using a set of UV-cells. A UV-cell of an object $$o$$ is the extent $$e$$ for which $$o$$ can be the nearest neighbor of any point $$q \in e$$ . We study how to speed up the derivation of UV-cells by considering its nearby objects. We also use the UV-cells to design the UV-index, which supports different queries, and can be constructed in polynomial time. We have performed extensive experiments on both real and synthetic data to validate the efficiency of our approaches.