B-tree
Self-balancing search tree
A B-tree is a data structure used in databases and file systems to organize and retrieve information efficiently.
Unlike binary trees, which branch into two paths, B-trees branch into many, keeping data sorted and balanced so that searches, insertions, and deletions all happen quickly.
The "B" has no official meaning—balanced, broad, and Bayer (one of its inventors) have all been suggested.
In a state of equilibrium
- nodeConnection point in networks
- leafPlant's photosynthetic organ
- rootUnderground absorbing structure
- heightVertical extent upward
branch · level · pointer · child · parent · sibling · subtree · path
Placing something within
traversal · rotation · redistribution · underflow · overflow · update · maintenance · reorganization
Alphabetical guide to contents
- queryRequest for information
- searchAct of seeking
- lookupAct of retrieving information
- diskFlat circular object
block · page · storage · retrieval · access · record · clustered · Oracle
Able to change accordingly
- concurrentHappening at once
- persistentContinuing despite difficulty
balanced
In a state of equilibrium
height · branch · level · pointer · child · parent · sibling · subtree · path · depth
insertion
Placing something within
merge · traversal · rotation · redistribution · underflow · overflow · update · maintenance · reorganization · optimization
index
Alphabetical guide to contents
disk · block · page · storage · retrieval · access · record · clustered · Oracle · MySQL
adaptive
Able to change accordingly
- concurrentHappening at once
- persistentContinuing despite difficulty
B-treebinary tree
Two-way branching data structure
linked list · array · hash table · heap · flat file