B-tree structure

Learn the B-tree index structure.

B-tree structure

B-tree is the most common index structure. It is a balanced tree of root, branch and leaf nodes. Search, insert and delete run in O(log n) time.

CREATE INDEX idx_products_name
ON products(name);

B-tree supports equality and range queries.

The index idx_products_name is created.

B-tree structure — details

Leaves are kept sorted; this makes range queries like BETWEEN, > and < fast. Each leaf carries a pointer to the table row.

Exercise B-tree structure

Create the idx_products_name index on the name column of products.

Show example solution

CREATE INDEX idx_products_name ON products(name);

Test yourself

Which query type does B-tree support?
- Range queries
- Full-text search only
- Geographic data only
- Arrays only
Show answer

Range queries — B-tree supports range queries.

Create an index

CREATE INDEX idx_products_name ON ____

Show answer

CREATE INDEX idx_products_name ON products(name)

B-tree structure: match the terms

B-tree

balanced tree
leaf

leaf
range

range
pointer

pointer

Next lesson: Covering index

We Are Enhancing Your Experience

Cookie Preferences

Strictly Necessary Cookies

Analytical Cookies