| java.lang.Object com.hp.hpl.jena.graph.query.SimpleQueryHandler
All known Subclasses: com.hp.hpl.jena.mem.GraphMemBaseQueryHandler, com.hp.hpl.jena.db.impl.DBQueryHandler,
SimpleQueryHandler | public class SimpleQueryHandler implements QueryHandler(Code) | | A SimpleQueryHandler is a more-or-less straightforward implementation of QueryHandler
suitable for use on graphs with no special query engines.
author: kers |
Method Summary | |
public boolean | containsNode(Node n) this is a simple-minded implementation of containsNode that uses find
up to three times to locate the node. | public ExtendedIterator | objectsFor(Node s, Node p) | public static ExtendedIterator | objectsFor(Graph g, Node s, Node p) | public Stage | patternStage(Mapping map, ExpressionSet constraints, Triple[] t) | public ExtendedIterator | predicatesFor(Node s, Node o) | public static ExtendedIterator | predicatesFor(Graph g, Node s, Node o) | public BindingQueryPlan | prepareBindings(Query q, Node[] variables) | public TreeQueryPlan | prepareTree(Graph pattern) | public ExtendedIterator | subjectsFor(Node p, Node o) | public static ExtendedIterator | subjectsFor(Graph g, Node p, Node o) |
graph | protected Graph graph(Code) | | the Graph this handler is working for
|
SimpleQueryHandler | public SimpleQueryHandler(Graph graph)(Code) | | make an instance, remember the graph
|
containsNode | public boolean containsNode(Node n)(Code) | | this is a simple-minded implementation of containsNode that uses find
up to three times to locate the node. Almost certainly particular graphs
will be able to offer better query-handlers ...
|
|
|