Package | Description |
---|---|
com.bigdata.bop.joinGraph.rto | |
com.bigdata.rdf.sparql.ast.eval |
Modifier and Type | Method and Description |
---|---|
Path |
Path.addEdge(QueryEngine queryEngine,
JoinGraph joinGraph,
int limit,
Vertex vnew,
IConstraint[] constraints,
boolean pathIsComplete)
Add an edge to a path, computing the estimated cardinality of the new
path, and returning the new path.
|
Path[] |
JGraph.chooseStartingPaths(int nedges,
Path[] paths)
Choose the starting vertices.
|
Path[] |
JGraph.expand(QueryEngine queryEngine,
int limitIn,
int round,
Path[] a,
Map<PathIds,EdgeSample> edgeSamples)
Do one breadth first expansion.
|
Path |
JoinGraph.getPath(IRunningQuery q)
Return the computed join path.
|
Path[] |
JGraph.pruneJoinPaths(Path[] a,
Map<PathIds,EdgeSample> edgeSamples)
Prune paths which are dominated by other paths.
|
Path[] |
JGraph.round0(QueryEngine queryEngine,
int limit,
int nedges)
Choose up to nedges edges to be the starting point.
|
Path |
JGraph.runtimeOptimizer(QueryEngine queryEngine,
Map<PathIds,EdgeSample> edgeSamples)
Find a good join path in the data given the join graph.
|
Modifier and Type | Method and Description |
---|---|
boolean |
Path.beginsWith(Path p)
Return
true if this path begins with the given path. |
Path[] |
JGraph.chooseStartingPaths(int nedges,
Path[] paths)
Choose the starting vertices.
|
Path[] |
JGraph.expand(QueryEngine queryEngine,
int limitIn,
int round,
Path[] a,
Map<PathIds,EdgeSample> edgeSamples)
Do one breadth first expansion.
|
int[] |
JGraph.getOrder(Path p)
Return a permutation vector which may be used to reorder the given
IPredicate [] into the evaluation order selected by the
runtime query optimizer. |
boolean |
Path.isUnorderedVariant(Path p)
Return
true if this path is an unordered variant of the
given path (same vertices in any order). |
Path[] |
JGraph.pruneJoinPaths(Path[] a,
Map<PathIds,EdgeSample> edgeSamples)
Prune paths which are dominated by other paths.
|
protected int |
JGraph.resamplePaths(QueryEngine queryEngine,
int limitIn,
int round,
Path[] a,
Map<PathIds,EdgeSample> edgeSamples)
Resample the initial vertices for the specified join paths and then
resample the cutoff join for each given join path in path order.
|
static String |
JGraph.showPath(Path x,
Map<PathIds,EdgeSample> edgeSamples)
Show the details of a join path, including the estimated cardinality and
join hit ratio for each step in the path.
|
static String |
JGraph.showTable(Path[] a)
Comma delimited table showing the estimated join hit ratio, the estimated
cardinality, and the set of vertices for each of the specified join
paths.
|
static String |
JGraph.showTable(Path[] a,
Path[] pruned)
Return a comma delimited table showing the estimated join hit ratio, the
estimated cardinality, and the set of vertices for each of the specified
join paths.
|
static String |
JGraph.showTable(Path[] a,
Path[] pruned)
Return a comma delimited table showing the estimated join hit ratio, the
estimated cardinality, and the set of vertices for each of the specified
join paths.
|
static String |
JGraph.showTable(Path[] a,
Path[] pruned,
Map<PathIds,EdgeSample> edgeSamples)
Return a comma delimited table showing the estimated join hit ratio, the
estimated cardinality, and the set of vertices for each of the specified
join paths.
|
static String |
JGraph.showTable(Path[] a,
Path[] pruned,
Map<PathIds,EdgeSample> edgeSamples)
Return a comma delimited table showing the estimated join hit ratio, the
estimated cardinality, and the set of vertices for each of the specified
join paths.
|
Constructor and Description |
---|
PathIds(Path p)
Convenience constructor.
|
Modifier and Type | Method and Description |
---|---|
static PipelineOp |
AST2BOpRTO.compileJoinGraph(QueryEngine queryEngine,
JoinGraph joinGraph,
Path path)
Compile a join graph into a query plan.
|
Copyright © 2006–2019 SYSTAP, LLC DBA Blazegraph. All rights reserved.