Processing in-route nearest neighbor queries: a comparison of alternative approaches

Nearest neighbor query is one of the most important operations in spatial databases and their application domains, e.g., location-based services, advanced traveler information systems, etc. This paper addresses the problem of finding the in-route nearest neighbor (IRNN) for a query object tuple which consists of a given route with a destination and a current location on it. The IRNN is a facility instance via which the detour from the original route on the way to the destination is smallest. This paper addresses four alternative solution methods. Comparisons among them are presented using an experimental framework. Several experiments using real road map datasets are conducted to examine the behavior of the solutions in terms of three parameters affecting the performance. Our experiments show that the computation costs for all methods except the precomputed zone-based method increase with increases in the road map size and the query route length but decreases with increase in the facility density. The precomputed zone-based method shows the most efficiency when there are no updates on the road map.

[1]  Yannis Manolopoulos,et al.  Closest pair queries in spatial databases , 2000, SIGMOD 2000.

[2]  Shashi Shekhar,et al.  Genesis: An Approach to Data Dissemination in Advanced Traveler Information Systems , 1996, IEEE Data Eng. Bull..

[3]  Michael F. Worboys,et al.  GIS : a computing perspective , 2004 .

[4]  Martine Labbé,et al.  The Voronoi Partition of a Network and Its Implications in Location Theory , 1992, INFORMS J. Comput..

[5]  Shashi Shekhar,et al.  Materialization Trade-Offs in Hierarchical Shortest Path Algorithms , 1997, SSD.

[6]  Sergey Bereg,et al.  Queries with segments in Voronoi diagrams , 1999, SODA '99.

[7]  J. H. Rillings,et al.  Advanced driver information systems , 1990 .

[8]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[9]  Shashi Shekhar,et al.  Navigation Systems: A Spatial Database Perspective , 2004, Location-Based Services.

[10]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[11]  Cyrus Shahabi,et al.  A Road Network Embedding Technique for K-Nearest Neighbor Search in Moving Object Databases , 2002, GIS '02.

[12]  Hanan Samet,et al.  Distance browsing in spatial databases , 1999, TODS.

[13]  Shashi Shekhar,et al.  Spatial Databases: A Tour , 2003 .

[14]  Shashi Shekhar,et al.  Path computation algorithms for advanced traveller information system (ATIS) , 1993, Proceedings of IEEE 9th International Conference on Data Engineering.

[15]  Nick Roussopoulos,et al.  K-Nearest Neighbor Search for Moving Query Point , 2001, SSTD.

[16]  W.C. Collier,et al.  Smart cars, smart highways , 1994, IEEE Spectrum.

[17]  Yannis Manolopoulos,et al.  Closest pair queries in spatial databases , 2000, SIGMOD '00.

[18]  J L Wright,et al.  PACIFIC RIM TRANSTECH CONFERENCE PROCEEDINGS. VOLUME I. GENESIS - INFORMATION ON THE MOVE , 1993 .

[19]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[20]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[21]  Nick Roussopoulos,et al.  Nearest neighbor queries , 1995, SIGMOD '95.

[22]  Yufei Tao,et al.  Continuous Nearest Neighbor Search , 2002, VLDB.

[23]  J L Wright,et al.  GENESIS - INFORMATION ON THE MOVE , 1993 .

[24]  Yufei Tao,et al.  All-nearest-neighbors queries in spatial databases , 2004, Proceedings. 16th International Conference on Scientific and Statistical Database Management, 2004..

[25]  Hans-Peter Kriegel,et al.  Fast nearest neighbor search in high-dimensional space , 1998, Proceedings 14th International Conference on Data Engineering.

[26]  Hanan Samet,et al.  Incremental distance join algorithms for spatial databases , 1998, SIGMOD '98.