Uses of Class
com.bigdata.btree.BTree

Packages that use BTree

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.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.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.service	This package provides implementations of bigdata services (metadata service, data service, transaction manager service.

Uses of BTree in com.bigdata.btree

Methods in com.bigdata.btree that return BTree

Modifier and Type	Method and Description
BTree	BTree.asReadOnly() Returns an immutable view of this BTree.
static BTree	BTree.create(IRawStore store, IndexMetadata metadata) Create a new BTree or derived class.
static BTree	BTree.createTransient(IndexMetadata metadata) Create a new BTree or derived class that is fully transient (NO backing IRawStore).
protected static BTree	AbstractBTreeTestCase.doInsertKeySequenceTest(BTree btree, int[] keys, SimpleEntry[] entries, int[] order, int trace) Insert key value pairs into the tree in the specified order and verify the expected entry traversal afterwards.
static BTree	AbstractBTreeTestCase.doInsertRandomKeySequenceTest(BTree btree, int[] keys, SimpleEntry[] entries, int trace) Insert key value pairs into the tree in a random order and verify the expected entry traversal afterwards.
BTree	AbstractBTreeTestCase.doInsertRandomKeySequenceTest(BTree btree, int ninserts, int trace) Insert dense key-value pairs into the tree in a random order and verify the expected entry traversal afterwards.
static BTree	AbstractBTreeTestCase.doInsertRandomSparseKeySequenceTest(BTree btree, int ninserts, int trace) Insert a sequence of monotonically increase keys with random spacing into a tree in a random order and verify the expected entry traversal afterwards.
BTree	AbstractBTreeTestCase.doSplitWithRandomDenseKeySequence(BTree btree, int m, int ninserts) Creates a sequence of dense keys in random order and inserts them into the tree.
protected BTree	AbstractTupleCursorTestCase.getBaseCaseBTree() Return a B+Tree populated with data for AbstractTupleCursorTestCase.doBaseCaseTest(AbstractBTree).
BTree	BTree.LeafCursor.getBTree()
BTree	AbstractBTreeTestCase.getBTree(int branchingFactor) Return a new btree backed by a simple transient store that will NOT evict leaves or nodes onto the store.
BTree	TestIndexSegmentBuilderWithLargeTrees.getBTree(int branchingFactor) Return a BTree backed by a journal with the indicated branching factor.
BTree	TestIndexSegmentWithBloomFilter.getBTree(int branchingFactor, BloomFilterFactory bloomFilterFactory) Return a btree backed by a journal with the indicated branching factor.
BTree	TestBTreeWithBloomFilter.getBTree(int branchingFactor, boolean bloomFilter) Return a btree backed by a journal with the indicated branching factor.
protected BTree	TestIncrementalWrite.getBTree(int branchingFactor, int queueCapacity, int queueScan)
BTree	AbstractBTreeTestCase.getBTree(int branchingFactor, ITupleSerializer tupleSer)
BTree	ILocalBTreeView.getMutableBTree() The BTree that is absorbing writes for the view.
BTree	BTree.getMutableBTree()
BTree	ReadCommittedView.getMutableBTree()
BTree	IndexSegment.getMutableBTree()
protected BTree	AbstractTupleCursorTestCase.getOneTupleBTree() Creates, populates and returns a BTree for AbstractTupleCursorTestCase.doOneTupleTest(AbstractBTree)
BTree	TestIndexSegmentBuilderWithSmallTree.getProblem1() Create, populate, and return a btree with a branching factor of (3) and ten sequential keys [1:10].
BTree	TestBTreeLeafCursors.getProblem1() Create, populate, and return a btree with a branching factor of (3) and ten sequential keys [1:10].
BTree	TestIndexSegmentBuilderWithSmallTree.getProblem2() Create, populate, and return a btree with a branching factor of (3) and nine sequential keys [1:9].
BTree	TestIndexSegmentBuilderWithSmallTree.getProblem3() Create, populate, and return a btree with a branching factor of (3) and 20 sequential keys [1:20].
protected BTree	AbstractTupleCursorTestCase.getReverseTraversalBTree() Return a B+Tree populated with data for AbstractTupleCursorTestCase.doReverseTraversalTest(AbstractBTree).
static BTree	BTree.load(IRawStore store, long addrCheckpoint, boolean readOnly) Load an instance of a BTree or derived class from the store.

Methods in com.bigdata.btree with parameters of type BTree

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)
protected IndexSegmentCheckpoint	TestIndexSegmentBuilderWithSmallTree.doBuildAndDiscardCache(BTree btree, int m)
protected IndexSegmentCheckpoint	TestIndexSegmentBuilderWithBlobCapacity.doBuildAndDiscardCache(BTree btree, int m)
protected IndexSegmentCheckpoint	TestIndexSegmentBuilder_EmptyIndex.doBuildAndDiscardCache(BTree btree, int m)
void	TestIndexSegmentBuilderWithLargeTrees.doBuildIndexSegmentAndCompare(BTree btree) Test helper builds an index segment from the btree using several different branching factors and each time compares the resulting total ordering to the original btree.
void	TestIndexSegmentWithBloomFilter.doBuildIndexSegmentAndCompare(BTree btree) Test helper builds an index segment from the btree using several different branching factors and each time compares the resulting total ordering to the original btree.
protected int	TestChunkedIterators.doDeserializationTest(BTree ndx, byte[] fromKey, byte[] toKey, int capacity, int flags, IFilter filterCtor) Test helper requests an ITupleIterator using the specified parameters directly on the BTree (ground truth for the purposes of this test) and indirectly via an AbstractChunkedTupleIterator.
protected static BTree	AbstractBTreeTestCase.doInsertKeySequenceTest(BTree btree, int[] keys, SimpleEntry[] entries, int[] order, int trace) Insert key value pairs into the tree in the specified order and verify the expected entry traversal afterwards.
static BTree	AbstractBTreeTestCase.doInsertRandomKeySequenceTest(BTree btree, int[] keys, SimpleEntry[] entries, int trace) Insert key value pairs into the tree in a random order and verify the expected entry traversal afterwards.
BTree	AbstractBTreeTestCase.doInsertRandomKeySequenceTest(BTree btree, int ninserts, int trace) Insert dense key-value pairs into the tree in a random order and verify the expected entry traversal afterwards.
static BTree	AbstractBTreeTestCase.doInsertRandomSparseKeySequenceTest(BTree btree, int ninserts, int trace) Insert a sequence of monotonically increase keys with random spacing into a tree in a random order and verify the expected entry traversal afterwards.
static void	AbstractBTreeTestCase.doKnownKeySequenceTest(BTree btree, int[] order, int trace) Present a known sequence.
protected void	AbstractBTreeTestCase.doRandomKeyInsertTest(BTree btree, int[] keys, SimpleEntry[] entries, int[] order)
void	AbstractBTreeTestCase.doSplitWithDecreasingKeySequence(BTree btree, int m, int ninserts) Creates a sequence of keys in decreasing order and inserts them into the tree.
void	AbstractBTreeTestCase.doSplitWithIncreasingKeySequence(BTree btree, int m, int ninserts) Test helper for #test_splitRootLeaf_increasingKeySequence().
BTree	AbstractBTreeTestCase.doSplitWithRandomDenseKeySequence(BTree btree, int m, int ninserts) Creates a sequence of dense keys in random order and inserts them into the tree.
static void	AbstractIndexSegmentTestCase.testMultiBlockIterator(BTree expected, IndexSegment actual) Compares the IndexSegmentMultiBlockIterator against the standard BTree iterator.

Constructors in com.bigdata.btree with parameters of type BTree

Constructor and Description
AbstractBTreeTupleCursor.MutableBTreeTupleCursor(BTree btree, Tuple<E> tuple, byte[] fromKey, byte[] toKey)
AbstractBTreeTupleCursor.ReadOnlyBTreeTupleCursor(BTree btree, Tuple<E> tuple, byte[] fromKey, byte[] toKey)
BTree.Counter(BTree btree)
Checkpoint(BTree btree) Creates a Checkpoint record from a BTree.
DelegateBTree(BTree btree)
Node(BTree btree) Used to create a new node when a node is split.
Node(BTree btree, AbstractNode oldRoot, long nentries) This constructor is used when splitting the a root Leaf or a root Node.
UnisolatedReadWriteIndex(BTree ndx) Creates a view of an unisolated index that will enforce the concurrency constraints of the BTree class, but only among other instances of this class for the same underlying index.
UnisolatedReadWriteIndex(BTree ndx, int defaultCapacity) Creates a view of an unisolated index that will enforce the concurrency constraints of the BTree class, but only among other instances of this class for the same underlying index.

Uses of BTree in com.bigdata.btree.isolation

Methods in com.bigdata.btree.isolation that return BTree

Modifier and Type	Method and Description
BTree	IsolatedFusedView.getWriteSet() The isolated write set (the place where we record the intention of the transaction).

Uses of BTree in com.bigdata.btree.view

Methods in com.bigdata.btree.view that return BTree

Modifier and Type	Method and Description
BTree	FusedView.getMutableBTree()

Uses of BTree in com.bigdata.counters.store

Subclasses of BTree in com.bigdata.counters.store

Modifier and Type	Class and Description
class	CounterSetBTree An API encapsulating for writing and querying counter sets.

Uses of BTree in com.bigdata.journal

