trait TransitiveReasoner extends Profiler
An engine to compute the transitive closure (TC) for a set of triples given in several datastructures.
- Alphabetic
- By Inheritance
- TransitiveReasoner
- Profiler
- Logging
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
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 addTransitive(triples: Set[Triple]): Set[Triple]
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
def
computeTransitiveClosure[A](edges: DataSet[(A, A)])(implicit arg0: ClassTag[A], arg1: TypeInformation[A]): DataSet[(A, A)]
Computes the transitive closure for a DataSet of tuples
Computes the transitive closure for a DataSet of tuples
- edges
the DataSet of tuples
- returns
a tuples containing the transitive closure of the tuples
-
def
computeTransitiveClosure(triples: DataSet[Triple]): DataSet[Triple]
Computes the transitive closure on a DataSet of triples.
Computes the transitive closure on a DataSet of triples. Note, that the assumption is that all triples do have the same predicate.
- triples
the DataSet of triples
- returns
a DataSet 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
computeTransitiveClosureOpt(triples: DataSet[Triple]): DataSet[Triple]
Computes the transitive closure on a DataSet of triples.
Computes the transitive closure on a DataSet of triples. Note, that the assumption is that all triples do have the same predicate. This implementation uses the Flink iterate operator (see https://ci.apache.org/projects/flink/flink-docs-master/dev/batch/iterations.html")
- triples
the DataSet of triples
- returns
a DataSet containing the transitive closure of the triples
-
def
computeTransitiveClosureOptSemiNaive(triples: DataSet[Triple], predicate: Node = null): DataSet[Triple]
Computes the transitive closure on a DataSet of triples.
Computes the transitive closure on a DataSet of triples. Note, that the assumption is that all triples do have the same predicate. If no predicate is given, we take any triple from the dataset and use its predicate. We highly recommend to provide the predicate in order to avoid unnecessary operations.
This implementation uses the Flink iterate operator (see https://ci.apache.org/projects/flink/flink-docs-master/dev/batch/iterations.html")
- triples
the DataSet of triples
- predicate
the optional predicate
- returns
a DataSet containing the transitive closure of the triples
-
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
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
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
- val nodeKeyFct: (Node) ⇒ Int
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
profile[R](block: ⇒ R): R
- Definition Classes
- Profiler
-
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(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
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()
-
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