Advertisement

Continuous Min-Max Distance Bounded Query in Road Networks

  • Yuan-Ko Huang
  • Lien-Fa Lin
  • Yu-Chi Chung
  • I-Fang Su
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7235)

Abstract

In recent years, the research community has introduced various methods for processing spatio-temporal queries in road networks. In this paper, we present a novel type of spatio-temporal queries, named the continuous min-max distance bounded query (or CM 2 DBQ for short). Given a moving query object q, a minimal distance d m , and a maximal distance d M , a CM 2 DBQ retrieves the bounded objects whose road distances to q are within the range [d m , d M ] at each time instant. The CM 2 DBQ is indeed an important query with many real applications. We address the problem of processing the CM 2 DBQ and propose two algorithms, named the Continuous Within Query-based (CWQ-based) algorithm and the CM 2 DBQ algorithm, to efficiently determine the bounded objects at each time instant. Extensive experiments using real road network dataset demonstrate the efficiency of the proposed algorithms.

Keywords

Road Network Time Instant Network Node Road Segment Bounded Object 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Huang, Y.-K., Chen, C.-C., Lee, C.: Continuous k-nearest neighbor query for moving objects with uncertain velocity. GeoInformatica 13(1), 1–25 (2009)CrossRefGoogle Scholar
  2. 2.
    Iwerks, G., Samet, H., Smith, K.: Continuous k-nearest neighbor queries for continuously moving points with updates. In: Proceedings of the International Conference on Very Large Data Bases, Berlin, Germany, September 9-12 (2003)Google Scholar
  3. 3.
    Tao, Y., Papadias, D.: Time parameterized queries in spatio-temporal databases. In: Proceedings of the ACM SIGMOD, Madison, Wisconsin (2002)Google Scholar
  4. 4.
    Tao, Y., Papadias, D., Shen, Q.: Continuous nearest neighbor search. In: Proceedings of the International Conference on Very Large Data Bases, Hong Kong, China, August 20-23 (2002)Google Scholar
  5. 5.
    Xiong, X., Mokbel, M.F., Aref, W.G.: Sea-cnn: Scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases. In: Proceedings of the International Conference on Data Engineering (2005)Google Scholar
  6. 6.
    Cho, H.-J., Chung, C.-W.: An efficient and scalable approach to cnn queries in a road network. In: Proceedings of the International Conference on Very Large Data Bases, Trondheim, Norway (2005)Google Scholar
  7. 7.
    Hu, H., Lee, D.-L., Xu, J.: Fast Nearest Neighbor Search on Road Networks. In: Ioannidis, Y., Scholl, M.H., Schmidt, J.W., Matthes, F., Hatzopoulos, M., Böhm, K., Kemper, A., Grust, T., Böhm, C. (eds.) EDBT 2006. LNCS, vol. 3896, pp. 186–203. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  8. 8.
    Jensen, C.S., Kolar, J., Pedersen, T.B., Timko, I.: Nearest neighbor queries in road networks. In: Proceedings of the ACM GIS, New Orleans, Louisiana, USA, November 7-8 (2003)Google Scholar
  9. 9.
    Mouratidis, K., Yiu, M.L., Papadias, D., Mamoulis, N.: Continuous nearest neighbor monitoring in road networks. In: Proceedings of the International Conference on Very Large Data Bases, Seoul, Korea, September 12-15 (2006)Google Scholar
  10. 10.
    Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query processing in spatial network databases. In: Proceedings of the International Conference on Very Large Data Bases, Berlin, Germany, September 9-12 (2003)Google Scholar
  11. 11.
    Dijkstra, E.W.: A note on two problems in connection with graphs. Numeriche Mathematik 1, 269–271 (1959)MathSciNetzbMATHCrossRefGoogle Scholar
  12. 12.
    Kung, R., Hanson, E., Ioannidis, Y., Sellis, T., Shapiro, L., Stonebraker, M.: Heuristic search in data base system. In: Proceedings of the International Workshop on Expert Database Systems (1986)Google Scholar
  13. 13.
    Huang, Y.-K., Chen, Z.-W., Lee, C.: Continuous K-Nearest Neighbor Query over Moving Objects in Road Networks. In: Li, Q., Feng, L., Pei, J., Wang, S.X., Zhou, X., Zhu, Q.-M. (eds.) APWeb/WAIM 2009. LNCS, vol. 5446, pp. 27–38. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  14. 14.
    Huang, Y.-K., Lin, L.-F.: Continuous within query in road networks. In: IWCMC (2011)Google Scholar
  15. 15.
  16. 16.
    Brinkhoff, T.: A framework for generating network-based moving objects. GeoInformatica 6(2), 153–180 (2002)zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Yuan-Ko Huang
    • 1
  • Lien-Fa Lin
    • 1
  • Yu-Chi Chung
    • 2
  • I-Fang Su
    • 3
  1. 1.Department of Information CommunicationKao-Yuan UniversityTaiwan, R.O.C.
  2. 2.Department of Computer Science and Information EngineeringChang Jung Christian UniversityTaiwan, R.O.C.
  3. 3.Department of Information ManagementFortune Institute of TechnologyTaiwan, R.O.C.

Personalised recommendations