• I/O-Efficient Techniques for C...

Treffer: I/O-Efficient Techniques for Computing Pagerank

Title:
I/O-Efficient Techniques for Computing Pagerank
Authors:
Yen-yu Chen, Qingqing Gan, Torsten Suel
Contributors:
The Pennsylvania State University CiteSeerX Archives
Source:
http://cis.poly.edu/~suel/papers/pagerank.pdf.
Collection:
CiteSeerX
Subject Terms:
search engines, out-of-core, external memory algorithms, link-based
Document Type:
Fachzeitschrift text
File Description:
application/pdf
Language:
English
Relation:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.2035; http://cis.poly.edu/~suel/papers/pagerank.pdf
Availability:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.2035
http://cis.poly.edu/~suel/papers/pagerank.pdf
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Accession Number:
edsbas.FF22C52D
Database:
BASE

Weitere Informationen

Over the last few years, most major search engines have integrated link-based ranking techniques in order to provide more accurate search results. One widely known approach is the Pagerank technique, which forms the basis of the Google ranking scheme, and which assigns a global importance measure to each page based on the importance of other pages pointing to it. The main advantage of the Pagerank measure is that it is independent of the query posed by a user