Skip to main content

Forecasting Region Search of Moving Objects

  • Conference paper
  • 1215 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4251))

Abstract

The issue of how to provide location-based service (LBS) is attracted many researchers. In this paper, we focus on an useful searching type in LBS, forecasting search, which provides search result for a future time based on the current information of moving objects. To deal with such kind of searches, a PV-graph is proposed for analyzing the possible situations of the moving objects. By using PV-graph, forecasting queries in LBS applications can be responded efficiently.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Shahabi, C., Kolahdouzan, M.R., Sharifzadeh, M.: A road network embedding technique for k-nearest neighbor search in moving object databases. GeoInformatica (3), 255–273 (2003)

    Google Scholar 

  2. Kolahdouzan, M.R., Shahabi, C.: Continuous k nearest neighbor queries in spatial network databases. In: Proceedings of the Second Workshop on Spatio-Temporal Database Management, pp. 33–40 (2004)

    Google Scholar 

  3. Song, Z.X., Roussopoulos, N.: K-nearest neighbor search for moving query point. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol. 2121, pp. 79–96. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Feng, J., Mukai, N., Watanabe, T.: Stepwise optimization method for k-cnn search for location-based service. In: Vojtáš, P., Bieliková, M., Charron-Bost, B., Sýkora, O. (eds.) SOFSEM 2005. LNCS, vol. 3381, pp. 363–366. Springer, Heidelberg (2005)

    Google Scholar 

  5. Feng, J., Mukai, N., Watanabe, T.: Search on transportation network for location-based service. In: Ali, M., Esposito, F. (eds.) IEA/AIE 2005. LNCS (LNAI), vol. 3533, pp. 657–666. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proc. of ACM SIGMOD 1984, pp. 47–57 (1984)

    Google Scholar 

  7. Tao, Y.F., Papadias, D., Sun, J.M.: The tpr*-tree: An optimized spatio-temporal access method for predictive queries. In: Aberer, K., Koubarakis, M., Kalogeraki, V. (eds.) VLDB 2003. LNCS, vol. 2944, pp. 790–801. Springer, Heidelberg (2004)

    Google Scholar 

  8. Lin, D., Jensen, C.S., Ooi, B.C., S̃altenis, S.: Efficient indexing of the historical, present, and future positions of moving objects. In: MEM 2005: Proceedings of the 6th international conference on Mobile data management, pp. 59–66. ACM Press, New York (2005)

    Chapter  Google Scholar 

  9. Patel, J.M., Chen, Y., Chakka, V.P.: Stripes: an efficient index for predicted trajectories. In: SIGMOD 2004: Proceedings of the 2004 ACM SIGMOD international conference on Management of data, pp. 635–646. ACM Press, New York (2004)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Feng, J., Wu, L., Zhu, Y., Watanabe, T. (2006). Forecasting Region Search of Moving Objects. In: Gabrys, B., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2006. Lecture Notes in Computer Science(), vol 4251. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11892960_124

Download citation

  • DOI: https://doi.org/10.1007/11892960_124

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-46535-5

  • Online ISBN: 978-3-540-46536-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics