Abstract
Because moving objects usually move on spatial networks in location-based service applications, their locations are updated frequently, leading to the degradation of retrieval performance. To manage the frequent updates of moving objects’ locations in an efficient way, we propose a new distributed grid scheme which utilizes node-based pre-computation technique to minimize the update cost of the moving objects’ locations. Because our grid scheme manages spatial network data separately from the POIs (Point of Interests) and moving objects, it can minimize the update cost of the POIs and moving objects. Using our grid scheme, we propose a new k-nearest neighbor (k-NN) query processing algorithm which minimizes the number of accesses to adjacent cells during POIs retrieval in a parallel way. Finally, we show from our performance analysis that our k-NN query processing algorithm is better on retrieval performance than that of the existing S-GRID.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Speičys L, Jensen CS (2008) Enabling location-based services-multi-graph representation of transportation networks. Proc GeoInformatica 12(2):219–253
Ilarri S, Mena E, Illarramendi A (2010) Location-dependent query processing: where we are and where we are heading. ACM Comput Surv 42(3):1–73 (Article 12)
Papadias D, Zhang J, Mamoulis N, Tao Y (2003) Query processing in spatial network databases. In: Proceedings of the VLDB 29: pp 802–813
Shahabi C, Kolahdouzan MR, Sharifzadeh M (2003) A road network embedding technique for K-nearest neighbor search in moving object databases. Proc GeoInformatica 7(3):255–273
Cao H, Wang S, Li L (2003) Location dependent query in a mobile environment. Proc Inf Sci 154(1–2):71–83
Jensen CS, Pedersen TB, Speicys L, Timko I (2003) Data modeling for mobile services in the real world. In: Proceedings of the SSTD, vol 2750, pp. 1–9
Benetis R, Jensen C S, Karčiauskas G, Šaltenis S (2006) Nearest and reverse nearest neighbor queries for moving objects. Proc VLDB 15: 229–250
Huang YK, Chen C-C, Lee C (2009) Continuous K-nearest neighbor query for moving objects with uncertain velocity. Proc GeoInformatica 13(1):1–25
Kolahdouzan MR, Shahabi C (2004) Voronoi-based nearest neighbor search for spatial network databases. In Proceedings of the VLDB 30: pp 840–851
Safar M (2005) K nearest neighbor search in navigation systems. Mobile Inf Syst 1(3):207–224
Huang X, Jensen CS, Saltenis S (2005) The islands approach to nearest neighbor querying in spatial networks. In Proceedings of the SSTD, LNCS 3633: 73–90
Huang X, Jensen CS, Lu H, Saltenis S (2007) S-GRID: a versatile approach to efficient query processing in spatial networks. In Proceedings of the SSTD, LNCS 4605: 93–111
Okabe A, Boots B, Sugihara K, Chiu SN (2000) Spatial tessellations, concepts and applications of voronoi diagrams, 2nd edn. Wiley, Chichester
Brinkhoff T (2002) A framework for generating network-based moving objects. Proc GeoInformatica 6:153–180
Acknowledgments
This work was supported by the Ministry of Education (MOE) and National Research Foundation of Korea (NRF) through the Human Resource Training Project for Regional Innovation(2014065816).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer Science+Business Media Dordrecht
About this paper
Cite this paper
Lee, H., Yoon, M., Chang, JW. (2015). A New Distributed Grid Scheme Utilizing Node-based Preprocessing Technique for Supporting k-NN Queries in Location-based Services. In: Park, J., Pan, Y., Chao, HC., Yi, G. (eds) Ubiquitous Computing Application and Wireless Sensor. Lecture Notes in Electrical Engineering, vol 331. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-9618-7_17
Download citation
DOI: https://doi.org/10.1007/978-94-017-9618-7_17
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-017-9617-0
Online ISBN: 978-94-017-9618-7
eBook Packages: EngineeringEngineering (R0)