Skip to main content

Part of the book series: Lecture Notes in Computer Science ((TLDKS,volume 7600))

Abstract

The advances in communication and positioning device technologies have made it possible to track the locations of moving objects, such as vehicles equipped with GPS. As a result, a new series of applications and services have been commenced into people’s life. One popular application is the real-time traffic system which provides current road condition and traffic jam information to commuters. To further enhance this location-based experience, this paper proposes an advanced type of service which can predict traffic jams so that commuters can plan their trips more effectively. In particular, traffic prediction is realized by a new type of query, termed as the predictive line query, which estimates the amount of vehicles entering a querying road segment at a specified future timestamp and helps query issuers adjust their travel plans in a timely manner. Only a handful of existing work can efficiently and effectively handle such queries since most methods are designed for objects moving freely in the Euclidean space instead of under road-network constraints. Taking the road network topology and object moving patterns into account, we propose a hybrid index structure, the R D-tree, which employs an R*-tree for network indexing and direction-based hash tables for managing vehicles. We also develop a ring-query-based algorithm to answer the predictive line query. We have conducted an extensive experimental study which demonstrates that our approach significantly outperforms existing work in terms of both accuracy and time efficiency.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Research and I. T. A. (RITA), RITA Bureau of Transportation Statistics

    Google Scholar 

  2. Silva, Y.N., Xiong, X., Aref, W.G.: The RUM-tree: supporting frequent updates in R-trees using memos. The VLDB Journal (2009)

    Google Scholar 

  3. Kwon, D., Lee, S., Lee, S.: Indexing the Current Positions of Moving Objects Using the Lazy Update R-tree. In: Proceedings of the Third International Conference on Mobile Data Management (2002)

    Google Scholar 

  4. Šaltenis, S., Jensen, C.S., Leutenegger, S.T., Lopez, M.A.: Indexing the Positions of Continuously Moving Objects. SIGMOD Record (2000)

    Google Scholar 

  5. Tao, Y., Papadias, D., Sun, J.: The TPR*-tree: An Optimized Spatio-Temporal Access Method for Predictive Queries. In: Proceedings of the 29th International Conference on Very Large Data Bases, vol. 29 (2003)

    Google Scholar 

  6. Saltenis, S., Jensen, C.: Indexing of Moving Objects for Location-based Services. In: Proceedings of 18th International Conference on Data Engineering (2002)

    Google Scholar 

  7. Yiu, M.L., Tao, Y., Mamoulis, N.: The Bdual-Tree: indexing moving objects by space filling curves in the dual space. The VLDB Journal (2008)

    Google Scholar 

  8. Jensen, C.S., Lin, D., Ooi, B.C.: Query and update efficient B+-tree based indexing of moving objects. In: Proceedings of the Thirtieth International Conference on Very Large Data Bases, vol. 30 (2004)

    Google Scholar 

  9. Chen, S., Ooi, B.C., Tan, K.-L., Nascimento, M.A.: St2B-Tree: A Self-Tunable Spatio-Temporal B+-Tree Index for Moving Objects. In: Proceedings of ACM SIGMOD International Conference on Management of Data (2008)

    Google Scholar 

  10. Patel, J.M., Chen, Y., Chakka, V.P.: STRIPES: an efficient index for predicted trajectories. In: Proceedings of ACM SIGMOD International Conference on Management of Data (2004)

    Google Scholar 

  11. Bok, K.S., Yoon, H.W., Seo, D.M., Kim, M.H., Yoo, J.S.: Indexing of Continuously Moving Objects on Road Networks. IEICE - Trans. Inf. Syst. (2008)

    Google Scholar 

  12. Feng, J., Lu, J., Zhu, Y., Watanabe, T.: Index Method for Tracking Network-Constrained Moving Objects. In: Lovrek, I., Howlett, R.J., Jain, L.C. (eds.) KES 2008, Part II. LNCS (LNAI), vol. 5178, pp. 551–558. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  13. Feng, J., Lu, J., Zhu, Y., Mukai, N., Watanabe, T.: Indexing of Moving Objects on Road Network Using Composite Structure. In: Apolloni, B., Howlett, R.J., Jain, L. (eds.) KES 2007, Part II. LNCS (LNAI), vol. 4693, pp. 1097–1104. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  14. Heendaliya, L., Lin, D., Hurson, A.: Optimizing Predictive Queries on Moving Objects under Road-Network Constraints. In: Hameurlain, A., Liddle, S.W., Schewe, K.-D., Zhou, X. (eds.) DEXA 2011, Part I. LNCS, vol. 6860, pp. 247–261. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  15. Tao, Y., Papadias, D.: MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries. In: Proceedings of the 27th International Conference on Very Large Data Bases (2001)

    Google Scholar 

  16. Pfoser, D., Jensen, C.S., Theodoridis, Y.: Novel Approaches to the Indexing of Moving Object Trajectories (2000)

    Google Scholar 

  17. Lin, H.-Y.: Using compressed index structures for processing moving objects in large spatio-temporal databases. In: J. Syst. Softw. (2012)

    Google Scholar 

  18. Hu, H., Lee, D.L., Lee, V.C.S.: Distance indexing on road networks. In: Proceedings of the 32nd International Conference on Very Large Data Bases, VLDB 2006(2006)

    Google Scholar 

  19. Dittrich, J., Blunschi, L., Vaz Salles, M.A.: Indexing Moving Objects Using Short-Lived Throwaway Indexes. In: Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases (2009)

    Google Scholar 

  20. Jeung, H., Yiu, M.L., Zhou, X., Jensen, C.S.: Path prediction and predictive range querying in road network databases. The VLDB Journal (2010)

    Google Scholar 

  21. Shahabi, C., Kolahdouzan, M.R., Sharifzadeh, M.: A road network embedding technique for k-nearest neighbor search in moving object databases. In: Proceedings of ACM International Symposium on Advances in Geographic Information Systems (2002)

    Google Scholar 

  22. Kim, K.-S., Kim, S.-W., Kim, T.-W., Li, K.-J.: Fast indexing and updating method for moving objects on road networks. In: Proceedings of the Fourth International Conference on Web Information Systems Engineering Workshops (2003)

    Google Scholar 

  23. Fan, P., Li, G., Yuan, L., Li, Y.: Vague continuous K-nearest neighbor queries over moving objects with uncertain velocity in road networks. Information Systems (2012)

    Google Scholar 

  24. Le, J., Liu, L., Guo, Y., Ying, M.: Supported High-Update Method on Road Network. In: 4th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM (2008)

    Google Scholar 

  25. Kejia, H., Liangxu, L.: Efficiently Indexing Moving Objects on Road Network. In: International Conference on Computational Intelligence and Software Engineering, CiSE 2009 (2009)

    Google Scholar 

  26. Wang, H., Zimmermann, R.: Snapshot location-based query processing on moving objects in road networks. In: Proceedings of ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (2008)

    Google Scholar 

  27. Mouratidis, K., Yiu, M.L., Papadias, D., Mamoulis, N.: Continuous nearest neighbor monitoring in road networks. In: Proceedings of the 32nd International Conference on Very Large Data Bases (2006)

    Google Scholar 

  28. Qin, L., Yu, J.X., Ding, B., Ishikawa, Y.: Monitoring Aggregate k-NN Objects in Road Networks. In: Ludäscher, B., Mamoulis, N. (eds.) SSDBM 2008. LNCS, vol. 5069, pp. 168–186. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  29. Sun, H.-L., Jiang, C., Liu, J.-L., Sun, L.: Continuous Reverse Nearest Neighbor Queries on Moving Objects in Road Networks. In: Proceedings of the 2008 The Ninth International Conference on Web-Age Information Management (2008)

    Google Scholar 

  30. Guohui, L., Yanhong, L., Jianjun, L., Shu, L., Fumin, Y.: Continuous reverse k nearest neighbor monitoring on moving objects in road networks. Inf. Syst. (2010)

    Google Scholar 

  31. Lai, C., Wang, L., Chen, J., Meng, X., Zeitouni, K.: Effective Density Queries for Moving Objects in Road Networks. In: Dong, G., Lin, X., Wang, W., Yang, Y., Yu, J.X. (eds.) APWeb/WAIM 2007. LNCS, vol. 4505, pp. 200–211. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  32. Xuan, K., Taniar, D., Safar, M., Srinivasan, B.: Time constrained range search queries over moving objects in road networks. In: Proceedings of the 8th International Conference on Advances in Mobile Computing and Multimedia (2010)

    Google Scholar 

  33. Kang, H.-Y., Kim, J.-S., Li, K.-J.: Indexing Moving Objects on Road Networks in P2P and Broadcasting Environments. In: Carswell, J.D., Tezuka, T. (eds.) W2GIS 2006. LNCS, vol. 4295, pp. 227–236. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  34. Yang, Y.C., Cheng, C.M., Lin, P.Y., Tsao, S.L.: A Real-Time Road Traffic Information System based on a Peer-to-Peer Approach. In: IEEE Symposium on Computers and Communications (2008)

    Google Scholar 

  35. Šidlauskas, D., Šaltenis, S., Christiansen, C.W., Johansen, J.M., Šaulys, D.: Trees or grids?: indexing moving objects in main memory. In: Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (2009)

    Google Scholar 

  36. Chen, J., Meng, X.: Update-efficient indexing of moving objects in road networks. Geoinformatica (December 2009)

    Google Scholar 

  37. Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. In: Proceedings of ACM SIGMOD International Conference on Management of Data (1990)

    Google Scholar 

  38. Brinkhoff, T.: A framework for generating network-based moving objects (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Heendaliya, L., Lin, D., Hurson, A. (2012). Predictive Line Queries for Traffic Prediction. In: Hameurlain, A., Küng, J., Wagner, R., Liddle, S.W., Schewe, KD., Zhou, X. (eds) Transactions on Large-Scale Data- and Knowledge-Centered Systems VI. Lecture Notes in Computer Science, vol 7600. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34179-3_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34179-3_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34178-6

  • Online ISBN: 978-3-642-34179-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics