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.btree.filter | |
com.bigdata.btree.isolation | |
com.bigdata.btree.view | |
com.bigdata.counters.store |
This package provides a persistence mechanism for performance
counters.
|
com.bigdata.journal |
The journal is an append-only persistence capable data structure
supporting atomic commit, named indices, and transactions.
|
com.bigdata.mdi |
This package provides a metadata index and range partitioned indices
managed by that metadata index.
|
com.bigdata.rdf.sail |
This package contains the SAIL that allow bigdata to be used as a backend for
the Sesame 2.x platform.
|
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.service |
This package provides implementations of bigdata services (metadata
service, data service, transaction manager service.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractBTreeTupleCursor<I extends AbstractBTree,L extends Leaf,E>
Class supporting random access to tuples and sequential tuple-based cursor
movement for an
AbstractBTree . |
Modifier and Type | Class and Description |
---|---|
class |
BTree
This class implements a variant of a B+Tree in which all values are stored in
leaves, but the leaves are not connected with prior-next links.
|
class |
IndexSegment
An index segment is read-only btree corresponding to some key range of a
potentially distributed index.
|
Modifier and Type | Field and Description |
---|---|
protected I |
AbstractBTreeTupleCursor.btree
From the ctor.
|
protected AbstractBTree |
AbstractNode.btree
The BTree.
|
Modifier and Type | Method and Description |
---|---|
AbstractBTree |
ILeafCursor.getBTree()
The backing B+Tree.
|
AbstractBTree[] |
ILocalBTreeView.getSources()
An array containing the ordered sources in the view.
|
AbstractBTree[] |
BTree.getSources()
An array containing this
BTree . |
AbstractBTree[] |
ReadCommittedView.getSources() |
AbstractBTree[] |
IndexSegment.getSources() |
Modifier and Type | Method and Description |
---|---|
Leaf |
IndexSegmentBuilder.NOPNodeFactory.allocLeaf(AbstractBTree btree,
long addr,
ILeafData data) |
Leaf |
BTree.NodeFactory.allocLeaf(AbstractBTree btree,
long addr,
ILeafData data) |
Leaf |
INodeFactory.allocLeaf(AbstractBTree btree,
long addr,
ILeafData data)
Create a leaf.
|
Leaf |
IndexSegment.ImmutableNodeFactory.allocLeaf(AbstractBTree btree,
long addr,
ILeafData data) |
Node |
IndexSegmentBuilder.NOPNodeFactory.allocNode(AbstractBTree btree,
long addr,
INodeData data) |
Node |
BTree.NodeFactory.allocNode(AbstractBTree btree,
long addr,
INodeData data) |
Node |
INodeFactory.allocNode(AbstractBTree btree,
long addr,
INodeData data)
Create a node.
|
Node |
IndexSegment.ImmutableNodeFactory.allocNode(AbstractBTree btree,
long addr,
INodeData data) |
static void |
AbstractBTreeTestCase.assertSameBTree(AbstractBTree expected,
IIndex actual)
A suite of tests designed to verify that one btree correctly represents
the information present in a ground truth btree.
|
protected void |
AbstractTupleCursorTestCase.doBaseCaseTest(AbstractBTree btree)
Test helper tests first(), last(), next(), prior(), and seek() given a
B+Tree that has been pre-populated with some known tuples.
|
protected void |
AbstractTupleCursorTestCase.doEmptyIndexTest(AbstractBTree btree)
Test helper tests for fence posts when the index is empty
|
protected void |
AbstractTupleCursorTestCase.doOneTupleTest(AbstractBTree btree)
Test helper for fence posts when there is only a single tuple.
|
static void |
AbstractBTreeTestCase.doRandomIndexOfTest(String label,
AbstractBTree btree,
byte[][] keys,
byte[][] vals)
Tests the performance of random lookups of keys and values by entry
index.
|
protected void |
AbstractTupleCursorTestCase.doReverseTraversalTest(AbstractBTree btree)
Unit test for reverse traversal under a variety of edge cases.
|
static void |
DumpIndex.dumpIndex(AbstractBTree ndx,
boolean showTuples)
Utility method using an
ITupleIterator to dump the keys and
values in an AbstractBTree . |
static void |
AbstractBTreeTestCase.getKeysAndValues(AbstractBTree btree,
byte[][] keys,
byte[][] vals)
Extract all keys and values from the btree in key order.
|
protected ITupleCursor2<String> |
AbstractTupleCursorTestCase.newCursor(AbstractBTree btree)
Create an appropriate cursor instance for the given B+Tree.
|
protected ITupleCursor2<String> |
TestIndexSegmentCursors.newCursor(AbstractBTree btree,
int flags,
byte[] fromKey,
byte[] toKey) |
protected ITupleCursor2<String> |
TestMutableBTreeCursors.newCursor(AbstractBTree btree,
int flags,
byte[] fromKey,
byte[] toKey) |
protected abstract ITupleCursor2<String> |
AbstractTupleCursorTestCase.newCursor(AbstractBTree btree,
int flags,
byte[] fromKey,
byte[] toKey)
Create an appropriate cursor instance for the given B+Tree.
|
protected ITupleCursor2<String> |
TestReadOnlyBTreeCursors.newCursor(AbstractBTree btree,
int flags,
byte[] fromKey,
byte[] toKey) |
void |
BTreePageStats.visit(AbstractBTree btree,
AbstractNode<?> node) |
AbstractNode<?> |
NodeSerializer.wrap(AbstractBTree btree,
long addr,
IAbstractNodeData data)
|
Constructor and Description |
---|
AbstractNode(AbstractBTree btree,
boolean dirty)
All constructors delegate to this constructor to set the btree and
branching factor and to compute the minimum and maximum #of keys for the
node.
|
BTreeStatistics(AbstractBTree btree) |
IndexSegment.ImmutableNodeFactory.ImmutableLeaf(AbstractBTree btree)
Ctor used when the
IndexSegment is empty (no tuples) to
create an empty (and immutable) root leaf. |
IndexSegment.ImmutableNodeFactory.ImmutableLeaf(AbstractBTree btree,
long addr,
ILeafData data) |
IndexSegment.ImmutableNodeFactory.ImmutableNode(AbstractBTree btree,
long addr,
INodeData data) |
Leaf(AbstractBTree btree)
Creates a new mutable leaf.
|
Leaf(AbstractBTree btree,
long addr,
ILeafData data)
De-serialization constructor.
|
Node(AbstractBTree btree,
long addr,
INodeData data)
De-serialization constructor.
|
Tuple(AbstractBTree btree,
int flags) |
Modifier and Type | Method and Description |
---|---|
protected ITupleCursor2<String> |
TestReverserator.newCursor(AbstractBTree btree,
int flags,
byte[] fromKey,
byte[] toKey) |
protected ITupleCursor2<String> |
TestRemoverator.newCursor(AbstractBTree btree,
int flags,
byte[] fromKey,
byte[] toKey) |
Modifier and Type | Method and Description |
---|---|
void |
IsolatedFusedView.mergeDown(long revisionTime,
AbstractBTree[] groundStateSources)
Merge the transaction scope index onto the then current unisolated index.
|
boolean |
IsolatedFusedView.validate(AbstractBTree[] groundStateSources)
Validate changes made to the index within a transaction against the last
committed state of the index in the global scope.
|
Constructor and Description |
---|
IsolatedFusedView(long timestamp,
AbstractBTree[] sources)
Constructor may be used either for a fully isolated transaction or an
unisolated operation.
|
Modifier and Type | Method and Description |
---|---|
AbstractBTree[] |
FusedView.getSources() |
Constructor and Description |
---|
FusedView(AbstractBTree[] srcs) |
FusedView(AbstractBTree src1,
AbstractBTree src2) |
Modifier and Type | Class and Description |
---|---|
class |
CounterSetBTree
An API encapsulating for writing and querying counter sets.
|
Modifier and Type | Class and Description |
---|---|
class |
CommitRecordIndex
BTree mapping commit times to
ICommitRecord s. |
class |
Name2Addr
Name2Addr is a BTree mapping index names to an Name2Addr.Entry
containing the last Checkpoint record committed for the named index
and the timestamp of that commit. |
static class |
TestRestartSafe.MyBTree |
Modifier and Type | Method and Description |
---|---|
AbstractBTree[] |
IResourceManager.getIndexSources(String name,
long timestamp)
Return the ordered
AbstractBTree sources for an index or a view
of an index partition. |
AbstractBTree[] |
Journal.getIndexSources(String name,
long timestamp)
Always returns an array containing a single
BTree which is the
BTree loaded from the commit record whose commit timestamp is
less than or equal to timestamp -or- null if there
are no ICommitRecord s that satisfy the probe or if the named
index was not registered as of that timestamp. |
AbstractBTree[] |
IResourceManager.getIndexSources(String name,
long timestamp,
BTree btree)
Examine the partition metadata (if any) for the
BTree . |
AbstractBTree[] |
Journal.getIndexSources(String name,
long timestamp,
BTree btree)
Always returns the
BTree as the sole element of the array since
partitioned indices are not supported. |
Modifier and Type | Class and Description |
---|---|
class |
MetadataIndex
A metadata index for the partitions of a distributed index.
|
Constructor and Description |
---|
MetadataIndexView(AbstractBTree delegate) |
Modifier and Type | Class and Description |
---|---|
static class |
TestMROWTransactions.MyBTree
Helper class for force abort of a B+Tree write.
|
Modifier and Type | Class and Description |
---|---|
class |
IndexSegmentIndex
|
class |
JournalIndex
BTree mapping IJournal createTimes (long integers)
to JournalMetadata records describing the IJournal . |
Modifier and Type | Method and Description |
---|---|
AbstractBTree |
IndexManager.getIndexOnStore(String name,
long timestamp,
IRawStore store)
Return a reference to the named index as of the specified timestamp on
the identified resource.
|
AbstractBTree[] |
IndexManager.getIndexSources(String name,
long timestamp) |
AbstractBTree[] |
IndexManager.getIndexSources(String name,
long timestamp,
BTree btree) |
Constructor and Description |
---|
BuildResult(String name,
boolean compactingMerge,
AbstractBTree[] sources,
IndexMetadata indexMetadata,
SegmentMetadata segmentMetadata,
IndexSegmentBuilder builder) |
Modifier and Type | Class and Description |
---|---|
class |
CommitTimeIndex
BTree whose keys are commit times. |
static class |
EventReceiver.EventBTree
|
class |
TxId2CommitTimeIndex
|
Copyright © 2006–2019 SYSTAP, LLC DBA Blazegraph. All rights reserved.