Related articles:
Binary search tree
ISAM
Database
Self-balancing binary search tree
Key terms:
node
deleted
insert
separator
internal node
leaf nodes
subtree
disk block
bayer
child nodes
sorted
disk reads
pointers
comer
milliseconds
legal node
deficient node
full nodes
separation value
amortized
aux index
disk drive
auxiliary index
new separator
balanced tree
root node
rudolf bayer
two new nodes
every node
secondary storage
child pointers
single node
minimum number of elements
physical disk block
subtree will
left sibling
number of child nodes
node is split
right sibling
binary search tree
two legal nodes
two child nodes
smallest element
three child nodes
separator in the parent
insertions and deletions
each internal node
if an internal node
deleting an element
directory would point
Search external links cited by footnotes on Wikipedia page B-tree:
|
|