Subclasses of BTree in com.bigdata.journal

Modifier and Type	Class and Description
class	CommitRecordIndex BTree mapping commit times to ICommitRecords.
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

Methods in com.bigdata.journal that return BTree

Modifier and Type	Method and Description
BTree	TestCommitList.getBTree(int branchingFactor, Journal journal) Return a btree backed by a journal with the indicated branching factor.
BTree	TestRestartSafe.getBTree(int branchingFactor, Journal journal) Return a btree backed by a journal with the indicated branching factor.
BTree	TemporaryStore.getIndex(String name)
BTree	AbstractJournal.getIndex(String name) Return the mutable view of the named index (aka the "live" or ITx.UNISOLATED index).
BTree	TemporaryStore.getIndex(String name, long timestamp)
BTree	TemporaryStore.registerIndex(String name, BTree btree)
BTree	AbstractJournal.registerIndex(String name, BTree ndx)
BTree	TemporaryStore.registerIndex(String name, IndexMetadata metadata)
BTree	AbstractJournal.registerIndex(String name, IndexMetadata metadata) Deprecated. by AbstractJournal.register(String, IndexMetadata)

Methods in com.bigdata.journal with parameters of type BTree

Modifier and Type	Method and Description
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.
IIndex	JournalDelegate.registerIndex(String name, BTree btree)
IIndex	IBTreeManager.registerIndex(String name, BTree btree) Register a named index.
BTree	TemporaryStore.registerIndex(String name, BTree btree)
BTree	AbstractJournal.registerIndex(String name, BTree ndx)
IIndex	AbstractTask.registerIndex(String name, BTree btree) Registers an index

Constructors in com.bigdata.journal with parameters of type BTree

Constructor and Description
AbstractCommitTimeIndex(BTree ndx)

Uses of BTree in com.bigdata.mdi

Subclasses of BTree in com.bigdata.mdi

Modifier and Type	Class and Description
class	MetadataIndex A metadata index for the partitions of a distributed index.

Constructors in com.bigdata.mdi with parameters of type BTree

Constructor and Description
MetadataIndex.MetadataIndexCheckpoint(BTree btree)

Uses of BTree in com.bigdata.rdf.sail

Subclasses of BTree in com.bigdata.rdf.sail

Modifier and Type	Class and Description
static class	TestMROWTransactions.MyBTree Helper class for force abort of a B+Tree write.

Uses of BTree in com.bigdata.rdf.spo

Methods in com.bigdata.rdf.spo that return BTree

Modifier and Type	Method and Description
BTree	SPORelation.getSPOOnlyBTree(boolean bloomFilter) Deprecated. Comment out when we drop the DistinctSPOIterator.

Uses of BTree in com.bigdata.resources

Subclasses of BTree in com.bigdata.resources

Modifier and Type	Class and Description
class	IndexSegmentIndex BTree mapping IndexSegmentStore createTimes to IResourceMetadata records.
class	JournalIndex BTree mapping IJournal createTimes (long integers) to JournalMetadata records describing the IJournal.

Methods in com.bigdata.resources that return BTree

Modifier and Type	Method and Description
protected BTree	TestSegSplitter.generateData(IJournal store, String name, int ntuples, LocalPartitionMetadata pmd) Register a BTree against the journal, generate some data in the specified key range, and commit the data.
protected BTree	TestFixedLengthPrefixShardSplits.generateData(IJournal store, String name, int ntuples, LocalPartitionMetadata pmd) Register a BTree against the journal, generate some data in the specified key range, and commit the data.
protected BTree	TestFixedLengthPrefixShardSplits.generateSPOData(IJournal store, int ntuples, LocalPartitionMetadata pmd) Register a BTree against the journal, generate some data and commit the data (the data corresponds to a simple triple index schema but does not handle statement indices with variable length keys).

Methods in com.bigdata.resources with parameters of type BTree

Modifier and Type	Method and Description
protected void	AbstractAtomicUpdateTask.assertSameIndex(UUID expectedIndexUUID, BTree view) Verifies that the view is a view of the expected scale-out index.
AbstractBTree[]	IndexManager.getIndexSources(String name, long timestamp, BTree btree)
static Split[]	SplitUtility.tailSplit(ResourceManager resourceManager, BTree btree) Identifies the splits for an index with heavy write append behavior.

Uses of BTree in com.bigdata.service

Subclasses of BTree in com.bigdata.service

Modifier and Type	Class and Description
class	CommitTimeIndex BTree whose keys are commit times.
static class	EventReceiver.EventBTree A BTree whose keys are event start times and whose values are the serialized Events.
class	TxId2CommitTimeIndex BTree whose keys are the absolute value of the txIds and whose values are ITxState0 tuples for the transaction.