Package | Description |
---|---|
com.bigdata.bop.ap | |
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.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.search |
This package provides full text indexing and search.
|
Modifier and Type | Class and Description |
---|---|
class |
R
Test relation composed of
E elements with a single primary index. |
Modifier and Type | Class and Description |
---|---|
class |
BigdataSubjectCentricFullTextIndex
Implementation based on the built-in keyword search capabilities for bigdata.
|
class |
BigdataValueCentricFullTextIndex
Implementation based on the built-in keyword search capabilities for bigdata.
|
class |
LexiconRelation
The
LexiconRelation handles all things related to the indices mapping
external RDF Value s onto IV s (internal values)s and provides
methods for efficient materialization of external RDF Value s from
IV s. |
Modifier and Type | Method and Description |
---|---|
IBuffer<ISolution[]> |
RDFJoinNexus.newInsertBuffer(IMutableRelation relation)
Overridden to handle justifications when using truth maintenance.
|
Constructor and Description |
---|
RDFJoinNexus.InsertSPOAndJustificationBuffer(int capacity,
IMutableRelation<E> relation) |
Modifier and Type | Class and Description |
---|---|
class |
SPORelation
The
SPORelation handles all things related to the indices
representing the triples stored in the database. |
Modifier and Type | Class and Description |
---|---|
class |
AbstractRelation<E>
Base class for
IRelation and IMutableRelation impls. |
Modifier and Type | Method and Description |
---|---|
protected IMutableRelation<R> |
AbstractElementBuffer.getRelation() |
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) |
Modifier and Type | Method and Description |
---|---|
protected IMutableRelation<R> |
AbstractSolutionBuffer.getRelation() |
Modifier and Type | Method and Description |
---|---|
IBuffer<ISolution[]> |
AbstractJoinNexus.newDeleteBuffer(IMutableRelation relation)
Return a thread-safe buffer onto which chunks of computed
ISolution s will be written. |
IBuffer<ISolution[]> |
IJoinNexus.newDeleteBuffer(IMutableRelation relation)
Return a thread-safe buffer onto which chunks of computed
ISolution s will be written. |
IBuffer<ISolution[]> |
AbstractJoinNexus.newInsertBuffer(IMutableRelation relation)
Return a thread-safe buffer onto which chunks of computed
ISolution s will be written. |
IBuffer<ISolution[]> |
IJoinNexus.newInsertBuffer(IMutableRelation relation)
Return a thread-safe buffer onto which chunks of computed
ISolution s will be written. |
Constructor and Description |
---|
AbstractSolutionBuffer.DeleteSolutionBuffer(int capacity,
IMutableRelation<E> relation) |
AbstractSolutionBuffer.InsertSolutionBuffer(int capacity,
IMutableRelation<E> relation) |
AbstractSolutionBuffer(int capacity,
IMutableRelation<R> relation) |
Modifier and Type | Class and Description |
---|---|
class |
FullTextIndex<V extends Comparable<V>>
Full text indexing and search support.
|
Copyright © 2006–2019 SYSTAP, LLC DBA Blazegraph. All rights reserved.