Package org.openanzo.glitter.query.planning

Class Summary

GreedyCostBasedExecutionPlan	The GreedyCostBasedExecutionPlan provides a simple way to order the execution of a SPARQL query: namely, compare the isolated costs of two nodes and evaluate the cheapest node first.
LexicalOrderBasedExecutionPlan	Despite its fancy sounding name, the LexicalOrderBasedExecutionPlan simply iterates over the nodes in the order in which it is given them.
OdoQueryOptimizer	The OdoQueryOptimizer attempts to prioritize evaluation of triple patterns with less free variables before those with more free variables.
OdoTripleNode	An OdoTripleNode wraps a TriplePatternNode and allows for stateful comparison of two such nodes based on the number of free variables in each triple pattern.
QueryOptimizer	QueryOptimizer
SimpleCostExecutionPlan	A SimpleCostExecutionPlan uses the SimpleCostModel in concert with the GreedyCostBasedExecutionPlan to provide an unsophisticated way to approach executing a query.
SimpleCostModel	The SimpleCostModel is a very simple model of costs for a SPARQL query.
TripleNode	An TripleNode wraps a TriplePatternNode and allows for stateful comparison of two such nodes based on the number of free variables in each triple pattern.