Page Rank

Description, inputs and outputs of the Page Rank algorithm

URI

<http://cray.com/graphAlgorithm.pagerank>

Description

Page Rank can be used to measure the relative importance of a vertex in a graph.

Inputs and Default Values

Outputs

Page Rank produces a two-column intermediate result that can be thought of as a set of pairs. The first item in each pair is the identifier of a vertex, whereas the second is the double-precision Page Rank value of the vertex.

Example: Page Rank

The following example selects all of the edges from the default graph and calls S-T Set Connectivity on the resulting graph.

PREFIX cray: <http://cray.com/>

  SELECT ?vertices ?pagerank
  WHERE {
    CONSTRUCT{
      ?sub ?pred ?obj .
    }
    WHERE{
      { ?sub ?pred ?obj . }
    }
    INVOKE cray:graphAlgorithm.pagerank(0.0005,0.85)
    PRODUCING ?vertices ?pagerank
  }
  ORDER BY DESC(?pagerank)