Abstract
Much research has recently been devoted to the data management foundations of location-based mobile services. In one important scenario, the service users are constrained to a transportation network. As a result, query processing in spatial road networks is of interest. We propose a versatile approach to k nearest neighbor computation in spatial networks, termed the Islands approach. By offering flexible yet simple means of balancing re-computation and pre-computation, this approach is able to manage the trade-off between query and update performance. The result is a single, efficient, and versatile approach to k nearest neighbor computation that obviates the need for using several k nearest neighbor approaches for supporting a single service scenario. The experimental comparison with the existing techniques uses real-world road network data and considers both I/O and CPU performance, for both queries and updates.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Benetis, R., Jensen, C.S., Karciauskas, G., Saltenis, S.: Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects. In: Proc. IDEAS, pp. 44–53 (2002)
Brinkhoff, T.: The Tiger File Manager, http://www.fh-oow.de/institute/iapg/personen/brink-hoff/generator/
Cheng, C.K., Wei, Y.C.: An Improved Two-Way Partitioning Algorithm with Stable Performance. IEEE Trans. CAD 10(12), 1502–1511 (1991)
Ding, Z., Güting, R.H.: Modelling Temporally Variable Transportation Networks. In: Lee, Y., Li, J., Whang, K.-Y., Lee, D. (eds.) DASFAA 2004. LNCS, vol. 2973, pp. 154–168. Springer, Heidelberg (2004)
Ferhatosmanoglu, H., Stanoi, I., Agrawal, D., Abbadi, A.E.: Constrained Nearest Neighbor Queries. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol. 2121, pp. 257–278. Springer, Heidelberg (2001)
Güting, R.H., de Almeida, V.T., Ding, Z.: Modeling and Querying Moving Objects in Networks. Fernuniversität Hagen, Informatik-Report 308 (April 2004)
Hage, C., Jensen, C.S., Pedersen, T.B., Speičys, L., Timko, I.: Integrated Data Management for Mobile Services in the Real World. In: Proc. VLDB, pp. 1019–1030 (2003)
Huang, Y.W., Jing, N., Rundenstener, E.: Effective Graph Clustering for Path Queries in Digital Map Databases. In: Proc. CIKM, pp. 215–222 (1996)
Huang, X., Jensen, C.S., Šaltenis, S.: The Islands Approach to Nearest Neighbor Querying in Spatial Networks. DB Tech Report TR-12. Department of Computer Science, Aalborg University (2005)
Hjaltason, G.R., Samet, H.: Distance Browsing in Spatial Databases. TODS 24(2), 265–318 (1999)
Iwerks, G.S., Samet, H., Smith, K.: Continuous K-Nearest Neighbor Queries for Continuously Moving Points with Updates. In: Proc. VLDB, pp. 512–523 (2003)
Jensen, C.S., Kolář, J., Pedersen, T.B., Timko, I.: Nearest Neighbor Queries in Road Networks. In: Proc. ACMGIS, pp. 1–8 (2003)
Kolahdouzan, M., Shahabi, C.: Voronoi-Based Nearest Neighbor Search for Spatial Network Databases. In: Proc. VLDB, pp. 840–851 (2004)
Kolahdouzan, M., Shahabi, C.: Continuous K-Nearest Neighbor Search for Spatial Network Databases. In: Proc. STDBM, pp. 33–40 (2004)
Korn, F., Sidiropoulos, N., Faloutsos, C., Sieel, E., Protopapas, Z.: Fast Nearest Neighbor Search in Medical Image Databases. In: Proc. VLDB, pp. 215–226 (1996)
Okabe, A., Boots, B., Sugihara, K., Chiu, S.N.: Spatial Tessellations, Concepts and Applications of Voronoi Diagrams, 2nd edn. John Wiley and Sons Ltd., Chichester (2000)
Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query Processing in Spatial Network Databases. In: Proc. VLDB, pp. 802–813 (2003)
Roussopoulos, N., Kelley, S., Vincent, F.: Nearest Neighbor Queries. In: Proc. SIGMOD, pp. 71–79 (1995)
Speičys, L., Jensen, C.S., Kligys, A.: Computational Data Modeling for Network Constrained Moving Objects. In: Proc. ACMGIS, pp. 118–125 (2003)
Seidl, T., Kriegel, H.P.: Optimal Multi-Step k-Nearest Neighbor Search. In: Proc. SIGMOD, pp. 154–165 (1998)
Shahabi, C., Kolahdouzan, M.R., Sharifzadeh, M.: A Road Network Embedding Technique for K-Nearest Neighbor Search in Moving Object Databases. GeoInformatica 7(3), 255–273 (2003)
Shekhar, S., Liu, D.: CCAM: A Connectivity-Clustered Access Method for Networks and Network Computations. TKDE 19(1), 102–119 (1997)
Song, Z., Roussopoulos, N.: K-Nearest Neighbor Search for Moving Query Point. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol. 2121, pp. 79–96. Springer, Heidelberg (2001)
Tao, Y., Papadias, D., Shen, Q.: Continuous Nearest Neighbor Search. In: Proc. VLDB, pp. 287–298 (2002)
Vazirgiannis, M., Wolfson, O.: A Spatio Temporal Model and Language for Moving Objects on Road Networks. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol. 2121, pp. 20–35. Springer, Heidelberg (2001)
Xiong, X., Mokbel, M.F., Aref, W.G.: SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases. In: ICDE (2005)
Yu, C., Ooi, B.C., Tan, K.L., Jagadish, H.V.: Indexing the Distance: An Efficient Method to KNN Processing. In: Proc. VLDB, pp. 421–430 (2001)
Yoo, J.S., Shekhar, S.: In-Route Nearest Neighbor Queries. GeoInformatica 9(2), 117–137 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huang, X., Jensen, C.S., Šaltenis, S. (2005). The Islands Approach to Nearest Neighbor Querying in Spatial Networks. In: Bauzer Medeiros, C., Egenhofer, M.J., Bertino, E. (eds) Advances in Spatial and Temporal Databases. SSTD 2005. Lecture Notes in Computer Science, vol 3633. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11535331_5
Download citation
DOI: https://doi.org/10.1007/11535331_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28127-6
Online ISBN: 978-3-540-31904-7
eBook Packages: Computer ScienceComputer Science (R0)