Shashi Shekhar
ABSTRACT
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.
- A. Corral, Y. Manolopoulos, Y. Theodoridis, M. Vassilakopoulos, Closes Pair Queries in Spatial Databases, ACM SIGMOND, 2000.]] Google Scholar
Digital Library
- C. Shahabi, M. R. Kolahdouzan, M Sharifzadeh, A Road Network Embedding Technique for K-Nearest Neighbor Search in Moving Object Databases, SSTD, 2001.]]Google Scholar
- GITA and OGC's Emerging Technology Summit Series -Location-Based Services. http://www.openls.org/dvd1/ets1/index.htm.]]Google Scholar
- G. Hjaltason, H. Samet, Distance Browsing in Spatial Databases, ACM TODS, 1999.]] Google ScholarDigital Library
- G. Hjaltason, H. Samet, Incremental Distance Join Algorithms for Spatial Databases, ACM SIGMOD, 1998.]] Google ScholarDigital Library
- H. Edelsbrunner, Alogirthms in Computational Geometry, EATCS Monographs on Theoretical Computer Science, 1987.]] Google ScholarDigital Library
- J. H. Rillings and R. J. Betsold. Advanced Driver Information Systems. IEEE Trans. on Vehicular Technology, 1991.]]Google Scholar
- J. L. Wright, R. Starr, S.Gargaro, GENESIS-Information on the Move, In Proc. of Annual IVHS American Conference, 1993.]]Google Scholar
- J. Zhang, N. Mamoulis, D. Papadias, Y. Tao, All-Nearest-Neighbors Queries in Spatial Databses, 2002.]]Google Scholar
- J. Feng, T. Watanbe, Fast Search of Nearest Target Object in Urban District Road Networks, PYIWIT, 2002.]]Google Scholar
- M. F. Worboys, GIS: A Computing Perspective, Taylor & Francis, 1995.]] Google ScholarDigital Library
- N. Roussopoulos, S. Kelleym, F. Vincent. Nearest Neighbor Queries, In proceedings of the ACM SIGMOD, 1995.]] Google ScholarDigital Library
- S. Shekhar, R. R. Vatsava, X. Ma, J. Yoo, Navigation Systems: A Spatial Database Perspective, In chapter 3 of the book, Location-Based Services, 2003.]]Google Scholar
- S. Shekhar, S.Chawla, Spatial Databases: A Tour, Prentice Hall, 2003.]]Google Scholar
- S. Shekhar, M. Coyle, A. Kohli, Path Computation Algorithms for Advanced Traveller Information Systems, IEEE Computer Society, 1993.]] Google ScholarDigital Library
- S. Shekhar, A. Fetterer, D. Liu, Genesis: An Approach to Data Dissemination in in Advanced Travel Information Systems, Bulletin of the Technical Committee on Data Engineering: Special Issue on Data Dissemination, 1996.]]Google Scholar
- S. Shekhar, A. Fetterer, B. Goyal, Materialization Trade-Offs in Hierarchical Shortest Path Algorithms. Proc. Intl. Symp. on Large Spatial Databases, 1997.]] Google ScholarDigital Library
- S. Bespamyatnikh, J. Snoeyink, Queries with Segments in Voronoi Diagrams. SODA, 1999.]] Google ScholarDigital Library
- S. Hakimi, M. Labbe, and E. Schmeichel, The Voronoi Partition of a Network and its Implications Location Theory ORSA, 1992.]]Google Scholar
- S. Berchtold, B. Ertl, D. Keim, H.Kriegel, and T.Seidl. Fast nearest neighbor search in high-dimensional space. In proceedings of International Conference on Data Engineering, 1998.]] Google ScholarDigital Library
- T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein, Introduction to Algorithms, Second Edition, MIT Press, 2001.]] Google ScholarDigital Library
- W. C. Collier and R. J. Weiland. Smart Cars, Smart Highways, IEEE Spectrum, 1994.]] Google ScholarDigital Library
- Y. Tao, D. Papdias, Q. Shen, Continuous Nearest Neighbor Search, VLDB, 2002.]]Google Scholar
- Z. Song, N. Roussopoulos, K-Nearest Neighbor Search for Moving Query Point, SSTD, 2001.]] Google ScholarDigital Library
Index Terms
- Processing in-route nearest neighbor queries: a comparison of alternative approaches
Recommendations
Nearest neighbor queries in road networks
GIS '03: Proceedings of the 11th ACM international symposium on Advances in geographic information systemsWith wireless communications and geo-positioning being widely available, it becomes possible to offer new e-services that provide mobile users with information about other mobile objects. This paper concerns active, ordered k-nearest neighbor queries ...
In-Route Nearest Neighbor Queries
Nearest neighbor query is one of the most important operations in spatial databases and their application domains, such as location-based services and advanced traveler information systems. This paper addresses the problem of finding the in-route ...
Adaptive nearest neighbor queries in travel time networks
GIS '05: Proceedings of the 13th annual ACM international workshop on Geographic information systemsNearest neighbor (NN) searches represent an important class of queries in geographic information systems (GIS). Most nearest neighbor algorithms rely on static distance information to compute NN queries (e.g., Euclidean distance or spatial network ...
Comments