A data mining algorithm for generalized Web prefetching

Predictive Web prefetching refers to the mechanism of deducing the forthcoming page accesses of a client based on its past accesses. In this paper, we present a new context for the interpretation of Web prefetching algorithms as Markov predictors. We identify the factors that affect the performance...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on knowledge and data engineering Vol. 15; no. 5; pp. 1155 - 1169
Main Authors Nanopoulos, A., Katsaros, D., Manolopoulos, Y.
Format Journal Article
LanguageEnglish
Published New York IEEE 01.09.2003
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text
ISSN1041-4347
1558-2191
DOI10.1109/TKDE.2003.1232270

Cover

Abstract Predictive Web prefetching refers to the mechanism of deducing the forthcoming page accesses of a client based on its past accesses. In this paper, we present a new context for the interpretation of Web prefetching algorithms as Markov predictors. We identify the factors that affect the performance of Web prefetching algorithms. We propose a new algorithm called WM,,, which is based on data mining and is proven to be a generalization of existing ones. It was designed to address their specific limitations and its characteristics include all the above factors. It compares favorably with previously proposed algorithms. Further, the algorithm efficiently addresses the increased number of candidates. We present a detailed performance evaluation of WM, with synthetic and real data. The experimental results show that WM/sub o/ can provide significant improvements over previously proposed Web prefetching algorithms.
AbstractList Predictive Web prefetching refers to the mechanism of deducing the forthcoming page accesses of a client based on its past accesses. In this paper, we present a new context for the interpretation of Web prefetching algorithms as Markov predictors. We identify the factors that affect the performance of Web prefetching algorithms. We propose a new algorithm called WM,,, which is based on data mining and is proven to be a generalization of existing ones. It was designed to address their specific limitations and its characteristics include all the above factors. It compares favorably with previously proposed algorithms. Further, the algorithm efficiently addresses the increased number of candidates. We present a detailed performance evaluation of WM, with synthetic and real data. The experimental results show that WM sub(o) can provide significant improvements over previously proposed Web prefetching algorithms.
Predictive Web prefetching refers to the mechanism of deducing the forthcoming page accesses of a client based on its past accesses. In this paper, we present a new context for the interpretation of Web prefetching algorithms as Markov predictors. We identify the factors that affect the performance of Web prefetching algorithms. We propose a new algorithm called WM,,, which is based on data mining and is proven to be a generalization of existing ones. It was designed to address their specific limitations and its characteristics include all the above factors. It compares favorably with previously proposed algorithms. Further, the algorithm efficiently addresses the increased number of candidates. We present a detailed performance evaluation of WM, with synthetic and real data. The experimental results show that WM/o/ can provide significant improvements over previously proposed Web prefetching algorithms.
Author Nanopoulos, A.
Manolopoulos, Y.
Katsaros, D.
Author_xml – sequence: 1
  givenname: A.
  surname: Nanopoulos
  fullname: Nanopoulos, A.
  organization: Dept. of Informatics, Aristotle Univ. of Thessaloniki, Greece
– sequence: 2
  givenname: D.
  surname: Katsaros
  fullname: Katsaros, D.
  organization: Dept. of Informatics, Aristotle Univ. of Thessaloniki, Greece
– sequence: 3
  givenname: Y.
  surname: Manolopoulos
  fullname: Manolopoulos, Y.
  organization: Dept. of Informatics, Aristotle Univ. of Thessaloniki, Greece
BookMark eNqFkU1PwzAMhiMEEtvgByAuFQc4dThJ26THaYwPMYnLEMcoTd0tU9eMtDvArydjk5B2GBfbkp_Xlv32yWnjGiTkisKQUsjvZ68PkyED4EPKOGMCTkiPpqmMGc3paaghoXHCE3FO-m27BAApJO0RMYpK3eloZRvbzCNdz5233WIVVc5Hc2zQ69p-Yxl9YBGtPVbYmUUgL8hZpesWL_d5QN4fJ7Pxczx9e3oZj6ax4TLp4oobqTFDUVYgk7JKoCogFwxykFhSwQteslQC15oXaExRBkIkRpgUMo3IB-RuN3ft3ecG206tbGuwrnWDbtOqHKigwHIeyNujJMsZZCH8D0qWMSlFAG8OwKXb-Cacq3LGEgb8dy3dQca7tg0PUmtvV9p_KQpqa43aWqO21qi9NUEjDjTGdrqzrum8tvVR5fVOaRHxb9O--wMB6Jvr
CODEN ITKEEH
CitedBy_id crossref_primary_10_1016_j_comcom_2013_02_005
crossref_primary_10_1155_2014_156083
crossref_primary_10_1145_2248487_2150978
crossref_primary_10_1109_ACCESS_2020_2966399
crossref_primary_10_1016_j_comcom_2010_09_014
crossref_primary_10_1145_1644873_1644878
crossref_primary_10_1145_2189750_2150978
crossref_primary_10_14778_3407790_3407826
crossref_primary_10_4304_jsw_6_9_1829_1836
crossref_primary_10_1007_s00500_007_0190_y
crossref_primary_10_1145_1961295_1950387
crossref_primary_10_4018_IJWSR_299020
crossref_primary_10_1108_07378830510636364
crossref_primary_10_4236_ijcns_2015_85019
crossref_primary_10_1007_s11280_007_0027_8
crossref_primary_10_1016_j_infsof_2004_06_006
crossref_primary_10_4236_ijcns_2015_85018
crossref_primary_10_1007_s10844_010_0138_z
crossref_primary_10_1007_s10586_013_0304_5
crossref_primary_10_1016_j_peva_2020_102149
crossref_primary_10_1109_MIC_2004_1297272
crossref_primary_10_1109_TKDE_2008_92
crossref_primary_10_1109_TVCG_2008_174
crossref_primary_10_1145_1961296_1950387
crossref_primary_10_1142_S0218194023500365
crossref_primary_10_1016_j_datak_2004_08_001
crossref_primary_10_1080_08839514_2021_1998299
crossref_primary_10_1145_3149374
crossref_primary_10_3724_SP_J_1087_2008_00553
crossref_primary_10_1016_j_comnet_2009_11_016
crossref_primary_10_14778_2350229_2350267
crossref_primary_10_1007_s10586_017_1560_6
crossref_primary_10_1016_j_comcom_2007_05_003
crossref_primary_10_1109_SURV_2011_092311_00071
crossref_primary_10_1016_j_datak_2004_09_004
crossref_primary_10_1016_j_future_2021_03_004
crossref_primary_10_4018_jdst_2012040102
crossref_primary_10_1016_j_eswa_2012_01_140
crossref_primary_10_3923_jas_2006_3122_3127
Cites_doi 10.1109/12.675713
10.1016/S1389-1286(00)00044-X
10.1007/s007780050082
10.1109/INFCOM.1998.662937
10.1145/170035.170077
10.1007/BF03325089
10.1109/69.790809
10.1109/GLOCOM.1996.586110
10.1109/ICDE.1995.380415
10.1145/224056.224064
10.1007/3-540-44472-6_17
10.1109/69.755618
10.1023/A:1009748302351
10.1016/S0169-023X(01)00008-8
10.1007/978-1-4471-1283-9_23
10.1109/PDIS.1996.568672
10.1145/354756.354859
10.1126/science.280.5360.95
10.1145/277851.277897
10.1145/285237.285286
10.1007/3-540-45571-X_47
10.1145/301453.301557
10.1007/s007780050083
10.1109/69.790804
10.1109/69.683753
10.1007/3-540-44934-5_7
10.1109/MASCOT.2000.876426
10.1145/235160.235164
10.1137/1.9781611972719.4
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2003
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2003
DBID RIA
RIE
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
7TB
FR3
F28
DOI 10.1109/TKDE.2003.1232270
DatabaseName IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
Mechanical & Transportation Engineering Abstracts
Engineering Research Database
ANTE: Abstracts in New Technology & Engineering
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
Mechanical & Transportation Engineering Abstracts
Engineering Research Database
ANTE: Abstracts in New Technology & Engineering
DatabaseTitleList Technology Research Database
Technology Research Database
Computer and Information Systems Abstracts

Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Xplore Digital Libary (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
EISSN 1558-2191
EndPage 1169
ExternalDocumentID 2591241071
10_1109_TKDE_2003_1232270
1232270
GroupedDBID -~X
.DC
0R~
1OL
29I
4.4
5GY
5VS
6IK
97E
9M8
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABFSI
ABQJQ
ABVLG
ACGFO
ACIWK
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ASUFR
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
E.L
EBS
EJD
F5P
HZ~
H~9
ICLAB
IEDLZ
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
MS~
O9-
OCL
P2P
PQQKQ
RIA
RIE
RNI
RNS
RXW
RZB
TAE
TAF
TN5
UHB
VH1
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
RIG
7TB
FR3
F28
ID FETCH-LOGICAL-c384t-f3c8ae6e7df084df40fb09720908ed173b3d25803aa3beccbd40f74c7c506aee3
IEDL.DBID RIE
ISSN 1041-4347
IngestDate Sun Sep 28 11:53:13 EDT 2025
Thu Oct 02 05:23:02 EDT 2025
Sat Sep 27 21:46:41 EDT 2025
Fri Jul 25 06:07:57 EDT 2025
Thu Apr 24 22:57:29 EDT 2025
Wed Oct 01 06:41:12 EDT 2025
Wed Aug 27 02:52:16 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 5
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c384t-f3c8ae6e7df084df40fb09720908ed173b3d25803aa3beccbd40f74c7c506aee3
Notes ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
PQID 922420393
PQPubID 23500
PageCount 15
ParticipantIDs ieee_primary_1232270
proquest_miscellaneous_28262887
proquest_miscellaneous_29206292
crossref_citationtrail_10_1109_TKDE_2003_1232270
proquest_miscellaneous_901710293
crossref_primary_10_1109_TKDE_2003_1232270
proquest_journals_922420393
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2003-09-01
PublicationDateYYYYMMDD 2003-09-01
PublicationDate_xml – month: 09
  year: 2003
  text: 2003-09-01
  day: 01
PublicationDecade 2000
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE transactions on knowledge and data engineering
PublicationTitleAbbrev TKDE
PublicationYear 2003
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref13
ref12
ref15
ref37
ref14
ref36
ref31
ref30
ref11
ref33
ref32
ref1
ref17
ref16
ref38
ref19
Atzeni (ref2)
Palpanas (ref34)
Duchamp (ref18)
Griffioen (ref21)
ref24
ref23
ref26
ref20
ref22
ref28
Bestavros (ref7)
ref27
Agrawal (ref3)
ref29
ref8
Cao (ref10)
ref9
ref4
ref6
ref5
Pitkow (ref35)
Kroeger (ref25)
References_xml – ident: ref13
  doi: 10.1109/12.675713
– ident: ref36
  doi: 10.1016/S1389-1286(00)00044-X
– ident: ref20
  doi: 10.1007/s007780050082
– ident: ref9
  doi: 10.1109/INFCOM.1998.662937
– ident: ref12
  doi: 10.1145/170035.170077
– ident: ref14
  doi: 10.1007/BF03325089
– ident: ref24
  doi: 10.1109/69.790809
– ident: ref38
  doi: 10.1109/GLOCOM.1996.586110
– ident: ref4
  doi: 10.1109/ICDE.1995.380415
– ident: ref32
  doi: 10.1145/224056.224064
– ident: ref29
  doi: 10.1007/3-540-44472-6_17
– ident: ref5
  doi: 10.1109/69.755618
– ident: ref28
  doi: 10.1023/A:1009748302351
– ident: ref30
  doi: 10.1016/S0169-023X(01)00008-8
– ident: ref16
  doi: 10.1007/978-1-4471-1283-9_23
– ident: ref1
  doi: 10.1109/PDIS.1996.568672
– volume-title: Proc. Fourth Web Caching Workshop (WCW ’99)
  ident: ref34
  article-title: Web Prefetching Using Partial Match Prediction
– start-page: 206
  volume-title: Proc. 23rd Conf. Very Large Data Bases (VLDB ’97)
  ident: ref2
  article-title: To Weave the Web
– start-page: 193
  volume-title: Proc. 1997 USENIX Symp. Internet Technologies and Systems (USITS ’97)
  ident: ref10
  article-title: Cost-Aware WWW Proxy Caching Algorithms
– start-page: 197
  volume-title: Proc. 1994 USENIX Ann. Technical Conf. (USENIX ’95)
  ident: ref21
  article-title: Reducing File System Latency Using a Predictive Approach
– start-page: 13
  volume-title: Proc. USENIX Symp. Internet Technologies and Systems (USITS ’97)
  ident: ref25
  article-title: Exploring the Bounds of Web Latency Reduction from Caching and Prefetching
– start-page: 487
  volume-title: Proc. 20th Conf. Very Large Data Bases (VLDB ’94)
  ident: ref3
  article-title: Fast Algorithms for Mining Association Rules
– ident: ref27
  doi: 10.1145/354756.354859
– ident: ref22
  doi: 10.1126/science.280.5360.95
– ident: ref6
  doi: 10.1145/277851.277897
– ident: ref11
  doi: 10.1145/285237.285286
– volume-title: Proc. USENIX Symp. Internet Technologies and Systems (USITS ’99)
  ident: ref18
  article-title: Prefetching Hyperlinks
– ident: ref31
  doi: 10.1007/3-540-45571-X_47
– ident: ref19
  doi: 10.1145/301453.301557
– ident: ref8
  doi: 10.1007/s007780050083
– ident: ref37
  doi: 10.1109/69.790804
– ident: ref15
  doi: 10.1109/69.683753
– ident: ref26
  doi: 10.1007/3-540-44934-5_7
– start-page: 180
  volume-title: Proc. IEEE Conf. Data Eng. (IEEE ICDE ’96)
  ident: ref7
  article-title: Speculative Data Dissemination and Service to Reduce Server Load, Network Traffic and Service Time
– ident: ref23
  doi: 10.1109/MASCOT.2000.876426
– ident: ref33
  doi: 10.1145/235160.235164
– ident: ref17
  doi: 10.1137/1.9781611972719.4
– volume-title: Proc. USENIX Symp. Internet Technologies and Systems (USITS ’99)
  ident: ref35
  article-title: Mining Longest Repeating Subsequences to Predict World Wide Web Surfing
SSID ssj0008781
Score 2.123463
Snippet Predictive Web prefetching refers to the mechanism of deducing the forthcoming page accesses of a client based on its past accesses. In this paper, we present...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 1155
SubjectTerms Algorithms
Bandwidth
Communication system traffic control
Computer Society
Costs
Data mining
Internet
Markov processes
Network servers
Performance evaluation
Prefetching
Propagation delay
Shape control
Title A data mining algorithm for generalized Web prefetching
URI https://ieeexplore.ieee.org/document/1232270
https://www.proquest.com/docview/922420393
https://www.proquest.com/docview/28262887
https://www.proquest.com/docview/29206292
https://www.proquest.com/docview/901710293
Volume 15
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Xplore Digital Libary (IEL)
  customDbUrl:
  eissn: 1558-2191
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0008781
  issn: 1041-4347
  databaseCode: RIE
  dateStart: 19890101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LT9wwEB5RTuVQXkXdQsGHnlCzeGNvbB8RBaFW9AQqt8h2JhQVdhFkL_x6Zpxk20JBXKIomVgjv2YmM_4-gM9ORwo0pMxQWZ9pdCFzKurM0_SSsSaLHDije_KjOD7T387H5wvwZX4WBhFT8RkO-Tbl8qtpnPGvsj02_7mhAP2NsUV7Vmu-61qTCEkpuqCYSGnTZTBH0u2dfv96mJA_h10D_9igRKryZCdO5uVoGU56xdqqkt_DWROG8f4RZuNrNV-Bd52fKfbbibEKCzhZg-Wew0F0S3oNlv4CJFwHsy-4ZFRcJ9oI4a8upreXza9rQa6tuGgRqi_vsRI_MYgbpihpUi3mezg7Ojw9OM46aoUsKqubrFbReizQVLW0uqq1rAMD-UgnLVYjo4Kq8rGVynvFoxwqkjA6mjiWhUdUG7A4mU7wA4jA4I-BTJwkIWrAWx0KV4xq2hqq3OAAZN_ZZexwx5n-4qpM8Yd0JY8P02GqsuumAezOP7lpQTdeEl7n_v4j2D_e7Ee07JblXenIYcn5NPIAduZvaT1xksRPcDq7KykEZQZm84KEy2VBlwGIZyQcgxBJcqQ-_l-3TXibagJTqdoWLDa3M_xEvk0TttOkfgBJ0POY
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3fT9RAEJ4QfFAfREHjicI--GTssdfddruPRCGHcDwdkbdmdzsFItwR6L3w1zuzbU9RJL40TTvdTPbXzHRmvw_go9WBAg0pE1SFSzRan1gVdOJoeslQk0X2nNGdHOfjE_3tNDtdgc_LszCIGIvPcMi3MZdfzcOCf5XtsPlPDQXoTzKtddae1lruu4WJlKQUX1BUpLTpcpgjaXemh1_3IvbnsGvinhWKtCp_7cXRwOyvwaRXra0r-TFcNH4Y7v5Abfxf3V_Ci87TFLvt1HgFKzhbh7WexUF0i3odnv8GSbgBZldw0ai4isQRwl2ezW8umvMrQc6tOGsxqi_usBLf0YtrJilpYjXmazjZ35t-GScduUISVKGbpFahcJijqWpZ6KrWsvYM5SOtLLAaGeVVlWaFVM4pHmdfkYTRwYRM5g5RvYHV2XyGb0F4hn_0ZOQkCVEDrtA-t_mops2hSg0OQPadXYYOeZwJMC7LGIFIW_L4MCGmKrtuGsCn5SfXLezGY8Ib3N-_BPvHm_2Ilt3CvC0tuSwpn0cewPbyLa0oTpO4Gc4XtyUFoczBbB6RsKnM6TIA8Q8JyzBEklypdw_rtg1Px9PJUXl0cHy4Cc9ihWAsXHsPq83NAj-Qp9P4rTjBfwIuufbl
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+data+mining+algorithm+for+generalized+Web+prefetching&rft.jtitle=IEEE+transactions+on+knowledge+and+data+engineering&rft.au=Nanopoulos%2C+A&rft.au=Katsaros%2C+D&rft.au=Manolopoulos%2C+Y&rft.date=2003-09-01&rft.issn=1041-4347&rft.volume=15&rft.issue=5&rft.spage=1155&rft.epage=1169&rft_id=info:doi/10.1109%2FTKDE.2003.1232270&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1041-4347&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1041-4347&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1041-4347&client=summon