Package | Description |
---|---|
com.bigdata.bop |
This package provides an API for query operators.
|
com.bigdata.bop.ap | |
com.bigdata.bop.ap.filter |
These filters are based on the striterator patterns.
|
com.bigdata.bop.fed.shards | |
com.bigdata.bop.join | |
com.bigdata.bop.joinGraph |
This package provides support for join graphs, query optimization,
and generating full query plans from a join graph and the
evaluation order identified by a query optimizer.
|
com.bigdata.bop.joinGraph.rto | |
com.bigdata.bop.mutation | |
com.bigdata.bop.rdf.join | |
com.bigdata.rdf.lexicon | |
com.bigdata.rdf.rules | |
com.bigdata.rdf.sparql.ast.eval | |
com.bigdata.rdf.spo |
This package defines a statement model using long term identifiers rather than
RDF Value objects.
|
com.bigdata.rdf.store |
This package provides several realizations of an RDF database using the bigdata
architecture, including one suitable for temporary data, one suitable for local
processing (single host), and one designed for scale-out on commodity hardware.
|
com.bigdata.relation |
This package includes an abstraction layer for relations.
|
com.bigdata.relation.accesspath |
This package includes an abstraction layer for efficient access paths, including
chunked iterators, blocking buffers, and an abstraction corresponding to the natural
order of an index.
|
com.bigdata.relation.rule |
This package includes an abstraction layer for rules.
|
com.bigdata.relation.rule.eval |
This package supports rule evaluation.
|
com.bigdata.relation.rule.eval.pipeline |
This package implements a pipeline join.
|
com.bigdata.search |
This package provides full text indexing and search.
|
com.bigdata.striterator |
Streaming iterator patterns based on Martyn Cutcher's striterator design
but supporting generics and with extensions for closable, chunked, and
ordered streaming iterators.
|
Modifier and Type | Method and Description |
---|---|
IPredicate<E> |
IPredicate.asBound(IBindingSet bindingSet)
Return a new instance in which all occurrences of the variable appearing
in the binding set have been replaced by their bound values.
|
IPredicate<E> |
IShardwisePipelineOp.getPredicate()
The predicate which reads or writes on the shard.
|
IPredicate<E> |
IPredicate.setArg(int index,
IVariableOrConstant arg)
Return a copy of this predicate with a different
IVariableOrConstant
for the arg specified by the supplied index parameter. |
IPredicate<E> |
IPredicate.setBOpId(int bopId)
Sets the
BOp.Annotations.BOP_ID annotation. |
IPredicate<E> |
IPredicate.setPartitionId(int partitionId)
Sets the index partition identifier constraint.
|
IPredicate<E> |
IPredicate.setRelationName(String[] relationName)
Deprecated.
This will be modified to use a scalar relation name per
getOnlyRelationName() . |
Modifier and Type | Method and Description |
---|---|
static boolean |
BOpContext.bind(IPredicate<?> pred,
IConstraint[] constraints,
Object e,
IBindingSet bindings)
Deprecated.
|
static void |
BOpContext.copyValues(IElement e,
IPredicate<?> pred,
IBindingSet bindingSet)
Copy the values for variables in the predicate from the element, applying
them to the caller's
IBindingSet . |
<E> IAccessPath<E> |
BOpContextBase.getAccessPath(IRelation<E> relation,
IPredicate<E> predicate)
Obtain an access path reading from the identified
IRelation using
the specified IPredicate . |
static int[] |
BOpUtility.getPredIds(IPredicate<?>[] path)
Return an ordered array of the bopIds associated with an ordered array of
predicates (aka a join path).
|
<E> IRelation<E> |
BOpContextBase.getRelation(IPredicate<E> pred)
Locate and return the view of the relation identified by the
IPredicate . |
void |
BOpIdFactory.reserveIds(IPredicate<?>[] preds)
Reserve ids used by the predicates in some join graph.
|
ICloseableIterator<IBindingSet[]> |
BOpContext.solutions(IChunkedIterator<?> src,
IPredicate<?> pred,
BaseJoinStats stats)
Convert an
IAccessPath.iterator() into a stream of chunks of
IBindingSet . |
Modifier and Type | Class and Description |
---|---|
class |
Predicate<E>
A generic implementation of an immutable
IPredicate . |
Modifier and Type | Method and Description |
---|---|
IPredicate<E> |
SampleIndex.getPredicate() |
IPredicate<E> |
SampleIndex.AccessPathSample.getPredicate() |
Modifier and Type | Method and Description |
---|---|
IKeyOrder<E> |
R.getKeyOrder(IPredicate<E> p) |
Modifier and Type | Method and Description |
---|---|
static <E> SameVariableConstraint<E> |
SameVariableConstraint.newInstance(IPredicate<E> p)
The filter is only created and populated for variables which appear more
than once in the predicate.
|
Constructor and Description |
---|
SameVariableConstraint(IPredicate<E> p,
int[] indices) |
Modifier and Type | Field and Description |
---|---|
protected IPredicate<F> |
MapBindingSetsOverShardsBuffer.pred
The predicate from which we generate the asBound binding sets.
|
Constructor and Description |
---|
MapBindingSetsOverShardsBuffer(IBigdataFederation<?> fed,
IPredicate<F> pred,
long timestamp,
int capacity) |
Modifier and Type | Field and Description |
---|---|
protected IPredicate<E> |
FastRangeCountOp.ChunkTask.predicate
The source for the elements to be joined.
|
Modifier and Type | Method and Description |
---|---|
IPredicate<E> |
DistinctTermScanOp.getPredicate() |
IPredicate<E> |
HashJoinOp.getPredicate()
The predicate which reads or writes on the shard.
|
IPredicate<E> |
PipelineJoin.getPredicate()
The predicate which reads or writes on the shard.
|
IPredicate<E> |
FastRangeCountOp.getPredicate() |
Modifier and Type | Method and Description |
---|---|
protected long |
FastRangeCountOp.ChunkTask.determineRangeCount(IPredicate<E> pred) |
Modifier and Type | Method and Description |
---|---|
IPredicate<?>[] |
PartitionedJoinGroup.getJoinGraph()
Deprecated.
The
IPredicate s in the join graph (required joins). |
IPredicate<?>[] |
PartitionedJoinGroup.getTailPlan()
Deprecated.
The
IPredicate s representing optional joins. |
Modifier and Type | Method and Description |
---|---|
static boolean |
PartitionedJoinGroup.canJoin(IPredicate<?> p1,
IPredicate<?> p2)
Deprecated.
Return
true iff two predicates can join on the basis of at
least one variable which is shared directly by those predicates. |
static boolean |
PartitionedJoinGroup.canJoin(IPredicate<?> p1,
IPredicate<?> p2)
Deprecated.
Return
true iff two predicates can join on the basis of at
least one variable which is shared directly by those predicates. |
static boolean |
PartitionedJoinGroup.canJoinUsingConstraints(IPredicate<?>[] path,
IPredicate<?> vertex,
IConstraint[] constraints)
Deprecated.
Return
true iff a predicate may be used to extend a join
path on the basis of at least one variable which is shared either
directly or via one or more constraints which may be attached to the
predicate when it is added to the join path. |
static boolean |
PartitionedJoinGroup.canJoinUsingConstraints(IPredicate<?>[] path,
IPredicate<?> vertex,
IConstraint[] constraints)
Deprecated.
Return
true iff a predicate may be used to extend a join
path on the basis of at least one variable which is shared either
directly or via one or more constraints which may be attached to the
predicate when it is added to the join path. |
static IConstraint[][] |
PartitionedJoinGroup.getJoinGraphConstraints(IPredicate<?>[] path,
IConstraint[] joinGraphConstraints,
IVariable<?>[] knownBoundVars,
boolean pathIsComplete)
Deprecated.
Given a join path, return the set of constraints to be associated with
each join in that join path.
|
long |
IRangeCountFactory.rangeCount(IPredicate pred)
Return the range count for the predicate as bound.
|
long |
DefaultRangeCountFactory.rangeCount(IPredicate predicate)
Return the range count for the predicate.
|
Constructor and Description |
---|
PartitionedJoinGroup(IPredicate<?>[] sourcePreds,
IConstraint[] constraints)
Deprecated.
Analyze a set of
IPredicate s representing "runFirst", optional
joins, and non-optional joins which may be freely reordered together with
a collection of IConstraint s and partition them into a join graph
and a tail plan. |
Modifier and Type | Field and Description |
---|---|
IPredicate<?> |
Vertex.pred
The
IPredicate associated with the Vertex . |
Modifier and Type | Method and Description |
---|---|
IPredicate<?>[] |
Path.getPathSegment(int length)
Return the first N
IPredicate s in this Path . |
IPredicate<?>[] |
Path.getPredicates()
Return the
IPredicate s associated with the vertices of the
join path in path order. |
IPredicate<?>[] |
JoinGraph.getVertices() |
Modifier and Type | Method and Description |
---|---|
static EdgeSample |
Path.cutoffJoin(QueryEngine queryEngine,
JoinGraph joinGraph,
int limit,
IPredicate<?>[] path,
IConstraint[] constraints,
boolean pathIsComplete,
SampleBase sourceSample)
Cutoff join of the last vertex in the join path.
|
Modifier and Type | Method and Description |
---|---|
IPredicate<E> |
InsertOp.getPredicate() |
Modifier and Type | Method and Description |
---|---|
IPredicate<E> |
InlineMaterializeOp.getPredicate() |
Modifier and Type | Class and Description |
---|---|
class |
LexPredicate
A
lex(BigdataValue,IV)
predicate used for querying the LexiconRelation 's TERMS
index. |
Modifier and Type | Method and Description |
---|---|
IKeyOrder<BigdataValue> |
LexiconRelation.getKeyOrder(IPredicate<BigdataValue> p)
Return the
IKeyOrder for the predicate corresponding to the
perfect access path. |
IAccessPath<BigdataValue> |
LexiconRelation.newAccessPath(IIndexManager localIndexManager,
IPredicate<BigdataValue> predicate,
IKeyOrder<BigdataValue> keyOrder)
Necessary for lexicon joins, which are injected into query plans as
necessary by the query planner.
|
static LexAccessPatternEnum |
LexAccessPatternEnum.valueOf(IPredicate<?> predicate) |
Modifier and Type | Method and Description |
---|---|
IPredicate<ISPO> |
BackchainAccessPath.getPredicate() |
Modifier and Type | Method and Description |
---|---|
IConstant |
RDFJoinNexus.fakeBinding(IPredicate pred,
Var var) |
IAccessPath |
RDFJoinNexus.getTailAccessPath(IRelation relation,
IPredicate predicate)
When
RDFJoinNexus.backchain is true and the tail predicate is
reading on the SPORelation , then the IAccessPath is
wrapped so that the iterator will visit the backchained inferences as
well. |
protected ISortKeyBuilder<?> |
RDFJoinNexus.newSortKeyBuilder(IPredicate<?> head) |
Modifier and Type | Method and Description |
---|---|
static EdgeSample |
AST2BOpRTO.cutoffJoin(QueryEngine queryEngine,
JoinGraph joinGraph,
int limit,
IPredicate<?>[] predicates,
IConstraint[] constraints,
boolean pathIsComplete,
SampleBase sourceSample)
Cutoff join of the last vertex in the join path.
|
Modifier and Type | Class and Description |
---|---|
class |
SPOPredicate
A predicate that is a triple with one or more variables.
|
class |
SPOStarJoin
Implementation of a star join for SPOs.
|
protected static class |
TestSPORelation.P |
Modifier and Type | Method and Description |
---|---|
IPredicate<ISPO> |
SPORelation.getPredicate(IV s,
IV p,
IV o,
IV c)
Return the predicate for a triple or quad pattern filter (core
implementation).
|
IPredicate<ISPO> |
SPORelation.getPredicate(IV s,
IV p,
IV o,
IV c,
IElementFilter<ISPO> filter,
RangeBOp range)
Return the predicate for a triple or quad pattern with an optional
filter (core implementation).
|
Modifier and Type | Method and Description |
---|---|
byte[] |
SPOKeyOrder.getFromKey(IKeyBuilder keyBuilder,
IPredicate<ISPO> predicate)
Return the inclusive lower bound which would be used for a query against
this
IKeyOrder for the given IPredicate . |
SPOKeyOrder |
SPORelation.getKeyOrder(IPredicate<ISPO> predicate)
Implementation chooses a quads or triples index as appropriate.
|
static SPOKeyOrder |
SPOKeyOrder.getKeyOrder(IPredicate<ISPO> predicate,
int keyArity)
Return the
SPOKeyOrder for the given predicate. |
byte[] |
SPOKeyOrder.getToKey(IKeyBuilder keyBuilder,
IPredicate<ISPO> predicate)
Return the exclusive upper bound which would be used for a query against
this
IKeyOrder for the given IPredicate . |
IAccessPath<ISPO> |
SPORelation.newAccessPath(IIndexManager localIndexManager,
IPredicate<ISPO> predicate,
IKeyOrder<ISPO> keyOrder) |
Constructor and Description |
---|
SPO(IPredicate<ISPO> predicate)
Variant to create an SPO from a predicate - the
StatementEnum and
statement identifier are not specified. |
SPOAccessPath(IRelation<ISPO> relation,
IIndexManager localIndexManager,
IPredicate<ISPO> predicate,
IKeyOrder<ISPO> keyOrder) |
Modifier and Type | Method and Description |
---|---|
IPredicate<ISPO> |
AbstractTripleStore.getPredicate(org.openrdf.model.Resource s,
org.openrdf.model.URI p,
org.openrdf.model.Value o) |
IPredicate<ISPO> |
AbstractTripleStore.getPredicate(org.openrdf.model.Resource s,
org.openrdf.model.URI p,
org.openrdf.model.Value o,
org.openrdf.model.Resource c) |
IPredicate<ISPO> |
AbstractTripleStore.getPredicate(org.openrdf.model.Resource s,
org.openrdf.model.URI p,
org.openrdf.model.Value o,
org.openrdf.model.Resource c,
IElementFilter<ISPO> filter,
RangeBOp range)
Convert a Sesame Value based triple pattern into a bigdata Predicate.
|
Modifier and Type | Method and Description |
---|---|
IAccessPath<E> |
RelationFusedView.getAccessPath(IIndexManager localIndexManagerIsIgnored,
IKeyOrder<E> keyOrderisIgnored,
IPredicate<E> predicate)
Deprecated.
|
IAccessPath<E> |
AbstractRelation.getAccessPath(IIndexManager localIndexManager,
IKeyOrder<E> keyOrder,
IPredicate<E> predicate) |
IAccessPath<E> |
IRelation.getAccessPath(IIndexManager localIndexManager,
IKeyOrder<E> keyOrder,
IPredicate<E> predicate)
Return the
IAccessPath for an IRelation using the
specified IIndexManager and IKeyOrder (core impl). |
IAccessPath<E> |
RelationFusedView.getAccessPath(IKeyOrder<E> keyOrderIsIgnored,
IPredicate<E> predicate)
Deprecated.
|
IAccessPath<E> |
AbstractRelation.getAccessPath(IKeyOrder<E> keyOrder,
IPredicate<E> predicate) |
IAccessPath<E> |
IRelation.getAccessPath(IKeyOrder<E> keyOrder,
IPredicate<E> predicate)
|
IAccessPath<E> |
RelationFusedView.getAccessPath(IPredicate<E> predicate)
Deprecated.
|
IAccessPath<E> |
AbstractRelation.getAccessPath(IPredicate<E> predicate) |
IAccessPath<E> |
IRelation.getAccessPath(IPredicate<E> predicate)
Return the best
IAccessPath for a relation given a predicate with
zero or more unbound variables. |
IKeyOrder<E> |
RelationFusedView.getKeyOrder(IPredicate<E> predicate)
Deprecated.
|
IKeyOrder<E> |
IRelation.getKeyOrder(IPredicate<E> predicate)
Return the
IKeyOrder for the predicate corresponding to the
perfect access path. |
IAccessPath<E> |
AbstractRelation.newAccessPath(IIndexManager localIndexManager,
IPredicate<E> predicate,
IKeyOrder<E> keyOrder)
IAccessPath factory. |
Modifier and Type | Field and Description |
---|---|
protected IPredicate<R> |
AccessPath.predicate
Predicate (the resource name on the predicate is the relation namespace).
|
Modifier and Type | Method and Description |
---|---|
IPredicate<R> |
AccessPath.getPredicate() |
IPredicate<R> |
IAbstractAccessPath.getPredicate()
The constraints on the
IAccessPath . |
IPredicate<E> |
AccessPathFusedView.getPredicate()
Deprecated.
|
IPredicate<E> |
EmptyAccessPath.getPredicate()
The constraints on the
IAccessPath . |
IPredicate<E> |
ArrayAccessPath.getPredicate()
The constraints on the
IAccessPath . |
Constructor and Description |
---|
AccessPath(IRelation<R> relation,
IIndexManager localIndexManager,
IPredicate<R> predicate,
IKeyOrder<R> keyOrder) |
ArrayAccessPath(E[] e,
IPredicate<E> predicate,
IKeyOrder<E> keyOrder)
Note: the
ArrayAccessPath.getPredicate() and ArrayAccessPath.getKeyOrder() and methods
will throw an UnsupportedOperationException if the corresponding
argument is null. |
EmptyAccessPath(IPredicate<E> predicate,
IKeyOrder<E> keyOrder)
Note: the
EmptyAccessPath.getPredicate() and EmptyAccessPath.getKeyOrder() and methods
will throw an UnsupportedOperationException if the corresponding
argument is null. |
Modifier and Type | Interface and Description |
---|---|
interface |
IStarJoin<E>
Deprecated.
This is not currently supported. It was implemented, but we did
not find improved performance for it.
|
Modifier and Type | Class and Description |
---|---|
protected static class |
AbstractRuleTestCase.P |
Modifier and Type | Method and Description |
---|---|
IPredicate |
IRule.getHead()
The head of the rule -or-
null iff there is no head for
this rule. |
IPredicate |
Rule.getHead() |
IPredicate |
IRule.getTail(int index)
Return the predicate at the given index from the tail of the rule.
|
IPredicate |
Rule.getTail(int index) |
Modifier and Type | Method and Description |
---|---|
Iterator<IPredicate> |
IRule.getTail()
Iterator visits the
IPredicate s in the body (ala tail) of the
rule. |
Iterator<IPredicate> |
Rule.getTail() |
Modifier and Type | Method and Description |
---|---|
static Set<IVariable<?>> |
Rule.getSharedVars(IPredicate p1,
IPredicate p2)
Return the variables in common for two
IPredicate s. |
static Set<IVariable<?>> |
Rule.getSharedVars(IPredicate p1,
IPredicate p2)
Return the variables in common for two
IPredicate s. |
Constructor and Description |
---|
AbstractRuleTestCase.MyRule(IPredicate head,
IPredicate[] body) |
AbstractRuleTestCase.MyRule(IPredicate head,
IPredicate[] body) |
Rule(String name,
IPredicate head,
IPredicate[] tail,
IConstraint[] constraints)
Rule ctor.
|
Rule(String name,
IPredicate head,
IPredicate[] tail,
IConstraint[] constraints)
Rule ctor.
|
Rule(String name,
IPredicate head,
IPredicate[] tail,
IQueryOptions queryOptions,
IConstraint[] constraints)
Rule ctor.
|
Rule(String name,
IPredicate head,
IPredicate[] tail,
IQueryOptions queryOptions,
IConstraint[] constraints)
Rule ctor.
|
Rule(String name,
IPredicate head,
IPredicate[] tail,
IQueryOptions queryOptions,
IConstraint[] constraints,
IBindingSet constants,
IRuleTaskFactory taskFactory) |
Rule(String name,
IPredicate head,
IPredicate[] tail,
IQueryOptions queryOptions,
IConstraint[] constraints,
IBindingSet constants,
IRuleTaskFactory taskFactory) |
Rule(String name,
IPredicate head,
IPredicate[] tail,
IQueryOptions queryOptions,
IConstraint[] constraints,
IBindingSet constants,
IRuleTaskFactory taskFactory,
IVariable[] requiredVars)
Fully specified ctor.
|
Rule(String name,
IPredicate head,
IPredicate[] tail,
IQueryOptions queryOptions,
IConstraint[] constraints,
IBindingSet constants,
IRuleTaskFactory taskFactory,
IVariable[] requiredVars)
Fully specified ctor.
|
Modifier and Type | Method and Description |
---|---|
boolean |
AbstractJoinNexus.bind(IPredicate<?> pred,
IConstraint[] constraints,
Object e,
IBindingSet bindings) |
boolean |
IJoinNexus.bind(IPredicate<?> pred,
IConstraint[] constraints,
Object e,
IBindingSet bindings)
Binds variables from a visited element.
|
IConstant |
IJoinNexus.fakeBinding(IPredicate predicate,
Var var)
Return a 'fake' binding for the given variable in the specified
predicate.
|
IRelation |
AbstractJoinNexus.getHeadRelationView(IPredicate pred)
The head relation is what we write on for mutation operations and is also
responsible for minting new elements from computed
ISolution s. |
IRelation |
IJoinNexus.getHeadRelationView(IPredicate pred)
Locate and return the view of the relation identified by the
IPredicate . |
IAccessPath |
AbstractJoinNexus.getTailAccessPath(IRelation relation,
IPredicate predicate) |
IAccessPath |
IJoinNexus.getTailAccessPath(IRelation relation,
IPredicate pred)
Obtain an access path reading from relation for the specified predicate
(from the tail of some rule).
|
IRelation |
AbstractJoinNexus.getTailRelationView(IPredicate pred) |
IRelation |
IJoinNexus.getTailRelationView(IPredicate pred)
Locate and return the view of the relation(s) identified by the
IPredicate . |
Iterator<PartitionLocator> |
AbstractJoinNexus.locatorScan(AbstractScaleOutFederation<?> fed,
IPredicate<?> predicate) |
Iterator<PartitionLocator> |
IJoinNexus.locatorScan(AbstractScaleOutFederation<?> fed,
IPredicate<?> predicate)
Return an iterator visiting the
PartitionLocator for the index
partitions from which an IAccessPath must read in order to
materialize all elements which would be visited for that predicate. |
protected abstract ISortKeyBuilder<?> |
AbstractJoinNexus.newSortKeyBuilder(IPredicate<?> head)
Return the
ISortKeyBuilder used to impose DISTINCT on the
solutions generated by a query. |
protected String |
RuleStats.toString(IPredicate pred)
Return a human readable representation of the predicate.
|
Modifier and Type | Field and Description |
---|---|
protected IPredicate<?> |
JoinTask.predicate
The
IPredicate on which we are reading for this join
dimension. |
Modifier and Type | Method and Description |
---|---|
protected Map<IPredicate<?>,Collection<IBindingSet>> |
JoinTask.BindingSetConsumerTask.combineBindingSets(IBindingSet[] chunk)
Populates a map of asBound predicates paired to a set of
bindingSets.
|
Modifier and Type | Method and Description |
---|---|
protected JoinTask.AccessPathTask[] |
JoinTask.BindingSetConsumerTask.getAccessPathTasks(Map<IPredicate<?>,Collection<IBindingSet>> map)
Creates an
JoinTask.AccessPathTask for each IBindingSet in
the given chunk. |
Constructor and Description |
---|
JoinTask.AccessPathTask(IPredicate<?> predicate,
Collection<IBindingSet> bindingSets)
Evaluate an
IBindingSet for the join dimension. |
Modifier and Type | Method and Description |
---|---|
IKeyOrder |
FullTextIndex.getKeyOrder(IPredicate p) |
Modifier and Type | Method and Description |
---|---|
byte[] |
AbstractKeyOrder.getFromKey(IKeyBuilder keyBuilder,
IPredicate<E> predicate) |
byte[] |
IKeyOrder.getFromKey(IKeyBuilder keyBuilder,
IPredicate<E> predicate)
Return the inclusive lower bound which would be used for a query against
this
IKeyOrder for the given IPredicate . |
byte[] |
AbstractKeyOrder.getToKey(IKeyBuilder keyBuilder,
IPredicate<E> predicate) |
byte[] |
IKeyOrder.getToKey(IKeyBuilder keyBuilder,
IPredicate<E> predicate)
Return the exclusive upper bound which would be used for a query against
this
IKeyOrder for the given IPredicate . |
Copyright © 2006–2019 SYSTAP, LLC DBA Blazegraph. All rights reserved.