Scribd Logo
Upload

Welcome to Scribd!

  • 4 How Google Works: 4.1 Cluster Architecture

    Uploaded by

    Muna El Magboul
    16 views19 pages
    The document discusses how Google works using a cluster architecture and the PageRank algorithm. It describes the cluster architecture that Google uses to distribute search queries and results across many servers. It then explains the PageRank algorithm, which assigns a numerical weighting to each element of a hyperlinked set of documents, such as the World Wide Web, with the purpose of "measuring" its relative importance within the set. It provides an exercise asking the reader to calculate transition matrices, personalization vectors, and iterations of PageRank for sample graphs.

    Original Description:

    Original Title

    wk05

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses how Google works using a cluster architecture and the PageRank algorithm. It describes the cluster architecture that Google uses to distribute search queries and results across many servers. It then explains the PageRank algorithm, which assigns a numerical weighting to each element of a hyperlinked set of documents, such as the World Wide Web, with the purpose of "measuring" its relative importance within the set. It provides an exercise asking the reader to calculate transition matrices, personalization vectors, and iterations of PageRank for sample graphs.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    16 views19 pages

    4 How Google Works: 4.1 Cluster Architecture

    Uploaded by

    Muna El Magboul
    The document discusses how Google works using a cluster architecture and the PageRank algorithm. It describes the cluster architecture that Google uses to distribute search queries and results across many servers. It then explains the PageRank algorithm, which assigns a numerical weighting to each element of a hyperlinked set of documents, such as the World Wide Web, with the purpose of "measuring" its relative importance within the set. It provides an exercise asking the reader to calculate transition matrices, personalization vectors, and iterations of PageRank for sample graphs.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 19

    4 How google works

    4.1 Cluster architecture


    The slides were adapted from Jaremy Bradley; used with permission.

    33
    34
    35
    36
    37
    38
    39
    4.2 The pagerank algorithm

    40
    41
    42
    43
    44
    45
    46
    47
    48
    49
    50
    Exercise

    Graphs G1 and G2 represent a set of connected web pages. Taking c = 0.8 write down for each
    graph

    • the transition matrix P

    • the personalisation vector p~

    • the modified transition matrix A

    • two iterations ~x(k+1) = xk A starting with x0 = (0, 1, 0) for G1 and x0 = (1, 0, 0, 0) for G2 .

    • two iterations of the PageRank algorithm for comparison

    51

    You might also like