Skip to main content
SpringerLink
Log in

An Update Method for Shortest Path Caching with Burst Paths Based on Sliding Windows

  • Conference paper
  • First Online:
Web-Age Information Management (WAIM 2016)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9659))

Included in the following conference series:

  • 1140 Accesses

Abstract

Caching shortest paths is an important problem, and it is widely used in traffic networks, social networks, logistic networks, communication networks and other fields. By far, few existing methods has considered burst paths, which are common in real life. For instance, queries of a certain path can sharply increase due to a promotion or vacations. Such burst queries usually last for a relatively short period, and their frequencies are too low to be loaded into caches according to conventional methods. In this paper, we propose two methods: the basic and incremental cache update methods. Both methods are based on sliding windows. Specially, the incremental update method quantifies burst paths and updates the cache incrementally. Comprehensive experiments show that our methods surpass current best algorithm SPC by more than 30 % in terms of hit ratio on real road network data with burst paths.

The work is partially supported by the NSF of China (Nos. 61272178, 61572122), the NSF of China for Outstanding Young Scholars (No. 61322208), and the NSF of China for Key Program (No. 61532021).

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

Access this chapter

Log in via an institution
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 EPUB and 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

Notes

  1. 1.

    http://www.dbxr.org/experimental-guidelines/.

  2. 2.

    http://arxiv.org/abs/cs/04100001.

References

  1. Wu, L., Xiao, X., Deng, D., et al.: Shortest path and distance queries on road networks: an experimental evaluation. Proc. VLDB Endow. 5(5), 406–417 (2012)

    Article  Google Scholar 

  2. Altingovde, I.S., Ozcan, R., Ulusoy, Ö.: A cost-aware strategy for query result caching in web search engines. In: Boughanem, M., Berrut, C., Mothe, J., Soule-Dupuy, C. (eds.) ECIR 2009. LNCS, vol. 5478, pp. 628–636. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  3. Baeza-Yates, R., Gionis, A., Junqueira, F., et al.: The impact of caching on search engines. In: Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 183–190. ACM (2007)

    Google Scholar 

  4. Vlachos, M., Wu, K.L., Chen, S.K., et al.: Correlating burst events on streaming stock market data. Data Min. Knowl. Discov. 16(1), 109–133 (2008)

    Article  MathSciNet  Google Scholar 

  5. Parikh, N., Sundaresan, N.: Scalable and near real-time burst detection from eCommerce queries. In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 972–980. ACM (2008)

    Google Scholar 

  6. Subašić, I., Castillo, C.: The effects of query bursts on web search. In: Web Intelligence and Intelligent Agent Technology, pp. 374–381. International Conference on IEEE (2010)

    Google Scholar 

  7. Lee, K., Lee, W.C., Zheng, B., Xu, J.: Caching complementary space for location based services. In: EDBT, pp. 1020–1038 (2006)

    Google Scholar 

  8. Wei, F.: TEDI: efficient shortest path query answering on graphs. In: Proceedings of the 2010 International Conference on Management of Data, pp. 99–110. ACM (2010)

    Google Scholar 

  9. Cheng, J., Ke, Y., Chu, S., et al.: Efficient processing of distance queries in large graphs: a vertex cover approach. In: Proceedings of the 2012 International Conference on Management of Data, pp. 457–468. ACM (2012)

    Google Scholar 

  10. Thomsen, J.R., Yiu, M.L., Jensen, C.S.: Effective caching of shortest paths for location-based services. In: Proceedings of the 2012 International Conference on Management of Data, pp. 313–324. ACM (2012)

    Google Scholar 

  11. Gan, Q., Suel, T.: Improved techniques for result cache in web search engines. In: Proceedings of the 18th International Conference on World Wide Web, pp. 431–440. WWW (2009)

    Google Scholar 

  12. Long, X., Suel, T.: Three-level caching for efficient query processing in large web search engines. World Wide Web-Internet Web Inf. Syst. 9(4), 369–395 (2006)

    Article  Google Scholar 

  13. Markatos, E.P.: On caching search engine query results. Comput. Commun. 24(2), 137–143 (2001)

    Article  Google Scholar 

  14. Li, X., Qiu, T., Yang, X., Wang, B., Yu, G.: Refreshment strategies for the shortest path caching problem with changing edge weight. In: Jia, Y., Sellis, T., Liu, G., Chen, L. (eds.) APWeb 2014. LNCS, vol. 8709, pp. 331–342. Springer, Heidelberg (2014)

    Google Scholar 

  15. He, Q., Chang, K., Lim, E.P.: Analyzing feature trajectories for event detection. In: Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 207–214. ACM (2007)

    Google Scholar 

  16. Chen, W., Chen, C., Zhang, L., Wang, C., Bu, J.: Online detection of bursty events and their evolution in news streams. J. Zhejiang Univ. 11(5), 340–355 (2010)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, Northeastern University, Shenyang, China

    Xiaohua Li, Kanggui Peng, Xiaochun Yang & Ge Yu

  2. Department of Information Management, Shanghai University, Shanghai, China

    Ning Wang

Authors
  1. Xiaohua Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ning Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kanggui Peng
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Xiaochun Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Ge Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiaohua Li .

Editor information

Editors and Affiliations

  1. Peking University , Beijing, China

    Bin Cui

  2. The George Washington University , Washington, D.C., USA

    Nan Zhang

  3. Hong Kong Baptist University, Kowloon Tong, Hong Kong, China

    Jianliang Xu

  4. University of Texas Rio Grande Valley, Edinburg, Texas, USA

    Xiang Lian

  5. Jiangxi University of Finance and Economics, Nanchang, Jiangxi, China

    Dexi Liu

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Li, X., Wang, N., Peng, K., Yang, X., Yu, G. (2016). An Update Method for Shortest Path Caching with Burst Paths Based on Sliding Windows. In: Cui, B., Zhang, N., Xu, J., Lian, X., Liu, D. (eds) Web-Age Information Management. WAIM 2016. Lecture Notes in Computer Science(), vol 9659. Springer, Cham. https://doi.org/10.1007/978-3-319-39958-4_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-39958-4_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-39957-7

  • Online ISBN: 978-3-319-39958-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation