public class BTreeCostModel extends Object implements Serializable
BTree
backed by a Journal
.
The on disk representation of the BTree
does not reflect the index
order so a range scan on the BTree
is basically turned into one
random seek per node or leaf visited.Constructor and Description |
---|
BTreeCostModel(DiskCostModel diskCostModel) |
Modifier and Type | Method and Description |
---|---|
static int |
estimateHeight(int entryCount,
int branchingFactor)
Compute the height of the B+Tree from its entry count and branching
factor (this can also be used to find the minimum height at which there
could exist a given range count).
|
static void |
main(String[] args)
Prints out some tables based on different disk cost models, branching
factors, and range scans.
|
double |
rangeScan(long rangeCount,
int m,
int h,
int leafUtilization)
Return the estimated cost of a range scan of the index.
|
public BTreeCostModel(DiskCostModel diskCostModel)
public static int estimateHeight(int entryCount, int branchingFactor)
public double rangeScan(long rangeCount, int m, int h, int leafUtilization)
rangeCount
- The range count for the scan.m
- The B+Tree branching factor.h
- The B+Tree height.leafUtilization
- The leaf utilization percentage [0:100].public static void main(String[] args)
args
- ignored.Copyright © 2006–2019 SYSTAP, LLC DBA Blazegraph. All rights reserved.