File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A note on the paper: Optimizing web servers using page rank prefetching for clustered accesses

TitleA note on the paper: Optimizing web servers using page rank prefetching for clustered accesses
Authors
Ching, WK
KeywordsPage rank algorithm
Issue Date2005
PublisherElsevier Inc. The Journal's web site is located at http://www.elsevier.com/locate/ins
Citation
Information Sciences, 2005, v. 169 n. 3-4, p. 245-247 How to Cite?
DOI: http://dx.doi.org/10.1016/j.ins.2004.06.005
AbstractThe page rank algorithm used for ranking importance of web pages by Google is discussed. Some efficient adaptive power methods are developed recently for computation of page rank. Safronov and parashar proposed to use page rank as a prefetching technique for access to web-page clusters. The effectiveness of the method is proved by presenting examples.
Persistent Identifierhttp://hdl.handle.net/10722/75317
ISSN
0020-0255
2022 Impact Factor: 8.1
2023 SCImago Journal Rankings: 2.238
ISI Accession Number ID
WOS:000226787600004
References
References in Scopus

 

DC FieldValueLanguage
dc.contributor.authorChing, WKen_HK
dc.date.accessioned2010-09-06T07:09:59Z-
dc.date.available2010-09-06T07:09:59Z-
dc.date.issued2005en_HK
dc.identifier.citationInformation Sciences, 2005, v. 169 n. 3-4, p. 245-247en_HK
dc.identifier.issn0020-0255en_HK
dc.identifier.urihttp://hdl.handle.net/10722/75317-
dc.description.abstractThe page rank algorithm used for ranking importance of web pages by Google is discussed. Some efficient adaptive power methods are developed recently for computation of page rank. Safronov and parashar proposed to use page rank as a prefetching technique for access to web-page clusters. The effectiveness of the method is proved by presenting examples.en_HK
dc.languageengen_HK
dc.publisherElsevier Inc. The Journal's web site is located at http://www.elsevier.com/locate/insen_HK
dc.relation.ispartofInformation Sciencesen_HK
dc.rightsInformation Sciences. Copyright © Elsevier Inc.en_HK
dc.subjectPage rank algorithmen_HK
dc.titleA note on the paper: Optimizing web servers using page rank prefetching for clustered accessesen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0020-0255&volume=169 no3-4&spage=245&epage=247&date=2005&atitle=A+Note+on+the+Paper:+Optimizing+Web+Servers+Using+Page+Rank+Prefetching+for+Clustered+Accessesen_HK
dc.identifier.emailChing, WK:wching@hku.hken_HK
dc.identifier.authorityChing, WK=rp00679en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1016/j.ins.2004.06.005en_HK
dc.identifier.scopuseid_2-s2.0-11344291600en_HK
dc.identifier.hkuros97993en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-11344291600&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume169en_HK
dc.identifier.issue3-4en_HK
dc.identifier.spage245en_HK
dc.identifier.epage247en_HK
dc.identifier.isiWOS:000226787600004-
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridChing, WK=13310265500en_HK
dc.identifier.issnl0020-0255-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats