I/O-Efficient Techniques for Computing Pagerank
Cached
Download Links
- [cis.poly.edu]
- [cis.poly.edu]
- [cis.poly.edu]
- [cis.poly.edu]
- DBLP
Other Repositories/Bibliography
by
Yen-yu Chen
,
Qingqing Gan
,
Torsten Suel
| Citations: | 23 - 3 self |
BibTeX
@MISC{Chen_i/o-efficienttechniques,
author = {Yen-yu Chen and Qingqing Gan and Torsten Suel},
title = {I/O-Efficient Techniques for Computing Pagerank},
year = {}
}
OpenURL
Abstract
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







