public interface QueryHandler
Modifier and Type | Method and Description |
---|---|
boolean |
containsNode(Node n)
true iff the graph contains a triple in which n appears somewhere.
|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Node> |
objectsFor(Node s,
Node p)
deliver an iterator over all the objects _o_ such that _(s, p, o)_ is in the
underlying graph; nulls count as wildcards.
|
Stage |
patternStage(Mapping map,
ExpressionSet constraints,
Triple[] p)
produce a single Stage which will probe the underlying graph for triples
matching p and inject all the resulting bindings into the processing stream
(see Stage for details)
|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Node> |
predicatesFor(Node s,
Node o)
Answer an iterator over all the predicates
p such that
(s, p, o) is in the underlying graph. |
BindingQueryPlan |
prepareBindings(Query q,
Node[] variables)
prepare a plan for generating bindings given the query _q_ and the result
variables _variables_.
|
TreeQueryPlan |
prepareTree(Graph pattern)
deliver a plan for executing the tree-match query defined by _pattern_.
|
com.hp.hpl.jena.util.iterator.ExtendedIterator<Node> |
subjectsFor(Node p,
Node o)
deliver an iterator over all the subjects _s_ such that _(s, p, o)_ is in the
underlying graph; nulls count as wildcards.
|
BindingQueryPlan prepareBindings(Query q, Node[] variables)
Stage patternStage(Mapping map, ExpressionSet constraints, Triple[] p)
_map_ is the variable binding map to use and update. _constraints_ is the current constraint expression: if this Stage can absorb some of the ANDed constraints, it may do so, and remove them from the ExpressionSet.
TreeQueryPlan prepareTree(Graph pattern)
com.hp.hpl.jena.util.iterator.ExtendedIterator<Node> objectsFor(Node s, Node p)
com.hp.hpl.jena.util.iterator.ExtendedIterator<Node> subjectsFor(Node p, Node o)
com.hp.hpl.jena.util.iterator.ExtendedIterator<Node> predicatesFor(Node s, Node o)
p
such that
(s, p, o)
is in the underlying graph. .remove() is not
defined on this iterator.boolean containsNode(Node n)
Copyright ? 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 Hewlett-Packard Development Company, LP