Using predictive prefetching to improve World Wide Web latency
ACM SIGCOMM Computer Communication Review
Web prefetching between low-bandwidth clients and proxies: potential and performance
SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Extended application of suffix trees to data compression
DCC '96 Proceedings of the Conference on Data Compression
A Keyword-Based Semantic Prefetching Approach in Internet News Services
IEEE Transactions on Knowledge and Data Engineering
Selective Markov models for predicting Web page accesses
ACM Transactions on Internet Technology (TOIT)
Objective-Optimal Algorithms for Long-Term Web Prefetching
IEEE Transactions on Computers
Mining longest repeating subsequences to predict world wide web surfing
USITS'99 Proceedings of the 2nd conference on USENIX Symposium on Internet Technologies and Systems - Volume 2
Reducing file system latency using a predictive approach
USTC'94 Proceedings of the USENIX Summer 1994 Technical Conference on USENIX Summer 1994 Technical Conference - Volume 1
| Hi-index | 0.00 |
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.