case class RDFGraph(triples: RDD[Triple]) extends Product with Serializable
A data structure that comprises a set of triples.
- Alphabetic
- By Inheritance
- RDFGraph
- Serializable
- Serializable
- Product
- Equals
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
- new RDFGraph(triples: RDD[Triple])
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
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
cache(): RDFGraph
Persist the triples RDD with the default storage level (
MEMORY_ONLY). -
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native() @IntrinsicCandidate()
-
def
difference(graph: RDFGraph): RDFGraph
Returns a new RDF graph that contains the difference between the current RDF graph and the given RDF graph.
Returns a new RDF graph that contains the difference between the current RDF graph and the given RDF graph.
- graph
the other RDF graph
- returns
the difference of both RDF graphs
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
find(triple: Triple): RDD[Triple]
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
-
def
find(s: Option[Node] = None, p: Option[Node] = None, o: Option[Node] = None): RDD[Triple]
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
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
-
def
intersection(graph: RDFGraph): RDFGraph
Returns a new RDF graph that contains the intersection of the current RDF graph with the given RDF graph.
Returns a new RDF graph that contains the intersection of the current RDF graph with the given RDF graph.
- graph
the other RDF graph
- returns
the intersection of both RDF graphs
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
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()
-
def
size(): Long
Return the number of triples.
Return the number of triples.
- returns
the number of triples
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
- def toDataFrame(sqlContext: SQLContext): DataFrame
- val triples: RDD[Triple]
-
def
union(graph: RDFGraph): RDFGraph
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
-
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( ... )
Deprecated Value Members
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] ) @Deprecated
- Deprecated