Glossary term
What is B-tree (Balanced tree)?
B-tree stands for Balanced tree.
In System Design
A sorted, shallow tree used by most database indexes. Example: Finds 1 row among 1 billion in ~3–4 steps.
Learn it properly · System DesignLesson 22: Database Indexing: B-Trees and LSM-TreesWhy an index turns 812 ms into 0.09 ms, and why it slows every write. How B-trees keep sorted pages updated in place, how LSM-trees append and compact for huge write rates, and how to design indexes from real queries.In Backend in Depth
The default database index. Values are kept sorted in a tree, so finding a value, a range or a sort order is fast.
Learn it properly · Backend in DepthLesson 7: Database Fundamentals for API Engineers: Indexes, Transactions, IsolationB-tree indexes, reading EXPLAIN ANALYZE, transactions and isolation levels, and the race conditions they stop, like selling too many items.In SQL & PostgreSQL
The default index type. It keeps keys sorted so lookups, ranges and sorting are fast.
Learn it properly · SQL & PostgreSQLLesson 5: Indexes and EXPLAINHow a B-tree helps, composite, covering and partial indexes, and reading real EXPLAIN ANALYZE plans on a million rows.