Abstract
Recently, the spatial network databases (SNDB) have been studied for emerging applications such as location-based services including mobile search and car navigation. In practice, objects, like cars and people with mobile phones, can usually move on an underlying network (road, railway, sidewalk, river, etc.), where the network distance is determined by the length of the practical shortest path connecting two objects. In this paper, we propose materialization-based query processing algorithms for typical spatial queries in SNDB, such as range search and k nearest neighbors (k-NN) search. By using a materialization-based technique with the shortest network distances of all the nodes on the network, the proposed query processing algorithms can reduce the computation time of the network distance as well as the number of disk I/Os required for accessing nodes. Thus, the proposed query processing algorithms improve the existing efficient k-NN (INE) and range search (RNE) algorithms proposed by Papadias et al. [1], respectively. It is shown that our range query processing algorithm achieves about up to one of magnitude better performance than RNE and our k-NN query processing algorithm achieves about up to 150% performance improvements over INE.
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 provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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)
Chang, J.-W., Um, J.-H., Lee, W.-C.: An Efficient Trajectory Index Structure for Moving Objects in Location-Based Services. In: Meersman, R., Tari, Z., Herrero, P. (eds.) OTM-WS 2005. LNCS, vol. 3762, pp. 1107–1116. Springer, Heidelberg (2005)
Speicys, L., Jensen, C.S., Kligys, A.: Computational Data Modeling for Network-Constrained Moving Objects. In: Proc. of ACM GIS, pp. 118–125 (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)
Pfoser, D., Jensen, C.S.: Indexing of Network Constrained Moving Objects. In: Proc. of ACM GIS, pp. 25–32 (2003)
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)
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. (2006). Materialization-Based Range and k-Nearest Neighbor Query Processing Algorithms. In: Larsen, H.L., Pasi, G., Ortiz-Arroyo, D., Andreasen, T., Christiansen, H. (eds) Flexible Query Answering Systems. FQAS 2006. Lecture Notes in Computer Science(), vol 4027. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11766254_6
Download citation
DOI: https://doi.org/10.1007/11766254_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34638-8
Online ISBN: 978-3-540-34639-5
eBook Packages: Computer ScienceComputer Science (R0)