class TransitiveReasoner extends ForwardRuleReasoner
An engine to compute the transitive closure (TC) for a set of triples given in several datastructures.
- Alphabetic
- By Inheritance
- TransitiveReasoner
- ForwardRuleReasoner
- Profiler
- Logging
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
- new TransitiveReasoner(spark: SparkSession, properties: Seq[Node], parallelism: Int)
- new TransitiveReasoner(sc: SparkContext, parallelism: Int)
- new TransitiveReasoner(sc: SparkContext, property: Node, parallelism: Int)
- new TransitiveReasoner(sc: SparkContext, properties: Seq[Node], parallelism: Int)
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def addTransitivePairs[A, B](s: Set[(A, B)]): Set[(A, B)]
-
def
apply(graph: RDFGraph): RDFGraph
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
-
def
apply(triples: RDD[Triple]): RDD[Triple]
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
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native() @IntrinsicCandidate()
-
def
computeTransitiveClosure(edges: Dataset[Triple]): Dataset[Triple]
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
-
def
computeTransitiveClosure[A](edges: RDD[(A, A)])(implicit arg0: ClassTag[A]): RDD[(A, A)]
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
-
def
computeTransitiveClosure(triples: RDD[Triple], predicate: Node): RDD[Triple]
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
-
def
computeTransitiveClosure(triples: RDD[Triple]): RDD[Triple]
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
-
def
computeTransitiveClosure(triples: Set[Triple]): Set[Triple]
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
- def computeTransitiveClosurePairs[A, B](s: Set[(A, B)]): Set[(A, B)]
-
def
computeTransitiveClosureSemiNaive[A](edges: RDD[(A, A)])(implicit arg0: ClassTag[A]): RDD[(A, A)]
Semi-naive computation of the transitive closure
Tfor an RDD of tuplesR=(x,y).Semi-naive computation of the transitive closure
Tfor an RDD of tuplesR=(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
-
def
debug(msg: ⇒ String, o: Any, os: Any*): Unit
- Definition Classes
- Logging
-
def
debug(msg: ⇒ String, e: Throwable): Unit
- Definition Classes
- Logging
-
def
debug(msg: ⇒ String): Unit
- Definition Classes
- Logging
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
error(msg: ⇒ String, o: Any, os: Any*): Unit
- Definition Classes
- Logging
-
def
error(msg: ⇒ String, e: Throwable): Unit
- Definition Classes
- Logging
-
def
error(msg: ⇒ String): Unit
- Definition Classes
- Logging
-
def
extractTriples(triples: RDD[Triple], subject: Option[Node], predicate: Option[Node], obj: Option[Node]): RDD[Triple]
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
-
def
extractTriples(triples: RDD[Triple], predicate: Node): RDD[Triple]
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
-
def
extractTriples(triples: Set[Triple], predicate: Node): Set[Triple]
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
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
-
def
info(msg: ⇒ String, o: Any, os: Any*): Unit
- Definition Classes
- Logging
-
def
info(msg: ⇒ String, e: Throwable): Unit
- Definition Classes
- Logging
-
def
info(msg: ⇒ String): Unit
- Definition Classes
- Logging
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
log: Logger
- Attributes
- protected
- Definition Classes
- Logging
-
def
logName: String
- Attributes
- protected
- Definition Classes
- Logging
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
- val parallelism: Int
-
def
profile[R](block: ⇒ R): R
- Definition Classes
- Profiler
- val properties: Seq[Node]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
def
trace(msg: ⇒ String, o: Any, os: Any*): Unit
- Definition Classes
- Logging
-
def
trace(msg: ⇒ String, e: Throwable): Unit
- Definition Classes
- Logging
-
def
trace(msg: ⇒ String): Unit
- Definition Classes
- Logging
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
def
warn(msg: ⇒ String, o: Any, os: Any*): Unit
- Definition Classes
- Logging
-
def
warn(msg: ⇒ String, e: Throwable): Unit
- Definition Classes
- Logging
-
def
warn(msg: ⇒ String): Unit
- Definition Classes
- Logging
Deprecated Value Members
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] ) @Deprecated
- Deprecated