Abstract
This paper concerns the efficient processing of multiple k nearest neighbor queries in a road-network setting. The assumed setting covers a range of scenarios such as the one where a large population of mobile service users that are constrained to a road network issue nearest-neighbor queries for points of interest that are accessible via the road network. Given multiple k nearest neighbor queries, the paper proposes progressive techniques that selectively cache query results in main memory and subsequently reuse these for query processing. The paper initially proposes techniques for the case where an upper bound on k is known a priori and then extends the techniques to the case where this is not so. Based on empirical studies with real-world data, the paper offers insight into the circumstances under which the different proposed techniques can be used with advantage for multiple k nearest neighbor query processing.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brinkhoff, T.: Network-based Generator of Moving Objects, http://www.fh-oldenburg.de/iapg/personen/brinkhof/generator/
Cho, H.-J., Chung, C.-W.: An Efficient and Scalable Approach to CNN Queries in a Road Network. In: Proc. VLDB, pp. 865–876 (2005)
Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. In: Proc. KDD, pp. 226–231 (1996)
Güting, R.H., de Almeida, V.T., Ding, Z.: Modeling and Querying Moving Objects in Networks. In: VLDB J. (to appear, 2006)
Huang, X., Jensen, C.S., Šaltenis, S.: The Islands Approach to Nearest Neighbor Querying in Spatial Networks. In: Bauzer Medeiros, C., Egenhofer, M.J., Bertino, E. (eds.) SSTD 2005. LNCS, vol. 3633, pp. 73–90. Springer, Heidelberg (2005)
Hu, H., Lee, D.-L., Xu, J.: Fast Nearest Neighbor Search on Road Networks. In: Ioannidis, Y., Scholl, M.H., Schmidt, J.W., Matthes, F., Hatzopoulos, M., Böhm, K., Kemper, A., Grust, T., Böhm, C. (eds.) EDBT 2006. LNCS, vol. 3896, pp. 186–203. Springer, Heidelberg (2006)
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)
Mouratidis, K., Hadjieleftheriou, M., Papadias, D.: Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring. In: Proc. SIGMOD, pp. 634–645 (2005)
Papadopoulos, A.N., Manolopoulos, Y.: Multiple range query optimization in spatial databases. In: Litwin, W., Morzy, T., Vossen, G. (eds.) ADBIS 1998. LNCS, vol. 1475, pp. 71–82. Springer, Heidelberg (1998)
Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query Processing in Spatial Network Databases. In: VLDB 2003, pp. 802–813 (2003)
Speičys, L., Jensen, C.S., Kligys, A.: Computational Data Modeling for Network Constrained Moving Objects. In: Proc. ACMGIS, pp. 118–125 (2003)
Shekhar, S., Liu, D.: CCAM: A Connectivity-Clustered Access Method for Networks and Network Computations. IEEE TKDE 119(1), 102–119 (1997)
Xiong, X., Mokbel, M.F., Aref, W.G.: SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-Temporal Databases. In: Proc. ICDE, pp. 643–654 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huang, X., Jensen, C.S., Šaltenis, S. (2006). Multiple k Nearest Neighbor Query Processing in Spatial Network Databases. In: Manolopoulos, Y., Pokorný, J., Sellis, T.K. (eds) Advances in Databases and Information Systems. ADBIS 2006. Lecture Notes in Computer Science, vol 4152. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11827252_21
Download citation
DOI: https://doi.org/10.1007/11827252_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37899-0
Online ISBN: 978-3-540-37900-3
eBook Packages: Computer ScienceComputer Science (R0)