期刊名称：International Journal of Advanced Research In Computer Science and Software Engineering
印刷版ISSN：2277-6451
电子版ISSN：2277-128X
出版年度：2012
卷号：2
期号：4
出版社：S.S. Mishra
摘要：We b pre-fetchin g is mech anism by which we b server/clients can pre -fetch web page s wel l in advan ce before a re ques t is actual ly re ceive d by a se rver or send by a clien t. Th e idea is, give a re ques t, how accurately can you pre dict th e ne xt consequent reque st. This paper is about designing and i mple men ting a pre -fetch ing model in the form of a Mark ov model and associati on ru le minin g. The Markov property states that, given th e cu rren t state, fu ture states are in depe nden t of the pas t states. The Web prefetching strategy also proposed associati on rule mining algorithm to discover the prefetched docu ments. It discovers depe nde ncies betwe en pairs of docume nts. A web server can cache the most probable next requ est re duci ng th e time t aken to re spon d to a request considerably th at helps us to make up the web latency that we face on th e Interne t today.The vigilant implementation of these methods
关键词：Web minin g; Associ ation Rule; Pre fetchin g; Data mining
