public interface IBTreeStatistics
AbstractBTree
and do not require DISK IO.Modifier and Type | Method and Description |
---|---|
int |
getBranchingFactor()
The branching factor for the btree.
|
long |
getEntryCount()
The #of entries (aka tuples) in the
AbstractBTree . |
int |
getHeight()
The height of the btree.
|
long |
getLeafCount()
The #of leaf nodes in the
AbstractBTree . |
long |
getNodeCount()
The #of non-leaf nodes in the
AbstractBTree . |
IBTreeUtilizationReport |
getUtilization()
Computes and returns the utilization of the tree.
|
int getBranchingFactor()
int getHeight()
height := 0
. A btree with a
root node and one level of leaves under it has height := 1
.
Note that all leaves of a btree are at the same height (this is what is
means for the btree to be "balanced"). Also note that the height only
changes when we split or join the root node (a btree maintains balance by
growing and shrinking in levels from the top rather than the leaves).long getNodeCount()
AbstractBTree
. This is zero (0)
for a new btree.long getLeafCount()
AbstractBTree
. This is one (1) for a
new btree.long getEntryCount()
AbstractBTree
. This is zero
(0) for a new B+Tree. When the B+Tree supports delete markers, this value
also includes tuples which have been marked as deleted.IBTreeUtilizationReport getUtilization()
Copyright © 2006–2019 SYSTAP, LLC DBA Blazegraph. All rights reserved.