Logo Logo
Help
Contact
Switch Language to German
Schmid, Klaus Arthur; Zufle, Andreas; Emrich, Tobias; Renz, Matthias; Cheng, Reynold (2017): Uncertain Voronoi cell computation based on space decomposition. In: Geoinformatica, Vol. 21, No. 4: pp. 797-827
Full text not available from 'Open Access LMU'.

Abstract

To facilitate (k)-Nearest Neighbor queries, the concept of Voronoi decomposition is widely used. In this work, we propose solutions to extend the concept of Voronoi-cells to uncertain data. Due to data uncertainty, the location, the shape and the extent of a Voronoi cell are random variables. To facilitate reliable query processing despite the presence of uncertainty, we employ the concept of possible-Voronoi cells and introduce the novel concept of guaranteed-Voronoi cells: The possible-Voronoi cell of an object U consists of all points in space that have a non-zero probability of having U as their nearest-neighbor;and the guaranteed-Voronoi cell, which consists of all points in space which must have U as their nearest-neighbor. Since exact computation of both types of Voronoi cells is computationally hard, we propose approximate solutions. Therefore, we employ hierarchical access methods for both data and object space. Our proposed algorithm descends both index structures simultaneously, constantly trying to prune branches in both trees by employing the concept of spatial domination. To support (k)-Nearest Neighbor queries having k > 1, this work further pioneers solutions towards the computation of higher-order possible and higher-order guaranteed Voronoi cells, which consist of all points in space which may (respectively must) have U as one of their k-nearest neighbors. For this purpose, we develop three algorithms to explore our index structures and show that the approach that descends both index structures in parallel yields the fastest query processing times. Our experiments show that we are able to approximate uncertain Voronoi cells of any order much more effectively than the state-of-the-art while improving run-time performance. Since our approach is the first to compute guaranteed-Voronoi cells and higher order (possible and guaranteed) Voronoi cells, we extend the existing state-of-the-art solutions to these concepts, in order to allow a fair experimental evaluation.