Class

net.sansa_stack.inference.spark.forwardchaining.triples

TransitiveReasoner

Related Doc: package triples

Permalink

class TransitiveReasoner extends ForwardRuleReasoner

An engine to compute the transitive closure (TC) for a set of triples given in several datastructures.

Linear Supertypes
ForwardRuleReasoner, Profiler, Logging, AnyRef, Any
Known Subclasses
AbstractForwardRuleReasonerRDFS, ForwardRuleReasonerEL, ForwardRuleReasonerOWLHorst, ForwardRuleReasonerRDFS, ForwardRuleReasonerRDFSDataframe
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. TransitiveReasoner
  2. ForwardRuleReasoner
  3. Profiler
  4. Logging
  5. AnyRef
  6. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new TransitiveReasoner(sc: SparkContext, parallelism: Int)

    Permalink

  2. new TransitiveReasoner(sc: SparkContext, property: Node, parallelism: Int)

    Permalink

  3. new TransitiveReasoner(sc: SparkContext, properties: Seq[Node], parallelism: Int)

    Permalink

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. def addTransitivePairs[A, B](s: Set[(A, B)]): Set[(A, B)]

    Permalink

  5. def apply(graph: RDFGraph): RDFGraph

    Permalink

    Applies forward chaining to the given RDF graph and returns a new RDF graph that contains all additional triples based on the underlying set of rules.

    Applies forward chaining to the given RDF graph and returns a new RDF graph that contains all additional triples based on the underlying set of rules.

    graph

    the RDF graph

    returns

    the materialized RDF graph

    Definition Classes
    TransitiveReasoner → ForwardRuleReasoner

  6. def apply(triples: RDD[Triple]): RDD[Triple]

    Permalink

    Applies forward chaining to the given RDD of RDF triples and returns a new RDD of RDF triples that contains all additional triples based on the underlying set of rules.

    Applies forward chaining to the given RDD of RDF triples and returns a new RDD of RDF triples that contains all additional triples based on the underlying set of rules.

    triples

    the RDF triples

    returns

    the materialized set of RDF triples

    Definition Classes
    ForwardRuleReasoner

  7. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  8. def clone(): AnyRef

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

  9. def computeTransitiveClosure(edges: Dataset[Triple]): Dataset[Triple]

    Permalink

    Computes the transitive closure for a Dataframe of triples

    Computes the transitive closure for a Dataframe of triples

    edges

    the Dataframe of triples

    returns

    a Dataframe containing the transitive closure of the triples

  10. def computeTransitiveClosure[A](edges: RDD[(A, A)])(implicit arg0: ClassTag[A]): RDD[(A, A)]

    Permalink

    Computes the transitive closure for an RDD of tuples

    Computes the transitive closure for an RDD of tuples

    edges

    the RDD of tuples

    returns

    an RDD containing the transitive closure of the tuples

  11. def computeTransitiveClosure(triples: RDD[Triple], predicate: Node): RDD[Triple]

    Permalink

    Computes the transitive closure for the given predicate on an RDD of triples.

    Computes the transitive closure for the given predicate on an RDD of triples.

    triples

    the RDD of triples

    predicate

    the predicate

    returns

    an RDD containing the transitive closure of the triples

  12. def computeTransitiveClosure(triples: RDD[Triple]): RDD[Triple]

    Permalink

    Computes the transitive closure on an RDD of triples.

    Computes the transitive closure on an RDD of triples. Note, that the assumption is that all triples do have the same predicate.

    triples

    the RDD of triples

    returns

    an RDD containing the transitive closure of the triples

  13. def computeTransitiveClosure(triples: Set[Triple]): Set[Triple]

    Permalink

    Computes the transitive closure on a set of triples, i.e.

    Computes the transitive closure on a set of triples, i.e. it is computed in-memory by the driver. Note, that the assumption is that all triples do have the same predicate.

    triples

    the set of triples

    returns

    a set containing the transitive closure of the triples

  14. def computeTransitiveClosurePairs[A, B](s: Set[(A, B)]): Set[(A, B)]

    Permalink

  15. def computeTransitiveClosureSemiNaive[A](edges: RDD[(A, A)])(implicit arg0: ClassTag[A]): RDD[(A, A)]

    Permalink

    Semi-naive computation of the transitive closure T for an RDD of tuples R=(x,y).

    Semi-naive computation of the transitive closure T for an RDD of tuples R=(x,y).

    (1) T = R
