Abstract
In telematics and location-based service (LBS) applications, because moving objects usually move on spatial networks, 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 Point of Interests (POIs) 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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query processing in spatial network databases. In: Proc. VLDB, 802–813 (2003)
Shahabi, C., Kolahdouzan, M.R., Sharifzadeh, M.: A road network embedding technique for K-nearest neighbor search in moving object databases. In Proc GeoInformatica 7(3), 255–273 (2003)
Jensen, C.S., Pedersen, T.B., Speicys, L., Timko, I.: Data modeling for mobile services in the real world. In Proc. SSTD, 1–9 (2003)
Rimantas, B., Christian, S., Jensen, Gytis. K., Simonas, Š.: Nearest and reverse nearest neighbor queries for moving objects. In Proc. VLDB, 229–250 (2006)
Huang, YK., Chen, C-C., Lee, C.: Continuous K-nearest neighbor query for moving objects with uncertain velocity. In Proc. GeoInformatica 13(1) 1–25 (2009)
Kolahdouzan, M.R., Shahabi, C.: Voronoi-based nearest neighbor search for spatial network databases. In Proc. VLDB, 840–851 (2004)
Safar, M.: K nearest neighbor search in navigation systems mobile information systems. Mob. Inf. Syst. 1(3), 207–224 (2005)
Huang, X., Jensen, C.S., Saltenis, S.: The Islands approach to nearest neighbor querying in spatial networks. In Proc. SSTD LNCS 3633, 73–90 (2005)
Huang, X., Jensen, C.S., Lu, H., Saltenis, S.: S-GRID: a versatile approach to efficient query processing in spatial networks. In Proc. SSTD LNCS 4605, 93–111 (2007)
Brinkhoff, T.: A framework for generating network-based moving objects. In Proc. GeoInformatica, 153–180 (2002)
Acknowledgments
This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology (2010-0023800).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer Science+Business Media Dordrecht
About this paper
Cite this paper
Hong, S., Chang, J. (2012). A New k-NN Query Processing Algorithm Using a Grid Structure for Mobile Objects in Location-Based Services. In: Yeo, SS., Pan, Y., Lee, Y., Chang, H. (eds) Computer Science and its Applications. Lecture Notes in Electrical Engineering, vol 203. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-5699-1_33
Download citation
DOI: https://doi.org/10.1007/978-94-007-5699-1_33
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-007-5698-4
Online ISBN: 978-94-007-5699-1
eBook Packages: Computer ScienceComputer Science (R0)