TY - JOUR
T1 - An efficient location encoding method based on hierarchical administrative district
AU - Lee, Sangyoon
AU - Park, Sanghyun
AU - Kim, Woo Cheol
AU - Lee, Dongwon
N1 - Funding Information:
★ This work was partially supported by Korea Research Foundation Grant (KRF-2004-003-D00302 and KRF-2005-206-D00015).
PY - 2005
Y1 - 2005
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=26844452547&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=26844452547&partnerID=8YFLogxK
U2 - 10.1007/11546924_87
DO - 10.1007/11546924_87
M3 - Conference article
AN - SCOPUS:26844452547
SN - 0302-9743
VL - 3588
SP - 890
EP - 899
JO - Lecture Notes in Computer Science
JF - Lecture Notes in Computer Science
T2 - 16th International Conference on Database and Expert Systems Applications, DExa 2005
Y2 - 22 August 2005 through 26 August 2005
ER -