Package | Description |
---|---|
com.bigdata.bop |
This package provides an API for query operators.
|
com.bigdata.bop.ap | |
com.bigdata.bop.fed.shards | |
com.bigdata.bop.mutation | |
com.bigdata.rdf.inf |
This package provides an eager closure inference engine for most of the RDF and
RDFS entailments and can be used to realize entailments for owl:sameAs, owl:equivilentClass,
and owl:equivilentProperty.
|
com.bigdata.rdf.lexicon | |
com.bigdata.rdf.rules | |
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.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.service.proxy |
This package provides implementations of proxy objects for commonly used
classes.
|
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 |
---|---|
IKeyOrder<E> |
IPredicate.getKeyOrder()
Return the
IKeyOrder override for this IPredicate by the
query optimizer. |
Modifier and Type | Method and Description |
---|---|
int |
IPredicate.getVariableCount(IKeyOrder<E> keyOrder)
The #of arguments in the predicate required for the specified
IKeyOrder which are unbound. |
boolean |
IPredicate.isFullyBound(IKeyOrder<E> keyOrder)
Figure out if all positions in the predicate which are required to form
the key for this access path are bound in the predicate.
|
Modifier and Type | Class and Description |
---|---|
static class |
R.KeyOrder
Metadata about the index orders for this relation.
|
Modifier and Type | Method and Description |
---|---|
IKeyOrder<E> |
Predicate.getKeyOrder() |
IKeyOrder<E> |
R.getKeyOrder(IPredicate<E> p) |
IKeyOrder<E> |
R.getPrimaryKeyOrder() |
Modifier and Type | Method and Description |
---|---|
Iterator<IKeyOrder<E>> |
R.getKeyOrders() |
Modifier and Type | Method and Description |
---|---|
int |
Predicate.getVariableCount(IKeyOrder<E> keyOrder) |
boolean |
Predicate.isFullyBound(IKeyOrder<E> keyOrder) |
Modifier and Type | Method and Description |
---|---|
protected IMetadataIndex |
MapBindingSetsOverShardsBuffer.getMetadataIndex(IKeyOrder<F> keyOrder)
Resolve a scale-out view of the metadata index for the target predicate.
|
protected Iterator<PartitionLocator> |
MapBindingSetsOverShardsBuffer.locatorScan(IKeyOrder<F> keyOrder,
byte[] fromKey,
byte[] toKey)
Locator scan for the index partitions for that predicate as bound.
|
Modifier and Type | Method and Description |
---|---|
IKeyOrder<E> |
InsertOp.getKeyOrder() |
Modifier and Type | Method and Description |
---|---|
IKeyOrder<ISPO> |
OwlSameAsPropertiesExpandingIterator.getKeyOrder() |
IKeyOrder<ISPO> |
BackchainOwlSameAsPropertiesSPIterator.getKeyOrder() |
IKeyOrder<ISPO> |
BackchainOwlSameAsPropertiesIterator.getKeyOrder() |
IKeyOrder<ISPO> |
BackchainOwlSameAsPropertiesPIterator.getKeyOrder() |
IKeyOrder<ISPO> |
BackchainOwlSameAsPropertiesSPOIterator.getKeyOrder() |
IKeyOrder<ISPO> |
BackchainTypeResourceIterator.getKeyOrder() |
IKeyOrder<ISPO> |
BackchainOwlSameAsPropertiesPOIterator.getKeyOrder() |
Modifier and Type | Method and Description |
---|---|
ISPO[] |
OwlSameAsPropertiesExpandingIterator.nextChunk(IKeyOrder<ISPO> keyOrder) |
ISPO[] |
BackchainOwlSameAsPropertiesSPIterator.nextChunk(IKeyOrder<ISPO> keyOrder) |
ISPO[] |
BackchainOwlSameAsPropertiesIterator.nextChunk(IKeyOrder<ISPO> keyOrder) |
ISPO[] |
BackchainOwlSameAsPropertiesPIterator.nextChunk(IKeyOrder<ISPO> keyOrder) |
ISPO[] |
BackchainOwlSameAsPropertiesSPOIterator.nextChunk(IKeyOrder<ISPO> keyOrder) |
ISPO[] |
BackchainTypeResourceIterator.nextChunk(IKeyOrder<ISPO> keyOrder) |
ISPO[] |
BackchainOwlSameAsPropertiesPOIterator.nextChunk(IKeyOrder<ISPO> keyOrder) |
Constructor and Description |
---|
OwlSameAsPropertiesExpandingIterator(IV s,
IV p,
IV o,
AbstractTripleStore db,
IV sameAs,
IKeyOrder<ISPO> keyOrder) |
Modifier and Type | Class and Description |
---|---|
class |
LexiconKeyOrder
Natural index orders for the
LexiconRelation . |
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. |
Modifier and Type | Method and Description |
---|---|
Iterator<IKeyOrder<BigdataValue>> |
LexiconRelation.getKeyOrders() |
Modifier and Type | Method and Description |
---|---|
IIndex |
LexiconRelation.getIndex(IKeyOrder<? extends BigdataValue> keyOrder)
Overridden to use local cache of the index reference.
|
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.
|
Modifier and Type | Method and Description |
---|---|
IKeyOrder<ISPO> |
BackchainAccessPath.getKeyOrder() |
Modifier and Type | Class and Description |
---|---|
class |
SPOKeyOrder
Represents the key order used by an index for a triple relation.
|
Modifier and Type | Method and Description |
---|---|
IKeyOrder<ISPO> |
SPOArrayIterator.getKeyOrder()
Deprecated.
|
Modifier and Type | Method and Description |
---|---|
Iterator<IKeyOrder<ISPO>> |
SPORelation.getKeyOrders() |
Modifier and Type | Method and Description |
---|---|
IChunkedIterator<IV> |
SPORelation.distinctMultiTermScan(IKeyOrder<ISPO> keyOrder,
IV[] knownTerms)
Efficient scan of the distinct term identifiers that appear in the first
position of the keys for the statement index corresponding to the
specified
IKeyOrder . |
IChunkedIterator<IV> |
SPORelation.distinctMultiTermScan(IKeyOrder<ISPO> keyOrder,
IV[] knownTerms,
ITermIVFilter termIdFilter)
Efficient scan of the distinct term identifiers that appear in the first
position of the keys for the statement index corresponding to the
specified
IKeyOrder . |
IChunkedIterator<IV> |
SPORelation.distinctTermScan(IKeyOrder<ISPO> keyOrder)
Efficient scan of the distinct term identifiers that appear in the first
position of the keys for the statement index corresponding to the
specified
IKeyOrder . |
IChunkedIterator<IV> |
SPORelation.distinctTermScan(IKeyOrder<ISPO> keyOrder,
byte[] fromKey,
byte[] toKey,
ITermIVFilter termIdFilter)
Efficient scan of the distinct term identifiers that appear in the first
position of the keys for the statement index corresponding to the
specified
IKeyOrder . |
IChunkedIterator<IV> |
SPORelation.distinctTermScan(IKeyOrder<ISPO> keyOrder,
ITermIVFilter filter)
Efficient scan of the distinct term identifiers that appear in the first
position of the keys for the statement index corresponding to the
specified
IKeyOrder . |
StringBuilder |
SPORelation.dump(IKeyOrder<ISPO> keyOrder)
Dumps the specified index.
|
IIndex |
SPORelation.getIndex(IKeyOrder<? extends ISPO> keyOrder)
Overridden to return the hard reference for the index, which is cached
the first time it is resolved.
|
IAccessPath<ISPO> |
SPORelation.newAccessPath(IIndexManager localIndexManager,
IPredicate<ISPO> predicate,
IKeyOrder<ISPO> keyOrder) |
ISPO[] |
SPOArrayIterator.nextChunk(IKeyOrder<ISPO> keyOrder)
Deprecated.
|
Constructor and Description |
---|
SPOAccessPath(IRelation<ISPO> relation,
IIndexManager localIndexManager,
IPredicate<ISPO> predicate,
IKeyOrder<ISPO> keyOrder) |
Modifier and Type | Method and Description |
---|---|
StringBuilder |
AbstractTripleStore.dumpStore(AbstractTripleStore resolveTerms,
boolean explicit,
boolean inferred,
boolean axioms,
boolean history,
boolean justifications,
boolean sids,
IKeyOrder<ISPO> keyOrder)
Dumps the store in a human readable format (not suitable for
interchange).
|
IAccessPath<ISPO> |
IRawTripleStore.getAccessPath(IKeyOrder<ISPO> keyOrder)
Deprecated.
by
SPORelation#getAccessPath(SPOKeyOrder, com.bigdata.relation.rule.IPredicate) |
IAccessPath<ISPO> |
AbstractTripleStore.getAccessPath(IKeyOrder<ISPO> keyOrder) |
IAccessPath<ISPO> |
AbstractTripleStore.getAccessPath(IKeyOrder<ISPO> keyOrder,
IElementFilter<ISPO> filter) |
Modifier and Type | Method and Description |
---|---|
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. |
IKeyOrder<E> |
RelationFusedView.getPrimaryKeyOrder()
Deprecated.
The value for the first relation in the view.
|
IKeyOrder<E> |
IRelation.getPrimaryKeyOrder()
Return the
IKeyOrder for the primary index for the relation. |
Modifier and Type | Method and Description |
---|---|
Iterator<IKeyOrder<E>> |
RelationFusedView.getKeyOrders()
Deprecated.
|
Iterator<IKeyOrder<E>> |
IRelation.getKeyOrders()
Return the
IKeyOrder s corresponding to the registered indices for
this relation. |
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)
|
String |
RelationFusedView.getFQN(IKeyOrder<? extends E> keyOrder)
Deprecated.
|
String |
AbstractRelation.getFQN(IKeyOrder<? extends E> keyOrder)
The fully qualified name of the index.
|
String |
IRelation.getFQN(IKeyOrder<? extends E> keyOrder)
The fully qualified name of the index.
|
static <E> String |
AbstractRelation.getFQN(IRelation<E> relation,
IKeyOrder<? extends E> keyOrder)
The fully qualified name of the index.
|
IIndex |
RelationFusedView.getIndex(IKeyOrder<? extends E> keyOrder)
Deprecated.
|
IIndex |
AbstractRelation.getIndex(IKeyOrder<? extends E> keyOrder)
Return the index for the
IKeyOrder the timestamp for this view of
the relation. |
IIndex |
IRelation.getIndex(IKeyOrder<? extends E> keyOrder)
Return the index for associated with the specified
IKeyOrder this
view of the relation. |
IAccessPath<E> |
AbstractRelation.newAccessPath(IIndexManager localIndexManager,
IPredicate<E> predicate,
IKeyOrder<E> keyOrder)
IAccessPath factory. |
Modifier and Type | Field and Description |
---|---|
protected IKeyOrder<R> |
AccessPath.keyOrder
Index order (the relation namespace plus the index order and the option
partitionId constraint on the predicate identify the index).
|
Modifier and Type | Method and Description |
---|---|
IKeyOrder<R> |
AccessPath.getKeyOrder() |
IKeyOrder<E> |
ChunkConsumerIterator.getKeyOrder() |
IKeyOrder<E> |
AccessPathFusedView.getKeyOrder()
Deprecated.
|
IKeyOrder<R> |
IAccessPath.getKeyOrder()
The order in which the elements will be visited.
|
protected IKeyOrder<R> |
AbstractElementBuffer.getKeyOrder()
The natural order in which the elements will appear in the buffer -or-
null if you do not have a strong guarentee for
that order (from the ctor). |
IKeyOrder<E> |
EmptyAccessPath.getKeyOrder()
The order in which the elements will be visited.
|
IKeyOrder<E> |
ArrayAccessPath.getKeyOrder()
The order in which the elements will be visited.
|
Modifier and Type | Method and Description |
---|---|
E[] |
ChunkConsumerIterator.nextChunk(IKeyOrder<E> keyOrder) |
Constructor and Description |
---|
AbstractElementBuffer.DeleteBuffer(int capacity,
IMutableRelation<R> relation,
IKeyOrder<R> keyOrder,
IElementFilter<R> filter)
Ctor variant used when you have a strong guarantee of the
order in which the elements will be written into the buffer.
|
AbstractElementBuffer.InsertBuffer(int capacity,
IMutableRelation<R> relation,
IKeyOrder<R> keyOrder,
IElementFilter<R> filter)
Ctor variant used when you have a strong guarantee of the
order in which the elements will be written into the buffer.
|
AbstractElementBuffer(int capacity,
IMutableRelation<R> relation,
IKeyOrder<R> keyOrder,
IElementFilter<R> filter) |
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. |
ChunkConsumerIterator(ICloseableIterator<E[]> src,
IKeyOrder<E> keyOrder) |
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. |
UnsynchronizedUnboundedChunkBuffer(int capacity,
Class<? extends E> cls,
IElementFilter<E> filter,
IKeyOrder<E> keyOrder) |
Modifier and Type | Field and Description |
---|---|
IKeyOrder[] |
RuleStats.keyOrder
An array of the
IKeyOrder that was used for each predicate in the
tail of the rule. |
Modifier and Type | Method and Description |
---|---|
protected IKeyOrder[] |
RuleState.computeKeyOrderForEachTail(IRule rule,
IJoinNexus joinNexus,
int[] order,
int[] nvars)
Return an array indicating the
IKeyOrder that will be used when
reading on each of the tail predicates. |
IKeyOrder[] |
RuleState.getKeyOrder() |
IKeyOrder[] |
IRuleState.getKeyOrder()
An array of the
IKeyOrder that will be used for each predicate in
the tail of the rule. |
Constructor and Description |
---|
SolutionComparator(IKeyOrder<E> keyOrder) |
Constructor and Description |
---|
DistributedJoinTask(IRule rule,
IJoinNexus joinNexus,
int[] order,
int orderIndex,
int partitionId,
AbstractScaleOutFederation<?> fed,
IJoinMaster master,
UUID masterUUID,
IAsynchronousIterator<IBindingSet[]> src,
IKeyOrder[] keyOrders,
DataService dataService,
IVariable[][] requiredVars) |
JoinTaskFactoryTask(String scaleOutIndexName,
IRule rule,
IJoinNexusFactory joinNexusFactory,
int[] order,
int orderIndex,
int partitionId,
IJoinMaster masterProxy,
UUID masterUUID,
IAsynchronousIterator<IBindingSet[]> sourceItrProxy,
IKeyOrder[] keyOrders,
IVariable[][] requiredVars) |
Modifier and Type | Method and Description |
---|---|
IKeyOrder |
FullTextIndex.getKeyOrder(IPredicate p) |
IKeyOrder |
FullTextIndex.getPrimaryKeyOrder() |
Modifier and Type | Method and Description |
---|---|
IKeyOrder<E> |
RemoteChunk.getKeyOrder() |
IKeyOrder<E> |
WrappedRemoteChunkedIterator.getKeyOrder() |
IKeyOrder<E> |
IRemoteChunk.getKeyOrder()
The natural sort orded of the elements in this chunk -or-
null if the elements are not in any known order. |
Modifier and Type | Method and Description |
---|---|
E[] |
WrappedRemoteChunkedIterator.nextChunk(IKeyOrder<E> keyOrder) |
Constructor and Description |
---|
RemoteChunk(boolean exhausted,
IStreamSerializer<E[]> serializer,
IKeyOrder<E> keyOrder,
E[] a) |
RemoteChunkedIterator(IAsynchronousIterator<E[]> sourceIterator,
IStreamSerializer<E[]> serializer,
IKeyOrder<E> keyOrder) |
Modifier and Type | Class and Description |
---|---|
class |
AbstractKeyOrder<E>
Abstract base class provides default behavior for generating keys for a given
index order.
|
Modifier and Type | Field and Description |
---|---|
protected IKeyOrder<F> |
ChunkedFilter.keyOrder
The natural order of the filtered chunks.
|
Modifier and Type | Method and Description |
---|---|
IKeyOrder<E> |
ChunkedArraysIterator.getKeyOrder() |
IKeyOrder<R> |
IChunkedOrderedIterator.getKeyOrder()
The natural order in which elements are being visited.
|
IKeyOrder<E> |
EmptyChunkedIterator.getKeyOrder() |
IKeyOrder<E> |
ChunkedOrderedStriterator.getKeyOrder() |
IKeyOrder<E> |
ChunkedArrayIterator.getKeyOrder() |
IKeyOrder<E> |
DelegateChunkedIterator.getKeyOrder() |
IKeyOrder<E> |
ChunkedWrappedIterator.getKeyOrder() |
IKeyOrder<E> |
ChunkedResolvingIterator.getKeyOrder() |
IKeyOrder<F> |
ChunkedConvertingIterator.getKeyOrder() |
Modifier and Type | Method and Description |
---|---|
E[] |
ChunkedArraysIterator.nextChunk(IKeyOrder<E> keyOrder) |
E[] |
EmptyChunkedIterator.nextChunk(IKeyOrder<E> keyOrder) |
E[] |
ChunkedOrderedStriterator.nextChunk(IKeyOrder<E> keyOrder) |
E[] |
ChunkedArrayIterator.nextChunk(IKeyOrder<E> keyOrder) |
E[] |
DelegateChunkedIterator.nextChunk(IKeyOrder<E> keyOrder) |
E[] |
ChunkedWrappedIterator.nextChunk(IKeyOrder<E> keyOrder) |
E[] |
ChunkedResolvingIterator.nextChunk(IKeyOrder<E> keyOrder) |
F[] |
ChunkedConvertingIterator.nextChunk(IKeyOrder<F> keyOrder) |
R[] |
IChunkedOrderedIterator.nextChunk(IKeyOrder<R> keyOrder)
Return the next "chunk" of elements.
|
Constructor and Description |
---|
ChunkedArrayIterator(int n,
E[] a,
IKeyOrder<E> keyOrder)
An iterator that visits the elements in the given array.
|
ChunkedArraysIterator(ICloseableIterator<E[]> a,
IKeyOrder<E> keyOrder)
An iterator that visits the elements in the given iterator of arrays.
|
ChunkedConvertingIterator(IChunkedOrderedIterator<E> src,
IChunkConverter<E,F> converter,
IKeyOrder<F> keyOrder)
Variant ctor when you are also converting the element type.
|
ChunkedFilter(Object state,
IKeyOrder<F> keyOrder) |
ChunkedResolvingIterator(IChunkedOrderedIterator<S> src,
IKeyOrder<E> keyOrder)
Ctor variant when (a) you KNOW the sort order for the source iterator and
(b) the source elements and the resolved elements have the same natural
sort order (so the sort order is naturally preserved when the elements
are resolved).
|
ChunkedWrappedIterator(Iterator<E> src,
int chunkSize,
Class<? extends E> elementClass,
IKeyOrder<E> keyOrder,
IElementFilter<E> filter)
Create an iterator that reads from the source.
|
ChunkedWrappedIterator(Iterator<E> src,
int chunkSize,
IKeyOrder<E> keyOrder,
IElementFilter<E> filter) |
Chunkerator(Iterator<E> src,
int chunkSize,
Class<? extends E> elementClass,
IKeyOrder<E> keyOrder,
IElementFilter<E> filter) |
EmptyChunkedIterator(IKeyOrder<E> keyOrder) |
Resolver(int chunkSize,
IKeyOrder<F> keyOrder) |
SingleValueChunkedIterator(E e,
IKeyOrder<E> keyOrder) |
Copyright © 2006–2019 SYSTAP, LLC DBA Blazegraph. All rights reserved.