| Package | Description |
|---|---|
| edu.berkeley.cs186.database.index |
| Modifier and Type | Class and Description |
|---|---|
class |
InnerEntry
A B+ tree inner node entry.
|
class |
LeafEntry
A B+ tree leaf node entry.
|
| Modifier and Type | Method and Description |
|---|---|
protected List<BEntry> |
BPlusNode.getAllValidEntries()
Return a list of valid, existing entries of this node.
|
| Modifier and Type | Method and Description |
|---|---|
InnerEntry |
LeafNode.splitNode(BEntry newEntry)
Splits this LeafNode and returns the resulting InnerEntry to be
pushed/copied up to this LeafNode's parent as a result of the split.
|
InnerEntry |
InnerNode.splitNode(BEntry newEntry)
Splits this InnerNode and returns the resulting InnerEntry to be
pushed/copied up to this InnerNode's parent as a result of the split.
|
InnerEntry |
BPlusNode.splitNode(BEntry newEntry)
Split BPlusNode driven by new entries.
|
| Modifier and Type | Method and Description |
|---|---|
protected void |
BPlusNode.overwriteBNodeEntries(List<BEntry> entries)
Clear all the entries of this node, and write all the given entries into
the node, starting from the first entry number.
|
Copyright © 2017. All rights reserved.