Abstract
Due to the rapid development in mobile communication technologies, the usage of mobile devices such as cell phone or PDA becomes increasingly popular. As different devices require different applications, various new services are being developed to satisfy the needs. One of the popular services under heavy demand is the Location-based Service (LBS) that exploits the spatial information of moving objects per temporal changes. In order to support LBS efficiently, it is necessary to be able to index and query well a large amount of spatio-temporal information of moving objects. Therefore, in this paper, we investigate how such location information of moving objects can be efficiently stored and indexed. In particular, we propose a novel location encoding method based on hierarchical administrative district information. Our proposal is different from conventional approaches where moving objects are often expressed as geometric points in two dimensional space, (x, y). Instead, in ours, moving objects are encoded as one dimensional points by both administrative district as well as road information. Our method is especially useful for monitoring traffic situation or tracing location of moving objects through approximate spatial queries.
This work was partially supported by Korea Research Foundation Grant (KRF-2004-003-D00302 and KRF-2005-206-D00015).
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Faloutsos, C.: Gray Codes for Partial Match and Range Queries. IEEE Trans. on Software Engineering 14(10), 1381–1393 (1988)
Faloutsos, C., Roseman, S.: Fractals for Secondary Key Retrieval. In: Proc. ACM PODS, pp. 247–252 (1989)
Gupta, S., Kopparty, S., Ravishankar, C.: Roads, Codes, and Spatiotemporal Queries. In: Proc. ACM PODS, pp. 115–124 (2004)
Guttman, A.: R-trees: A Dynamic Index Structure for Spatial Searching. In: Proc. ACM SIGMOD, pp. 47–54 (1984)
Nascimento, M.A., Silva, J.R.O.: Towards Historical R-trees. In: Proc. ACM Symposium on Applied Computing, pp. 235–240 (1998)
Orenstein, J.A., Merrett, T.H.: A Class of Data Structures for Associative Searching. In: Proc. ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, pp. 181–190 (1984)
Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query Processing in Spatial Network Databases. In: Proc. VLDB Conference, pp. 802–813 (2003)
Pfoser, D., Theodoridis, Y., Jensen, C.S.: Indexing Trajectories in Query Processing for Moving Objects. Chorochronos Technical Report, CH-99-3 (1999)
Pfoser, D., Jensen, C.S., Theodoridis, Y.: Novel Approaches in Query Processing for Moving Objects. In: Proc. VLDB Conference, pp. 395–406 (2000)
Tao, Y., Papadias, D.: MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries. In: Proc. VLDB Conference, pp. 431–440 (2001)
Theodoridis, Y., Vazirgiannis, M., Sellis, T.K.: Spatio-Temporal Indexing for Large Multimedia Applications. In: Proc. IEEE International Conference on Multimedia Computing and Systems, pp. 441–448 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, S., Park, S., Kim, WC., Lee, D. (2005). An Efficient Location Encoding Method Based on Hierarchical Administrative District. In: Andersen, K.V., Debenham, J., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2005. Lecture Notes in Computer Science, vol 3588. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11546924_87
Download citation
DOI: https://doi.org/10.1007/11546924_87
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28566-3
Online ISBN: 978-3-540-31729-6
eBook Packages: Computer ScienceComputer Science (R0)