×
  • Share
  • Email
  • Embed
  • Like
  • Save
  • Private Content
 

I/O-Efficient Techniques for Computing Pagerank

by on Jul 28, 2013

  • 114 views

Over the last few years, most major search engines have integrated link-based ranking techniques in order to provide ...

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; this means that it can be precomputed and then used to optimize the layout of the inverted index structure accordingly. However, computing the Pagerank measure requires implementing an iterative process on a massive graph corresponding to billions of web pages and hyperlinks.

Statistics

Views

Total Views
114
Views on SlideShare
114
Embed Views
0

Actions

Likes
0
Downloads
1
Comments
0

0 Embeds 0

No embeds

Accessibility

Categories

Upload Details

Uploaded via SlideShare as Microsoft PowerPoint

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
Post Comment
Edit your comment

I/O-Efficient Techniques for Computing Pagerank I/O-Efficient Techniques for Computing Pagerank Presentation Transcript