| 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.changesets | |
| 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.
|
| Class and Description |
|---|
| IChunkedIterator
An iterator that is able visit items in chunks.
|
| IKeyOrder
An interface representing the natural traversal orders for the different
indices for some class of relation.
|
| Class and Description |
|---|
| AbstractKeyOrder
Abstract base class provides default behavior for generating keys for a given
index order.
|
| IChunkedOrderedIterator
An extension of
IChunkedIterator interface that knows about natural
traversal orders and how to re-order the elements that are being visited to
support JOINs where the natural order for the access paths is different for
the left- and right-hand side of the JOIN. |
| IKeyOrder
An interface representing the natural traversal orders for the different
indices for some class of relation.
|
| Class and Description |
|---|
| IKeyOrder
An interface representing the natural traversal orders for the different
indices for some class of relation.
|
| Class and Description |
|---|
| IKeyOrder
An interface representing the natural traversal orders for the different
indices for some class of relation.
|
| Class and Description |
|---|
| IChunkedOrderedIterator
An extension of
IChunkedIterator interface that knows about natural
traversal orders and how to re-order the elements that are being visited to
support JOINs where the natural order for the access paths is different for
the left- and right-hand side of the JOIN. |
| Class and Description |
|---|
| IChunkedIterator
An iterator that is able visit items in chunks.
|
| IChunkedOrderedIterator
An extension of
IChunkedIterator interface that knows about natural
traversal orders and how to re-order the elements that are being visited to
support JOINs where the natural order for the access paths is different for
the left- and right-hand side of the JOIN. |
| IKeyOrder
An interface representing the natural traversal orders for the different
indices for some class of relation.
|
| Class and Description |
|---|
| AbstractKeyOrder
Abstract base class provides default behavior for generating keys for a given
index order.
|
| IChunkedOrderedIterator
An extension of
IChunkedIterator interface that knows about natural
traversal orders and how to re-order the elements that are being visited to
support JOINs where the natural order for the access paths is different for
the left- and right-hand side of the JOIN. |
| IKeyOrder
An interface representing the natural traversal orders for the different
indices for some class of relation.
|
| Class and Description |
|---|
| IChunkedOrderedIterator
An extension of
IChunkedIterator interface that knows about natural
traversal orders and how to re-order the elements that are being visited to
support JOINs where the natural order for the access paths is different for
the left- and right-hand side of the JOIN. |
| IKeyOrder
An interface representing the natural traversal orders for the different
indices for some class of relation.
|
| Class and Description |
|---|
| AbstractKeyOrder
Abstract base class provides default behavior for generating keys for a given
index order.
|
| IChunkConverter
This is a chunk at a time type processor.
|
| IChunkedIterator
An iterator that is able visit items in chunks.
|
| IChunkedOrderedIterator
An extension of
IChunkedIterator interface that knows about natural
traversal orders and how to re-order the elements that are being visited to
support JOINs where the natural order for the access paths is different for
the left- and right-hand side of the JOIN. |
| IKeyOrder
An interface representing the natural traversal orders for the different
indices for some class of relation.
|
| Class and Description |
|---|
| AbstractChunkedResolverator
Wraps an
IChunkedIterator and asynchronously resolves chunks. |
| IChunkedIterator
An iterator that is able visit items in chunks.
|
| IChunkedOrderedIterator
An extension of
IChunkedIterator interface that knows about natural
traversal orders and how to re-order the elements that are being visited to
support JOINs where the natural order for the access paths is different for
the left- and right-hand side of the JOIN. |
| IKeyOrder
An interface representing the natural traversal orders for the different
indices for some class of relation.
|
| Class and Description |
|---|
| IChunkedOrderedIterator
An extension of
IChunkedIterator interface that knows about natural
traversal orders and how to re-order the elements that are being visited to
support JOINs where the natural order for the access paths is different for
the left- and right-hand side of the JOIN. |
| IKeyOrder
An interface representing the natural traversal orders for the different
indices for some class of relation.
|
| Class and Description |
|---|
| IChunkedIterator
An iterator that is able visit items in chunks.
|
| IChunkedOrderedIterator
An extension of
IChunkedIterator interface that knows about natural
traversal orders and how to re-order the elements that are being visited to
support JOINs where the natural order for the access paths is different for
the left- and right-hand side of the JOIN. |
| IKeyOrder
An interface representing the natural traversal orders for the different
indices for some class of relation.
|
| Class and Description |
|---|
| IChunkedOrderedIterator
An extension of
IChunkedIterator interface that knows about natural
traversal orders and how to re-order the elements that are being visited to
support JOINs where the natural order for the access paths is different for
the left- and right-hand side of the JOIN. |
| IKeyOrder
An interface representing the natural traversal orders for the different
indices for some class of relation.
|
| Class and Description |
|---|
| IKeyOrder
An interface representing the natural traversal orders for the different
indices for some class of relation.
|
| Class and Description |
|---|
| IChunkedOrderedIterator
An extension of
IChunkedIterator interface that knows about natural
traversal orders and how to re-order the elements that are being visited to
support JOINs where the natural order for the access paths is different for
the left- and right-hand side of the JOIN. |
| IKeyOrder
An interface representing the natural traversal orders for the different
indices for some class of relation.
|
| Class and Description |
|---|
| IChunkedIterator
An iterator that is able visit items in chunks.
|
| IChunkedOrderedIterator
An extension of
IChunkedIterator interface that knows about natural
traversal orders and how to re-order the elements that are being visited to
support JOINs where the natural order for the access paths is different for
the left- and right-hand side of the JOIN. |
| IKeyOrder
An interface representing the natural traversal orders for the different
indices for some class of relation.
|
| Class and Description |
|---|
| AbstractChunkedResolverator
Wraps an
IChunkedIterator and asynchronously resolves chunks. |
| ChunkedArrayIterator
Fully buffered iterator.
|
| ChunkedOrderedStriterator
Chunked ordered streaming iterator.
|
| ChunkedStriterator
Chunked streaming iterator.
|
| IChunkConverter
This is a chunk at a time type processor.
|
| IChunkedIterator
An iterator that is able visit items in chunks.
|
| IChunkedOrderedIterator
An extension of
IChunkedIterator interface that knows about natural
traversal orders and how to re-order the elements that are being visited to
support JOINs where the natural order for the access paths is different for
the left- and right-hand side of the JOIN. |
| IChunkedOrderedStriterator
Generic-enabled streaming iterator pattern for chunked ordered iterators.
|
| IChunkedStriterator
Generic-enabled streaming iterator pattern for chunked iterators.
|
| IFilter
Stackable filter pattern with generics.
|
| IKeyOrder
An interface representing the natural traversal orders for the different
indices for some class of relation.
|
| IStriterator
Streaming iterator pattern ala Martyn Cutcher with generics.
|
| Striterator
Streaming iterator pattern.
|
Copyright © 2006–2019 SYSTAP, LLC DBA Blazegraph. All rights reserved.