public abstract class DatasetGraphBaseFind extends DatasetGraphBase
Transactional.Promote
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.
|
add, add, addGraph, clear, close, contains, contains, containsGraph, delete, delete, deleteAny, find, find, getContext, getDefaultGraph, getGraph, getLock, getUnionGraph, isEmpty, removeGraph, setDefaultGraph, size, toString
equals, getClass, hashCode, notify, notifyAll, wait, wait, wait
listGraphNodes, supportsTransactionAbort, supportsTransactions
abort, begin, begin, begin, commit, end, isInTransaction, promote, promote, transactionMode, transactionType
public Iterator<Quad> find(Node g, Node s, Node p, Node o)
Graph.find(Node,Node,Node)
public Iterator<Quad> findNG(Node g, Node s, Node p, Node o)
DatasetGraph
Graph.find(Node,Node,Node)
public Iterator<Triple> findInUnionGraph(Node s, Node p, Node o)
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".
public Iterator<Quad> findQuadsInUnionGraph(Node s, Node p, Node o)
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 or findUnionGraphTriples(org.apache.jena.graph.Node, org.apache.jena.graph.Node, org.apache.jena.graph.Node)
.
For example, it may be possible to avoid "distinct".
Licenced under the Apache License, Version 2.0