Abstract
In this paper, we design the architecture of disk-based data structures for spatial network databases (SNDB). Based on this architecture, we propose new query processing algorithms for range search and k nearest neighbors (k-NN) search, depending on the density of point of interests (POIs) in the spatial network. For this, we effectively combine Euclidean restriction and the network expansion techniques according to the density of POIs. In addition, our two query processing algorithms can reduce the computation time of network distance between a pair of nodes and the number of disk I/Os required for accessing nodes by using maintaining the shortest network distances of all the nodes in the spatial network. It is shown that our range query processing algorithm achieves about up to one order of magnitude better performance than the existing range query processing algorithm, such as RER and RNE [1]. In addition, our k-NN query processing algorithm achieves about up to 170~400% performance improvements over the existing network expansion k-NN algorithm, called INE, while it shows about up to one order of magnitude better performance than the existing Euclidean restriction k-NN algorithm, called IER [1].
This work is financially supported by the Ministry of Education and Human Resources Development(MOE), the Ministry of Commerce, Industry and Energy(MOCIE) and the Ministry of Labor(MOLAB) though the fostering project of the Lab of Excellency.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query Processing in Spatial Network Databases. In: Proc. of VLDB, pp. 802–813 (2003)
Shekhar, S., et al.: Spatial Databases – Accomplishments and Research Needs. IEEE Tran. on Knowledge and Data Engineering 11(1), 45–55 (1999)
Speicys, L., Jensen, C.S., Kligys, A.: Computational Data Modeling for Network-Constrained Moving Objects. In: Proc. of ACM GIS, pp. 118–125 (2003)
Pfoser, D., Jensen, C.S.: Indexing of Network Constrained Moving Objects. In: Proc. of ACM GIS, pp. 25–32 (2003)
Jensen, C.S., Kolář, J., Pedersen, T.B., Timko, I.: Nearest Neighbor Queries in Road Networks. In: Proc. of ACM GIS, pp. 1–8 (2003)
Kolahdouzan, M., Shahabi, C.: Voronoi-Based K Nearest Neighbor Querying in Spatial Networks. In: Proc. of VLDB, pp. 840–851 (2004)
Huang, X., Jensen, C.S., Saltenis, S.: The islands Approach to Nearest Neighbors Search for Spatial Network Databases. In: Bauzer Medeiros, C., Egenhofer, M.J., Bertino, E. (eds.) SSTD 2005. LNCS, vol. 3633, pp. 73–90. Springer, Heidelberg (2005)
Seidl, T., Roussopoulos, N., Faloutsos, C.: The R+-tree: a Dynamic Index for Multi-Dimensional Objects. In: Proc. of VLDB (1987)
Jing, N., Huang, Y.-W., Rundensteiner, E.A.: Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation. IEEE Tran. on Knowledge and data Engineering 10(3), 409–432 (1998)
Seidl, T., Kriegel, H.: Optimal Multi-step k-Nearest Neighbor Search. In: Proc. of ACM SIGMOD (1998)
San Francisco Bay map, http://www.fh-oow.de/institute/iapg/personen/brinkhoff/generator/
Brinkhoff, T.: A Framework for Generating Network-Based Moving Objects. GeoInformatica 6(2), 153–180 (2002)
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
Chang, JW., Kim, YK., Kim, SM., Kim, YC. (2006). New Query Processing Algorithms for Range and k-NN Search in Spatial Network Databases. In: Roddick, J.F., et al. Advances in Conceptual Modeling - Theory and Practice. ER 2006. Lecture Notes in Computer Science, vol 4231. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11908883_16
Download citation
DOI: https://doi.org/10.1007/11908883_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-47703-7
Online ISBN: 978-3-540-47704-4
eBook Packages: Computer ScienceComputer Science (R0)