期刊文献+

基于流行度的自适应Web预测模型 被引量:1

Adaptive Web prediction model based on popularity
在线阅读 下载PDF
导出
摘要 目前基于局部匹配预测(PPM)模型的研究关注的焦点是在保证预测精度的前提下,尽量缩减PPM的空间占用,但缺乏自适应动态更新机制,难以实现在线预取。针对Web访问特点,提出了基于流行度的自适应预测模型。该模型的核心是基于Web对象流行度的PAPPM预取算法,通过模型构造、模型预测和模型更新三个过程实现了动态自适应的Web预取。讨论并实现了确定性上下文预测,最优阶估算以及上下文LRU替换策略等功能。在Web缓存与预取一体化条件下的实验表明,该模型具有较高的性能,适用于在线预取。 The current research of Prediction by Partial Match (PPM) model generally focuses on the reduction of space complexity of the model under the condition of guaranteeing the prediction accuracy. But most of the studies lack the adaptive mechanism, which is requisite in on-line systems. In terms of Web access characteristics, popularity based adaptive PPM prediction model (PA PPM) was proposed, whose core was prefetching algorithm based on Web objects' popularity, PA PPM actualized dynamic adaptive Web prefetching by three parts: model construction, model prediction and model update, The mechanisms of deterministic context prediction, optimal order estimation and LRU based discarding policy to support adaptation were discussed and realized. Under the condition of integrated Web caching and prefetching, experimental results have shown that PA PPM model can achieve a good performance and can be used to realize on-line Web prefetching.
出处 《计算机应用》 CSCD 北大核心 2008年第3期553-557,共5页 journal of Computer Applications
基金 国家自然科学基金资助项目(60472044) 河南省信息网络重点实验室开放基金项目资助项目(2006)
关键词 预取 局部匹配预测 自适应 最优阶估算 prefetching Prediction by Partial Match (PPM) adaptive optimal order estimation
  • 相关文献

参考文献8

  • 1WU B , KSHEMKALYANI A D . Objective - optimal algorithms for long-term Web prefetching [ J]. IEEE Transactions on Computers, 2006,55(1): 2-17,
  • 2PONS A P. Improving the performance of client Web object retrieval [ J]. Journal of Systems and Software, 2005, 74(3):303 -311.
  • 3NANOPOULOS A, KATSAROS D, MANOLOPOULOS Y. A data mining algorithm for generalized web prefetehing [ J]. IEEE Transactions on Knowledge and Data Engineering, 2003, 5 ( 5 ) : 1155 - 1169.
  • 4DAVISON B D. Learning Web request patterns[ C]// Web Dynamics: Adapting to Change in Content, Size, Topology and Use. Heidelberg: Springer-Verlag, 2004:435-460.
  • 5CHEN X, ZHANG X. A popularity-based prediction model for Web prefetching [ J]. Computer, 2003, 36(3) : 63 - 70.
  • 6PALPANAS T , MENDELZON A . Web prefetching using partial match prediction[ R]. Technical Report CSRG-376, Department of CS, University of Toronto, 1998.
  • 7PITKOW J, PIROLLI P. Mining longest repeating subsequences to predict World Wide Web surfing[ C]// Proceedings of the 2nd conference on USENIX Symposium on Internet Technologies and Systems. Berkeley, USENIX Association, 1999:139 - 150.
  • 8Yan-Bo Han Zhi-Wei Xu Hai Zhuge.Preface[J].Journal of Computer Science & Technology,2006,21(4):465-465. 被引量:18

共引文献17

同被引文献9

  • 1石磊,张岳,裴云霞,古志民.基于Web对象流行度的PPM预测模型[J].小型微型计算机系统,2006,27(7):1378-1382. 被引量:9
  • 2PALPANAS T,MENDELZON A. Web Prefetching Using Partial Match Prediction Technical Report CSRG-376[R].Department of CS,University of Toronto,1998.
  • 3CLEARY J G,WITTEN I H. Data Compression Using Adaptive Coding and Partial String Matching[J].IEEE Transactions on Communications,1984,(04):396-402.
  • 4CROVELLA M,BARFORD P. The Network Effects of Prefetching[A].San Francisco CA,1998.1232-1240.
  • 5PITKOW J,PIROLLI P. Mining Longest Repeating Subsequences to Predict World Wide Web Surfing[A].Boulder,Colorado,USA,1999.139-150.
  • 6DONALD E K. The Art of Computer Programming:Sorting and Searching[M].USA:AddisonWesley,1973.
  • 7林文龙,刘业政,姜元春.Web浏览预测的Markov模型综述[J].计算机科学,2008,35(1):9-14. 被引量:7
  • 8石磊,李天亮,卫琳,石云.PAPPM:一种自适应Web预测模型[J].计算机应用与软件,2008,25(7):25-27. 被引量:1
  • 9刘建勋,王积鹏,吴浩.面向服务的构件开发方法研究[J].中国电子科学研究院学报,2009,4(5):446-451. 被引量:3

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部