B 树索引基础
探索最常见的索引类型 B 树、其结构，以及它如何促进 PostgreSQL 中的快速数据查找。
B 树索引基础 是 CoddyKit 上的免费 Advanced PostgreSQL: Indexing, Partitioning, Replication 课时。 这是第 2 节课，共 4 节。 你可以在下方免费阅读本课时的完整内容 — 然后在浏览器中使用内置代码编辑器和全天候 AI 导师进行实践。 这是 Advanced PostgreSQL: Indexing, Partitioning, Replication 学习路径的一部分，你的进度在网页和 CoddyKit 应用中同步。 Advanced PostgreSQL: Indexing, Partitioning, Replication 课程共包含 4 节课。
本课时的部分内容尚未翻译，以英文显示。
B-Tree Index Basics
Meet the B-tree index — PostgreSQL's default and most common type, and the workhorse behind fast, efficient data retrieval.
Speeding Up Data Access
A B-tree index acts like a book's index: instead of a full table scan, it points straight to the rows you want, saving huge amounts of time.
What the 'B' Means
The B in B-tree means Balanced: all leaf nodes sit at the same depth, so any lookup takes about the same time — consistent, predictable speed.
B-Tree Structure: Nodes
A B-tree is an upside-down tree: a root node where searches begin, internal nodes that guide the way, and leaf nodes pointing to real rows.
How a B-Tree Search Works
A B-tree search starts at the root, compares your value to keys to pick the next child, and walks down to a leaf that points at the row.
B-Tree vs. Full Scan (Concept)
A full scan reads every row top to bottom. A B-tree index scan reads a few index pages, then jumps straight to the matching rows. Far faster.
When PostgreSQL Uses B-Trees
PostgreSQL reaches for B-trees on equality checks, range scans, ORDER BY sorting, and joins — which is why they're the default index type.
Creating Your First B-Tree Index
Create one with CREATE INDEX — PostgreSQL builds a B-tree by default. The code indexes the email column of a users table.
CREATE TABLE users (
id SERIAL PRIMARY KEY,
name VARCHAR(100),
email VARCHAR(100) UNIQUE
);
CREATE INDEX idx_users_email ON users (email);Confirming Index Use with EXPLAIN
Run EXPLAIN to see the query plan. Spot Index Scan in the output and you know your index is actually being used.
CREATE TABLE products (
id SERIAL PRIMARY KEY,
name VARCHAR(100),
price DECIMAL(10, 2)
);
CREATE INDEX idx_products_price ON products (price);
EXPLAIN SELECT * FROM products WHERE price > 50;Quick Check: B-Tree Purpose
What is the primary benefit of using a B-tree index in PostgreSQL?
B-Tree Basics Recap
That's the B-tree: a balanced tree of root, internal, and leaf nodes powering equality, range, sort, and join queries. Create with CREATE INDEX, verify with EXPLAIN.
常见问题解答
「B 树索引基础」课时是免费的吗？
是的 — 「B 树索引基础」的完整文本可在网页上免费阅读。要进行交互式练习（内置代码编辑器和全天候 AI 导师）并解锁 Advanced PostgreSQL: Indexing, Partitioning, Replication 课程的其余内容，请升级到 CoddyKit PRO。 Advanced PostgreSQL: Indexing, Partitioning, Replication 课程共包含 4 节课。
「B 树索引基础」这节课中我会学到什么？
探索最常见的索引类型 B 树、其结构，以及它如何促进 PostgreSQL 中的快速数据查找。 你通过在浏览器中直接运行的动手代码来练习 Advanced PostgreSQL: Indexing, Partitioning, Replication，全天候 AI 导师会在你学习这节课的过程中回答你的问题。
学习 Advanced PostgreSQL: Indexing, Partitioning, Replication 需要有经验吗？
无需任何先前经验。CoddyKit 上的 Advanced PostgreSQL: Indexing, Partitioning, Replication 课程适合初学者到高级学习者，你可以从这里开始或从头开始，按照自己的节奏学习。 这是第 2 节课，共 4 节。
「B 树索引基础」课时需要多长时间？
大多数 CoddyKit 课程大约需要 5–10 分钟。每节课都很精短且互动，所以你能稳步进步，并在网页和应用中从离开的地方继续。
我能在这节 Advanced PostgreSQL: Indexing, Partitioning, Replication 课中编写并运行代码吗？
能。每节 Advanced PostgreSQL: Indexing, Partitioning, Replication 课都包含内置代码编辑器，你可以在浏览器中直接编写并运行真实代码，并获得即时 AI 反馈 — 无需本地设置。