AI engineering glossary · Data structures algorithms
What is b-tree?
B-tree (also called B+ tree): A balanced search tree where each node holds many keys and has many children, designed so that one node fits a disk page. Its low height means few disk reads per lookup, which is why databases and file systems use it for indexes.
B-tree: an example
A B-tree node holding 100 keys can index 1 crore records in roughly four levels, so a lookup reads about four pages.
Related terms
More Data structures algorithms terms
- Backtracking
- Base case
- Bellman-Ford algorithm
- Big-O notation
- Big-Omega notation
- Big-Theta notation
- Binary search
- Binary search tree
Where you learn it
B-tree is part of the AI Engineering Program, which teaches it with notes, a hands-on lab and an exam. The first lesson is free.