Packages

object MatchSet

A match set of vertex v is the set of all candidates of the target vertex matching triple patterns from basic graph pattern.

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

Type Members

  1. type candidates = Iterable[MatchCandidate]

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  6. def createCandidateGraph(graph: Graph[Node, Node], patterns: Broadcast[List[TriplePattern]]): Graph[candidates, Node]

    graph

    Input RDF graph.

    patterns

    Basic triple patterns

    returns

    A candidate graph whose vertex attribute is a set of match candidates for each vertex.

  7. def createCandidateVertices(graph: Graph[Node, Node], patterns: Broadcast[List[TriplePattern]]): RDD[(VertexId, candidates)]

    Create an RDD of vertices that set the vertex attributes as a set of match candidates.

    Create an RDD of vertices that set the vertex attributes as a set of match candidates.

    graph

    Input RDF graph

    patterns

    Basic triple patterns

    returns

    RDD for vertices. Each vertex has an attribute that is a set of match candidate for this vertex.

  8. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  9. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  10. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  11. def generateResultRDD(candidateGraph: Graph[candidates, Node], patterns: Broadcast[List[TriplePattern]], spark: SparkSession): RDD[Result[Node]]

    Produce this final results that match the triple patterns in RDF graph.

  12. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  13. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  14. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  15. def joinNeighbourCandidate(candidateGraph: Graph[candidates, Node]): Graph[(candidates, candidates), Node]

    Based on the candidate graph, for each vertex in graph, merging the candidates of its neighbours to a set and then add it to its vertex attribute.

    Based on the candidate graph, for each vertex in graph, merging the candidates of its neighbours to a set and then add it to its vertex attribute.

    candidateGraph

    Graph has messages of each vertex's match candidates.

    returns

    New graph that, for a vertex, contains both the candidates of its local match and neighbours'(call them remote candidates). The vertex attribute is a tuple2 that the first one is local candidates and the second one is remote candidates.

  16. def localMatch(candidateGraph: Graph[candidates, Node], patterns: Broadcast[List[TriplePattern]]): Graph[candidates, Node]

    Filter match candidates.

    Filter match candidates. If a match candidate (?var, mapping, pattern) for variable ?var in vertex v is local matched, it must have a match candidate regarding ?var for all triple patterns that contain ?var. Furthermore, the mappings of all these match candidates must be compatible. We will remove candidate that don't have local match from the attributes.

    candidateGraph

    A graph whose vertex attribute is a set of match candidates for a vertex v.

    patterns

    Basic triple patterns

    returns

    A graph whose vertex attributes a set of match candidates after removing those have no local match.

  17. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  18. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  19. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  20. def remoteMatch(mergedGraph: Graph[(candidates, candidates), Node]): Graph[candidates, Node]

    Filter match candidates.

    Filter match candidates. If a match candidate (?var, mapping, pattern) for variable ?var in vertex v is remote matched, it must have a match candidate regarding another ?var2(!= ?var, ?var2 in pattern) in the remote candidates. Furthermore, the mappings of all these match candidates must be compatible. We will remove candidate that don't have remote match from the attributes.

    mergedGraph

    A graph whose vertex attribute is a tuple of its local and remote candidates for a vertex v.

    returns

    A graph whose vertex attributes a set of match candidates after removing those have no local match.

  21. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  22. def toString(): String
    Definition Classes
    AnyRef → Any
  23. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  24. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  25. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()

Inherited from AnyRef

Inherited from Any

Ungrouped