Abstract
This paper addresses the problem of k Closest Pairs (kCP) query in spatial network databases. A Best-First search approach namely BFCP (Best-First Closest Pair) is proposed. Given two data sets of objects in a spatial network, BFCP first finds the 1st CP by computing the 1st NN (nearest neighbor) of each object in the set with smaller cardinality. Then BFCP retrieves the 2nd , 3rd , …, kth CP in an incremental way by searching the next NN of the currently found CP’s source point. Furthermore, a novel buffer replacement policy called MDU (Minimum Distance Unit) is proposed to reduce I/O cost of BFCP. Unlike LRU, which records only the last reference time, the MDU policy considers both temporal locality and spatial locality when selecting a buffer page as the victim. A comprehensive experimental study is conducted to demonstrate the advantage of BFCP and MDU.
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
Guttman, A.: R-trees: A Dynamic Index Structure for Spatial Searching. In: SIGMOD (1984)
Corral, A., Manolopoulos, Y., Theodoridis, Y., Vassilakopoulos, M.: Closest Pair Queries in Spatial Databases. In: SIGMOD (2000)
Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query Processing in Spatial Network Databases. In: VLBD (2003)
Sankaranarayanan, J., Samet, H.: Distance Join Queries on Spatial Networks. In: GIS (2006)
Shekhar, S., Liu, D.: CCAM: A Connectivity-Clustered Access Method for Networks and Network Computations. TKDE 19(1), 102–119 (1997)
Mouratidis, K., Yiu, M.L., Papadias, D., Mamoulis, N.: Continuous Nearest Neighbor Monitoring in Road Networks. In: VLDB (2006)
Kolahdouzan, M., Shahabi, C.: Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases. In: VLDB (2004)
Shahabi, C., Kolahdouzan, M., Sharifzadeh, M.: A Road Network Embedding Technique for k Nearest Neighbor Search in Moving Object Databases. Geoinformatica 7(3), 255–273 (2003)
Samet, H., Sankaranarayanan, J., Alborzi, H.: Scalable Network Distance Browsing in Spatial Databases. In: SIGMOD (2008)
Sankaranarayanan, J., Samet, H.: Distance Oracles for Spatial Networks. In: ICDE (2009)
Sankaranarayanan, J., Samet, H.: Path Oracles for Spatial Networks. In: VLDB (2009)
Effelsberg, W.: Principles of Database buffer Management. ACM TODS 9(4), 560–595 (1984)
O’Neil, E.J., Neil, P.E.O., Weikum, G.: The LRU-K Page Replacement Algorithm for Database Disk Buffering. In: SIGMOD (1993)
Papadopoulos, A., Manolopoulos, Y.: Global Page Replacement in Spatial Databases. In: DEXA (1996)
Brinkhoff, T.: A Robust and Self-tuning Page Replacement Strategy for Spatial Database Systems. In: DEXA (2002)
Digital Chart of the World Server, http://www.maproom.psu.edu/dcw/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, C., Sun, W., Zheng, B., Mao, D., Liu, W. (2011). An Incremental Approach to Closest Pair Queries in Spatial Networks Using Best-First Search. In: Hameurlain, A., Liddle, S.W., Schewe, KD., Zhou, X. (eds) Database and Expert Systems Applications. DEXA 2011. Lecture Notes in Computer Science, vol 6861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23091-2_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-23091-2_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23090-5
Online ISBN: 978-3-642-23091-2
eBook Packages: Computer ScienceComputer Science (R0)