Class

net.sansa_stack.ml.spark.mining.amieSpark

RDFGraphDataFrame

Related Doc: package amieSpark

Permalink

class RDFGraphDataFrame extends AbstractRDFGraph[DataFrame, RDFGraphDataFrame]

A data structure that comprises a set of triples.

Linear Supertypes
AbstractRDFGraph[DataFrame, RDFGraphDataFrame], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. RDFGraphDataFrame
  2. AbstractRDFGraph
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new RDFGraphDataFrame(triples: DataFrame)

    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. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  5. def cache(): RDFGraphDataFrame.this.type

    Permalink

    Persist the triples RDD with the default storage level (MEMORY_ONLY).

    Persist the triples RDD with the default storage level (MEMORY_ONLY).

    Definition Classes
    RDFGraphDataFrameAbstractRDFGraph
  6. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  7. def distinct(): RDFGraphDataFrame

    Permalink

    Returns a new graph that does not contain duplicate triples.

    Returns a new graph that does not contain duplicate triples.

    Definition Classes
    RDFGraphDataFrameAbstractRDFGraph
  8. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  9. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  10. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  11. def find(triple: Triple): DataFrame

    Permalink

    Returns an RDD of triples that match with the given input.

    Returns an RDD of triples that match with the given input.

    returns

    RDD of triples

    Definition Classes
    RDFGraphDataFrameAbstractRDFGraph
  12. def find(s: Option[String] = None, p: Option[String] = None, o: Option[String] = None): DataFrame

    Permalink

    Returns an RDD of triples that match with the given input.

    Returns an RDD of triples that match with the given input.

    s

    the subject

    p

    the predicate

    o

    the object

    returns

    RDD of triples

    Definition Classes
    RDFGraphDataFrameAbstractRDFGraph
  13. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  14. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  15. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  16. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  17. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  18. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  19. def size(): Long

    Permalink

    Return the number of triples.

    Return the number of triples.

    returns

    the number of triples

    Definition Classes
    RDFGraphDataFrameAbstractRDFGraph
  20. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  21. def toDataFrame(sparkSession: SparkSession): DataFrame

    Permalink
    Definition Classes
    RDFGraphDataFrameAbstractRDFGraph
  22. def toRDD(): RDD[RDFTriple]

    Permalink
    Definition Classes
    RDFGraphDataFrameAbstractRDFGraph
  23. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  24. def union(graph: RDFGraphDataFrame): RDFGraphDataFrame

    Permalink

    Return the union of the current RDF graph with the given RDF graph

    Return the union of the current RDF graph with the given RDF graph

    graph

    the other RDF graph

    returns

    the union of both graphs

    Definition Classes
    RDFGraphDataFrameAbstractRDFGraph
  25. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  26. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  27. final def wait(arg0: Long): Unit

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

Inherited from AbstractRDFGraph[DataFrame, RDFGraphDataFrame]

Inherited from AnyRef

Inherited from Any

Ungrouped