Object

net.sansa_stack.rdf.spark.model.graph

GraphOps

Related Doc: package graph

Permalink

object GraphOps

Spark/GraphX based implementation of RDD[Triple].

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. GraphOps
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. type SPMap = Map[VertexId, Int]

    Permalink

    Stores a map from the vertex id of a landmark to the distance to that landmark.

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  5. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  6. def constructGraph(triples: RDD[Triple]): Graph[Node, Node]

    Permalink

    Constructs GraphX graph from RDD of triples

    Constructs GraphX graph from RDD of triples

    triples

    rdd of triples

    returns

    object of GraphX which contains the constructed graph.

  7. def constructHashedGraph(triples: RDD[Triple]): Graph[Node, Node]

    Permalink

    Constructs Hashed GraphX graph from RDD of triples

    Constructs Hashed GraphX graph from RDD of triples

    triples

    rdd of triples

    returns

    object of GraphX which contains the constructed hashed graph.

  8. def constructStringGraph(triples: RDD[Triple]): Graph[String, String]

    Permalink

    Constructs String GraphX graph from RDD of triples

    Constructs String GraphX graph from RDD of triples

    triples

    rdd of triples

    returns

    object of GraphX which contains the constructed string graph.

  9. def difference(graph: Graph[Node, Node], other: Graph[Node, Node]): Graph[Node, Node]

    Permalink

    Returns a new RDF graph that contains the difference between the current RDF graph and the given RDF graph.

    Returns a new RDF graph that contains the difference between the current RDF graph and the given RDF graph.

    graph

    the RDF graph

    other

    the other RDF graph

    returns

    the difference of both RDF graphs

  10. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  11. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  12. def filterObjects(graph: Graph[Node, Node], func: (Node) ⇒ Boolean): Graph[Node, Node]

    Permalink

    Filter out the objects from a given graph, based on a specific function @func .

    Filter out the objects from a given graph, based on a specific function @func .

    graph

    one instance of the given graph

    func

    a partial funtion.

    returns

    Node] a subset of the given graph.

  13. def filterPredicates(graph: Graph[Node, Node], func: (Node) ⇒ Boolean): Graph[Node, Node]

    Permalink

    Filter out the predicates from a given graph, based on a specific function @func .

    Filter out the predicates from a given graph, based on a specific function @func .

    graph

    one instance of the given graph

    func

    a partial funtion.

    returns

    Node] a subset of the given graph.

  14. def filterSubjects(graph: Graph[Node, Node], func: (Node) ⇒ Boolean): Graph[Node, Node]

    Permalink

    Filter out the subject from a given graph, based on a specific function @func .

    Filter out the subject from a given graph, based on a specific function @func .

    graph

    one instance of the given graph

    func

    a partial funtion.

    returns

    Node] a subset of the given graph.

  15. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  16. def find(graph: Graph[Node, Node], subject: Node, predicate: Node, object: Node): Graph[Node, Node]

    Permalink

    Finds triplets of a given graph.

    Finds triplets of a given graph.

    graph

    one instance of the given graph

    returns

    graph which contains subset of the reduced graph.

  17. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  18. def getObjects(graph: Graph[Node, Node]): RDD[Node]

    Permalink

    Get objects from a given graph.

    Get objects from a given graph.

    graph

    one instance of the given graph

    returns

    RDD[Node] which contains list of the objects.

  19. def getPredicates(graph: Graph[Node, Node]): RDD[Node]

    Permalink

    Get predicates from a given graph.

    Get predicates from a given graph.

    graph

    one instance of the given graph

    returns

    RDD[Node] which contains list of the predicates.

  20. def getSubjects(graph: Graph[Node, Node]): RDD[Node]

    Permalink

    Get subjects from a given graph.

    Get subjects from a given graph.

    graph

    one instance of the given graph

    returns

    RDD[Node] which contains list of the subjects.

  21. def getTriples(graph: Graph[Node, Node]): RDD[Triple]

    Permalink

    Get triples of a given graph.

    Get triples of a given graph.

    graph

    one instance of the given graph

    returns

    RDD[Triple] which contains list of the graph triples.

  22. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  23. def hierarcyDepth(graph: Graph[Node, Node]): Graph[(VertexId, Int, Node), Node]

    Permalink

    Returns the lever at which vertex stands in the hierarchy.

    Returns the lever at which vertex stands in the hierarchy.

    graph

    the RDF graph

  24. def intersection(graph: Graph[Node, Node], other: Graph[Node, Node]): Graph[Node, Node]

    Permalink

    Returns a new RDF graph that contains the intersection of the current RDF graph with the given RDF graph.

    Returns a new RDF graph that contains the intersection of the current RDF graph with the given RDF graph.

    graph

    the RDF graph

    other

    the other RDF graph

    returns

    the intersection of both RDF graphs

  25. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  26. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  27. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  28. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  29. def saveGraphToJson(graph: Graph[_, _], output: String): Unit

    Permalink

    Save the Graph to JSON format

    Save the Graph to JSON format

    graph

    the Graph representation of triples

    output

    the output

  30. def shortestPaths[VD, ED](graph: Graph[VD, ED], landmarks: Seq[VertexId])(implicit arg0: ClassTag[ED]): Graph[SPMap, ED]

    Permalink

    Computes shortest paths to the given set of landmark vertices.

    Computes shortest paths to the given set of landmark vertices.

    ED

    the edge attribute type (not used in the computation)

    graph

    the graph for which to compute the shortest paths

    landmarks

    the list of landmark vertex ids. Shortest paths will be computed to each landmark.

    returns

    a graph where each vertex attribute is a map containing the shortest-path distance to each reachable landmark vertex.

  31. def size(graph: Graph[Node, Node]): Long

    Permalink

    Compute the size of the graph

    Compute the size of the graph

    returns

    the number of edges in the graph.

  32. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef

  33. def toDF(graph: Graph[Node, Node]): DataFrame

    Permalink

    Convert a graph into a DataFrame.

    Convert a graph into a DataFrame.

    graph

    GraphX graph of triples.

    returns

    a DataFrame of triples.

  34. def toDS(graph: Graph[Node, Node]): Dataset[Triple]

    Permalink

    Convert a graph into a Dataset of Triple.

    Convert a graph into a Dataset of Triple.

    graph

    GraphX graph of triples.

    returns

    a Dataset of triples.

  35. def toGraphJson(graph: Graph[_, _]): String

    Permalink

  36. def toRDD(graph: Graph[Node, Node]): RDD[Triple]

    Permalink

    Convert a graph into a RDD of Triple.

    Convert a graph into a RDD of Triple.

    graph

    GraphX graph of triples.

    returns

    a RDD of triples.

  37. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  38. def union(graph: Graph[Node, Node], other: Graph[Node, Node]): Graph[Node, Node]

    Permalink

    Return the union of this graph and another one.

    Return the union of this graph and another one.

    graph

    of the graph

    other

    of the other graph

    returns

    graph (union of all)

  39. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  40. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  41. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped