Optimized skyline queries on road networks using nearest neighbors
Personal and Ubiquitous Computing
Indexing network voronoi diagrams
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
Monochromatic and bichromatic reverse nearest neighbor queries on land surfaces
Proceedings of the 21st ACM international conference on Information and knowledge management
DART: an efficient method for direction-aware bichromatic reverse k nearest neighbor queries
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
| Hi-index | 0.00 |
Geographical information systems (GIS) and applications assist us in commuting, traveling and locating our points of interests. The efficient implementation and support of spatial queries in those systems is of particular interest and importance. The use of a Voronoi diagram has traditionally been applied to computational geometry. In this paper, we will show how a Voronoi diagram can be applied to support spatial queries in GIS systems, and in particular to reverse nearest neighbor (RNN) queries. An RNN query retrieves the set of interest objects having the query object as the nearest neighbor among other objects. Two cases of RNN queries are: monochromatic (MRNN) and bichromatic (BRNN). In the MRNN, the interest objects and the query object are of the same type, whereas in the BRNN they are of two different types. Due to the shortcomings of solutions for BRNN in the literature, we develop a new approach and algorithm, named the ‘2Vor BRNN algorithm’, for processing this query type in the context of the spatial network database (SNDB). Our novel approach extends the previous work and uses the ‘order-2 network Voronoi diagram’ to provide a more efficient solution for the BRNN. In addition, we experimentally confirm that the proposed algorithm outperforms the previous one in terms of memory used and response time.