Department of Computer Engineering
S E M I N A R
Accelerating the PageRank Algorithm
Gokce Nil Noyan
Many search engines use a two-step process to retrieve pages related to a users query. In the first step, traditional text processing is performed to find all documents matching the query terms. With the massive size of the Web, this step can result in thousands of retrieved pages in response to a query. To make this list manageable for a user, in the second step, many search engines sort this list by some ranking criterion. One popular way to create this ranking is to exploit additional information inherent in the Web due to its hyperlinking structure. One successful and well publicized link-based ranking system is PageRank, the ranking system used by the Google search engine. Since the PageRank vector must be as dynamic as the Web, it is important to be able to compute this vector as fast as possible. In this talk, we discuss our ongoing research on accelerating the PageRank algorithm which will enable the updating of the PageRank vector more frequently.
DATE: November28, 2005, Monday@ 16:40
PLACE: EA 409