Examples of org.apache.flink.test.recordJobs.graph.EnumTrianglesRdfFoaf

org.apache.flink.test.recordJobs.graph.EnumTrianglesRdfFoaf

Implementation of the triangle enumeration example Pact program. The program expects a file with RDF triples (in XML serialization) as input. Triples must be separated by linebrakes. The program filters for foaf:knows predicates to identify relationships between two entities (typically persons). Relationships are interpreted as edges in a social graph. Then the program enumerates all triangles which are build by edges in that graph. Usually, triangle enumeration is used as a pre-processing step to identify highly connected subgraphs. The algorithm was published as MapReduce job by J. Cohen in "Graph Twiddling in a MapReduce World". The Pact version was described in "MapReduce and PACT - Comparing Data Parallel Programming Models" (BTW 2011).

    resultPath = getTempDirPath("triangles");
  }


  @Override
  protected Plan getTestJob() {
    EnumTrianglesRdfFoaf enumTriangles = new EnumTrianglesRdfFoaf();
    return enumTriangles.getPlan(
        String.valueOf(config.getInteger("NumSubtasks", DOP)), edgesPath, resultPath);
  }

Examples of org.apache.flink.test.recordJobs.graph.EnumTrianglesRdfFoaf

Related Classes of org.apache.flink.test.recordJobs.graph.EnumTrianglesRdfFoaf