Advertisement

Online Granular Prediction Model for Web Prefetching

  • Zhimin Gu
  • Zhijie Ban
  • Hongli Zhang
  • Zhaolei Duan
  • Xiaojin Ren
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5009)

Abstract

Web prefetching is a primary means to reduce user access latency. The PPM was used to predict user request patterns in traditional literature. However the existing PPM models are usually constructed in offline case, they could not be updated incrementally for user coming new request, such models are only suitable for the relatively stable user access patterns. In this paper, we present an online PPM granular prediction model to capture the changing patterns and the limitation of memory, its implementation is based on a noncompact suffix tree and a sliding window W, the results show that our granular prediction model gives the best result comparing with existing PPM prediction models.

Keywords

Granular Computing Data Mining Algorithms 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Xu, C.Z., Ibrahim, T.I.: A keyword-based semantic prefetching approach in Internet news services. IEEE Transactions on Knowledge and Data Engineering 16, 5601–5611 (2004)Google Scholar
  2. 2.
    Aniket, M., Anirban, M., Williamson, C.: Locality characteristics of web streams revisited. In: The SCS Symposium on Performance Evaluation of Computer and Telecommunication Systems, pp. 795–803 (2005)Google Scholar
  3. 3.
    Padmanabhan, V.N., Mogul, J.C.: Using Predictive Prefetching to Improve World Wide Web Latency. Computer Communication Review 26(3), 22–36 (1996)CrossRefGoogle Scholar
  4. 4.
    Griffioen, J., Appleton, R.: Reducing File System Latency Using a Predictive Approach. In: Summer USENIX Conference, pp. 197–207 (1994)Google Scholar
  5. 5.
    Wu, B., Kshemkalyani, A.D.: Objective-Optimal Algorithms for Long-Term Web Prefetching. IEEE Transactions on Computers 5(1), 2–17 (2006)CrossRefGoogle Scholar
  6. 6.
    Deshpande, M., Karypis, G.: Selective Markov Models for Predicting Web Page Accesses. ACM Transactions on Internet Technology 4(2), 163–184 (2004)CrossRefGoogle Scholar
  7. 7.
    Palpanas, T., Mendelzon, A.: Web Prefetching Using Partial Match Prediction. In: The Fourth Web Caching Workshop (WCW 1999) (1999)Google Scholar
  8. 8.
    Pitko, J., Pirolli, P.: Mining Longest Repeating Subsequences to Predict World Wide Web Surfing. In: Second USENIX Symposium on Internet Technologies and Systems, pp. 139–150 (1999)Google Scholar
  9. 9.
    Fan, L., Cao, P., Jacobson, Q.: Web Prefetching Between Low-Bandwidth Clients and Proxies: Potential and Performance. In: The ACM SIGMETRICS 1999, Atlanta, Georgia (May 1999)Google Scholar
  10. 10.
    Larsson, N.J.: Extended application of suffix trees to data compression. In: The Conference on Data Compression, pp. 190–199 (1996)Google Scholar
  11. 11.
    Pawlak, Z.: Rough Sets. In: Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Zhimin Gu
    • 1
  • Zhijie Ban
    • 1
  • Hongli Zhang
    • 1
  • Zhaolei Duan
    • 1
  • Xiaojin Ren
    • 1
  1. 1.School of Computer Science and TechnologyBeijing Institute of TechnologyP.R. China

Personalised recommendations