Package | Description |
---|---|
com.bigdata.btree |
The
BTree is a scalable B+-Tree with copy-on-write
semantics mapping variable length unsigned byte[] keys to variable
length byte[] values (null values are allowed). |
com.bigdata.rdf.spo |
This package defines a statement model using long term identifiers rather than
RDF Value objects.
|
com.bigdata.resources |
This package provides the logic to managed the live journal and the
historical journals and index segments for a
DataService . |
com.bigdata.sparse |
This package provides support for treating normal B+Trees using a
"sparse row store" pattern and can be applied to both local B+Trees
and scale-out indices.
|
Modifier and Type | Method and Description |
---|---|
protected IndexSegment |
TestIndexSegmentCursors.buildIndexSegment(BTree btree)
Builds an
IndexSegment from a BTree . |
protected IndexSegment |
TestIndexSegmentCursors.buildIndexSegment(BTree btree,
int m) |
IndexSegment |
IndexSegment.ImmutableLeafCursor.getBTree() |
IndexSegment |
IndexSegmentStore.loadIndexSegment()
Load the
IndexSegment . |
Modifier and Type | Method and Description |
---|---|
protected void |
AbstractIndexSegmentTestCase.dumpIndexSegment(IndexSegment seg)
apply dump() as a structural validation of the tree.
|
byte[] |
ISimpleSplitHandler.getSeparatorKey(IndexSegment seg,
int fromIndex,
int toIndex,
int splitAt)
Return a separator key close to the recommended separator key
(splitAt) which is acceptable to the constraints imposed by the
application on the index.
|
byte[] |
FixedLengthPrefixSplits.getSeparatorKey(IndexSegment seg,
int fromIndex,
int toIndex,
int splitAt)
Linear search for the first successor of the keyAt(splitAt) which
differs in the first N bytes.
|
static void |
AbstractIndexSegmentTestCase.testForwardScan(IndexSegment seg)
Test forward leaf scan.
|
static void |
AbstractIndexSegmentTestCase.testMultiBlockIterator(BTree expected,
IndexSegment actual)
Compares the
IndexSegmentMultiBlockIterator against the standard
BTree iterator. |
static void |
AbstractIndexSegmentTestCase.testReverseScan(IndexSegment seg)
Test reverse leaf scan.
|
Constructor and Description |
---|
IndexSegment.IndexSegmentTupleCursor(IndexSegment btree,
Tuple<E> tuple,
byte[] fromKey,
byte[] toKey) |
IndexSegmentMultiBlockIterator(IndexSegment seg,
DirectBufferPool pool,
byte[] fromKey,
byte[] toKey,
int flags) |
Modifier and Type | Method and Description |
---|---|
byte[] |
XXXCShardSplitHandler.getSeparatorKey(IndexSegment seg,
int fromIndex,
int toIndex,
int splitAt)
Return a separator key which does not split quads for the same triple
prefix.
|
Modifier and Type | Method and Description |
---|---|
byte[] |
AbstractTestSegSplitter.RejectSplitsAfterKey.getSeparatorKey(IndexSegment seg,
int fromIndex,
int toIndex,
int splitAt) |
static Split[] |
SplitUtility.getSplits(IPartitionIdFactory partitionIdFactory,
LocalPartitionMetadata oldpmd,
IndexSegment seg,
long nominalShardSize,
ISimpleSplitHandler splitHandler)
Choose a set of splits which may be reasonably expected to divide the
IndexSegment into extents each of which is approximately 50%
full. |
Modifier and Type | Method and Description |
---|---|
byte[] |
LogicalRowSplitHandler.getSeparatorKey(IndexSegment seg,
int fromIndex,
int toIndex,
int splitAt) |
Copyright © 2006–2019 SYSTAP, LLC DBA Blazegraph. All rights reserved.