πŸ“Β§ B-tree

tags

Β§ Data structures

B-tree data structure is a search tree (similar to binary trees) with high branching factor. B-tree (and its variants) performs much better for high-latency memory with block reads (e.g., hard drives) because it has lower height and thus needs less read operations.

References

Backlinks