org.apache.jena.sparql.core

Class DatasetGraphBaseFind

java.lang.Object

org.apache.jena.sparql.core.DatasetGraphBase

org.apache.jena.sparql.core.DatasetGraphBaseFind

All Implemented Interfaces:

org.apache.jena.atlas.lib.Closeable, DatasetGraph, Transactional

Direct Known Subclasses:

DatasetGraphCollection, DatasetGraphOne, DatasetGraphTriplesQuads

public abstract class DatasetGraphBaseFind
extends DatasetGraphBase

DatasetGraph framework. This class contains a convenience implementation of find that maps to a split between defaultGraph/named graphs.

See Also:

DatasetGraphTriplesQuads, DatasetGraphCollection, DatasetGraphOne, DatasetGraphInMemory

Method Summary

Modifier and Type	Method and Description
Iterator<Quad>	find(Node g, Node s, Node p, Node o) Implementation of find based on splitting into triples (default graph) and quads (named graph)
Iterator<Triple>	findInUnionGraph(Node s, Node p, Node o) Find matches in the notional union of all named graphs - return as triples.
Iterator<Quad>	findNG(Node g, Node s, Node p, Node o) Find matching quads in the dataset in named graphs only - may include wildcards, Node.ANY or null
Iterator<Quad>	findQuadsInUnionGraph(Node s, Node p, Node o) Find matches in the notional union of all named graphs - return as quads.

Methods inherited from class org.apache.jena.sparql.core.DatasetGraphBase

add, add, addGraph, clear, close, contains, contains, containsGraph, delete, delete, deleteAny, find, find, getContext, getDefaultGraph, getGraph, getLock, isEmpty, removeGraph, setDefaultGraph, size, toString

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, wait, wait, wait

Methods inherited from interface org.apache.jena.sparql.core.DatasetGraph

listGraphNodes, supportsTransactionAbort, supportsTransactions

Methods inherited from interface org.apache.jena.sparql.core.Transactional

abort, begin, commit, end, isInTransaction

Method Detail

find

public Iterator<Quad> find(Node g,
                           Node s,
                           Node p,
                           Node o)

Implementation of find based on splitting into triples (default graph) and quads (named graph)

See Also:

Graph.find(Node,Node,Node)

findNG

public Iterator<Quad> findNG(Node g,
                             Node s,
                             Node p,
                             Node o)

Description copied from interface: DatasetGraph

Find matching quads in the dataset in named graphs only - may include wildcards, Node.ANY or null

See Also:

Graph.find(Node,Node,Node)

findInUnionGraph

public Iterator<Triple> findInUnionGraph(Node s,
                                         Node p,
                                         Node o)

Find matches in the notional union of all named graphs - return as triples. No duplicates - the union graph is a set of triples. See findInAnyNamedGraphs(org.apache.jena.graph.Node, org.apache.jena.graph.Node, org.apache.jena.graph.Node), where there may be duplicates.

Implementations are encouraged to override this method. For example, it may be possible to avoid "distinct".

findQuadsInUnionGraph

public Iterator<Quad> findQuadsInUnionGraph(Node s,
                                            Node p,
                                            Node o)

Find matches in the notional union of all named graphs - return as quads. No duplicates - the union graph is a set of triples. See findInAnyNamedGraphs(org.apache.jena.graph.Node, org.apache.jena.graph.Node, org.apache.jena.graph.Node), where there may be duplicates.

Implementations are encouraged to override this method. For example, it may be possible to avoid "distinct".