Abstract
The issue of how to provide location-based service (LBS) attracted many researchers. In this paper, we focus on a typical situation of LBS which is to provide services for users in cars that move in a road network. To provide such kind of services, an integration method for representing transportation information with a road map is proposed. By using our integration method, since the transportation information of road networks is managed under the spatial index structure created for road networks, spatial queries on them can take advantages of the spatial index structure and achieve an efficient process. Moreover, we discuss path search, region search, nearest neighbor search and continuous nearest neighbor search in this paper, which are based on transportation networks with (or without) considering the static spatial objects outside the transportation networks. Using transportation information and the corresponding real road network, the paper offers evaluations by comparing our representation method and query method with those in related works. The results show a good performance of our methods.
Similar content being viewed by others
References
Chung JD, Peak OH, Lee JW, Ryu KH (2002) Temporal pattern mining of moving objects for location-based services. In: Proceedings of the int’l conference database and expert systems applications
Goodchild MF (2000) Gis and transportation: status and challenges. GeoInformatica 4(2):127–139
Winter S (2002) Modeling costs of turns in route planning. Geo Informatica (4):345–361
Fawcett J, Robinson P (2000) Adaptive routing for road traffic. IEEE Comput Graph Appl 20(3):46–53
Lee CY (1961) An algorithm for path connectivity and its applications. IRE Trans. Electron Comput 10(3):346–365
Papadias D, Zhang J, Mamoulis N, Tao YF (2003) Query processing in spatial network databases. In: Proceedings VLDB 2003, pp 802–813
Christofides N (1975) Graph theory: an algorithmic approach. Academic Press Inc. (London) Ltd.
Gaede V, Gunther O (1998) Multidimensional access methods. ACM Comput Surv 30(2):170–231
Song ZX, Roussopoulos N (2001) K-nearest neighbor search for moving query point. In: Proceedings of the SSTD’01, pp 79–96
Korn F, Muthukrishnan S (2000) Influence sets based on reverse nearest neighbor queries. In: Proceedings of the 2000 ACM SIGMOD international conference on Management of data, pp 201–212
Bespamyatnikh S, Snoeyink J (1999) Queries with segments in voronoi diagrams. SODA
Tao YF, Papadias D, Shen QM (2002) Continuous nearest neighbor search. In: Proceedings of the VLDB’02, pp 287–298
Feng J, Mukai N, Watanabe T (2004) Incremental maintenance of all-nearest neighbors based on road network. In: Proceedings of the IEA/AIE 2004, LNAI, vol 3029, pp 164–169
Shahabi C, Kolahdouzan MR, Sharifzadeh M (2003) A road network embedding technique for k-nearest neighbor search in moving object databases. GeoInformatica (3):255–273
Shekhar S, Yoo JS (2003) Processing in-route nearest neighbor queries: a comparison of alternative approaches. In: Proceedings of the GIS’03, pp 9–16
Jensen CS, Kolvr J, Pedersen TB, Timko I (2003) Nearest neighbor queries in road networks. In: GIS ’03: Proceedings of the 11th ACM international symposium on advances in geographic information systems, New York, NY, USA, 2003. ACM Press, pp 1–8
Li Y, Yang J, Han J (2004) Continuous k-nearest neighbor search for moving objects. SSDBM, pp 123–126
Feng J, Watanabe T (2002) A fast method for continuous nearest target objects query on road network. In: Proceedings of the VSMM’02, pp 182–191
Guttman A (1984) R-trees: A dynamic index structure for spatial searching. In: Proceedings of the ACM SIGMOD’84, pp 47–57
Guting R (1994) An introduction to spatial database systems. Very Large Database J 3(4):357–399
Mamoulis N, Papadias D (2001) Multiway spatial joins. ACM Trans Database Syst 26(4):424–475
Beckmann N, Kriegel H-P, Schneider R, Seeger B (1990) The r*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of the ACM SIGMOD’90, pp 322– 331
Sellis T, Roussopoulos N, Faloutsos C (1987) The r+-tree: a dynamic index for multi-dimensional objects. In: Proceedings of the VLDB’87, pp 507–518
Kamel I, Faloutsos C (1994) Hilbert r-tree: an improved r-tree using fractals. In: Proceedings of the 20th VLDB, pp 500–509
Katayama N, Satoh S (1997) The sr-tree: an index structure for high-dimensional nearest neighbor queries. In: Proceedings of the ACM SIGMOD’97, pp 369–380
Abdelguerfi M, Givaudan J, Shaw K, Ladner R (2002) The 2-3tr-tree, a trajectory-oriented index structure for fully evolving valid-time spatio-temporal datasets. In: Proceedings of the tenth ACM international symposium on advances in geographic information systems, pp 29–34
Ahn HK, Mamoulis N, Wong HM. A survey on multidimensional access methods.
Bayer R, McCreight E (1972) Organization and maintenance of large ordered indexes. Acta Informatica 1(3):173–189
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Feng, J., Zhu, Y., Mukai, N. et al. Search on transportation networks for location-based service. Appl Intell 26, 69–79 (2007). https://doi.org/10.1007/s10489-006-0004-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10489-006-0004-4