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.
the other RDF graph
the difference of both RDF graphs
Returns a new RDF graph that does not contain duplicate triples.
Returns a new RDF graph that contains only triples matching the given input.
Returns a new RDF graph that contains only triples matching the given input.
a new RDF graph
Returns a new RDF graph that contains only triples matching the given input.
Returns a new RDF graph that contains only triples matching the given input.
the subject
the predicate
the object
a new RDF graph
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.
the other RDF graph
the intersection of both RDF graphs
Return the number of triples in the RDF graph.
Return the number of triples in the RDF graph.
the number of triples in the RDF graph
Returns a new RDF graph that contains the union of the current RDF graph with the given RDF graph.
Returns a new RDF graph that contains the union of the current RDF graph with the given RDF graph.
the other RDF graph
the union of both RDF graphs
Returns a new RDF graph that contains the union of the current RDF graph with the given RDF graphs.
Returns a new RDF graph that contains the union of the current RDF graph with the given RDF graphs.
the other RDF graphs
the union of all RDF graphs
A data structure that comprises a collection of triples. Note, due to the implementation of the Spark datastructures, this doesn't necessarily mean to be free of duplicates which is why a
distinct
operation is provided.