public class Vertex extends Object implements Serializable
IPredicate
with additional annotations to support the adaptive query
optimization algorithm).
The unique identifier for a Vertex
(within a given join graph) is the
BOp.Annotations#BOP_ID
decorating its IPredicate
.
hashCode()
is defined in terms of this unique identifier so we can
readily detect when a Set
already contains a given Vertex
.
Modifier and Type | Field and Description |
---|---|
IPredicate<?> |
pred
The
IPredicate associated with the Vertex . |
Modifier and Type | Method and Description |
---|---|
boolean |
equals(Object o)
Equals is based on a reference test.
|
int |
hashCode()
The hash code is just the
BOp.Annotations#BOP_ID of the
associated IPredicate . |
void |
sample(QueryEngine queryEngine,
int limit,
SampleIndex.SampleType sampleType)
Take a sample of the vertex, updating
sample as a side-effect. |
String |
toString() |
public final IPredicate<?> pred
IPredicate
associated with the Vertex
. This basically
provides the information necessary to select an appropriate access path.public boolean equals(Object o)
public int hashCode()
BOp.Annotations#BOP_ID
of the
associated IPredicate
.public void sample(QueryEngine queryEngine, int limit, SampleIndex.SampleType sampleType)
sample
as a side-effect.
If the sample is already exact, then this is a NOP. If the vertex was
already sampled to that limit, then this is a NOP (you have to raise the
limit to re-sample the vertex).limit
- The sample cutoff.Copyright © 2006–2019 SYSTAP, LLC DBA Blazegraph. All rights reserved.