(2) ∆T = R
(3) while ∆T != ∅ do
(4) ∆T = ∆T ◦ R − T
(5) T = T ∪ ∆T
(6) end
    edges

    the RDD of tuples (x,y)

    returns

    an RDD containing the transitive closure of the tuples

  16. def debug(msg: ⇒ String, o: Any, os: Any*): Unit

    Permalink
    Definition Classes
    Logging

  17. def debug(msg: ⇒ String, e: Throwable): Unit

    Permalink
    Definition Classes
    Logging

  18. def debug(msg: ⇒ String): Unit

    Permalink
    Definition Classes
    Logging

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

    Permalink
    Definition Classes
    AnyRef

  20. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  21. def error(msg: ⇒ String, o: Any, os: Any*): Unit

    Permalink
    Definition Classes
    Logging

  22. def error(msg: ⇒ String, e: Throwable): Unit

    Permalink
    Definition Classes
    Logging

  23. def error(msg: ⇒ String): Unit

    Permalink
    Definition Classes
    Logging

  24. def extractTriples(triples: RDD[Triple], subject: Option[Node], predicate: Option[Node], obj: Option[Node]): RDD[Triple]

    Permalink

    Extracts all triples that match the given subject, predicate and object if defined.

    Extracts all triples that match the given subject, predicate and object if defined.

    triples

    the RDD of triples

    subject

    the subject

    predicate

    the predicate

    obj

    the object

    returns

    the RDD of triples that match

    Definition Classes
    ForwardRuleReasoner

  25. def extractTriples(triples: RDD[Triple], predicate: Node): RDD[Triple]

    Permalink

    Extracts all triples for the given predicate.

    Extracts all triples for the given predicate.

    triples

    the RDD of triples

    predicate

    the predicate

    returns

    the RDD of triples that contain the predicate

    Definition Classes
    ForwardRuleReasoner

  26. def extractTriples(triples: Set[Triple], predicate: Node): Set[Triple]

    Permalink

    Extracts all triples for the given predicate.

    Extracts all triples for the given predicate.

    triples

    the triples

    predicate

    the predicate

    returns

    the set of triples that contain the predicate

    Definition Classes
    ForwardRuleReasoner

  27. def finalize(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef → Any

  29. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  30. def info(msg: ⇒ String, o: Any, os: Any*): Unit

    Permalink
    Definition Classes
    Logging

  31. def info(msg: ⇒ String, e: Throwable): Unit

    Permalink
    Definition Classes
    Logging

  32. def info(msg: ⇒ String): Unit

    Permalink
    Definition Classes
    Logging

  33. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  34. def log: Logger

    Permalink
    Attributes
    protected
    Definition Classes
    Logging

  35. def logName: String

    Permalink
    Attributes
    protected
    Definition Classes
    Logging

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

    Permalink
    Definition Classes
    AnyRef

  37. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  38. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  39. val parallelism: Int

    Permalink

  40. def profile[R](block: ⇒ R): R

    Permalink
    Definition Classes
    Profiler

  41. val properties: Seq[Node]

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  43. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  44. def trace(msg: ⇒ String, o: Any, os: Any*): Unit

    Permalink
    Definition Classes
    Logging

  45. def trace(msg: ⇒ String, e: Throwable): Unit

    Permalink
    Definition Classes
    Logging

  46. def trace(msg: ⇒ String): Unit

    Permalink
    Definition Classes
    Logging

  47. final def wait(): Unit

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

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

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

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

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

  50. def warn(msg: ⇒ String, o: Any, os: Any*): Unit

    Permalink
    Definition Classes
    Logging

  51. def warn(msg: ⇒ String, e: Throwable): Unit

    Permalink
    Definition Classes
    Logging

  52. def warn(msg: ⇒ String): Unit

    Permalink
    Definition Classes
    Logging

Inherited from ForwardRuleReasoner

Inherited from Profiler

Inherited from Logging

Inherited from AnyRef

Inherited from Any

Ungrouped