UV-Diagram: A Voronoi Diagram for Uncertain Data

The Voronoi diagram is an important technique for answering nearest-neighbor queries for spatial databases. In this paper, we study how the Voronoi diagram can be used on uncertain data, which are inherent in scientific and business applications. In particular, we propose the Uncertain-Voronoi Diagram (or UV-diagram in short). Conceptually, the data space is divided into distinct "UV-partitions", where each UV-partition P is associated with a set S of objects; any point q located in P has the set S as its nearest neighbor with non-zero probabilities. The UV-diagram facilitates queries that inquire objects for having non-zero chances of being the nearest neighbor of a given query point. It also allows analysis of nearest neighbor information, e.g., finding out how many objects are the nearest neighbors in a given area. However, a UV-diagram requires exponential construction and storage costs. To tackle these problems, we devise an alternative representation for UV-partitions, ...

• Type: Conference
• Year: 2010
• Where: ICDE
• Authors: Reynold Cheng, Xike Xie, Man Lung Yiu, Jinchuan Chen, Liwen Sun
• Keywords: Database, ICDE 2010, Nearest Neighbor, Nearest Neighbor Information, Voronoi Diagram