Performance

B-Tree Index

English

Overview

A tree-structured indexing method adopted as the default in most relational databases.

Details

Data is kept in a hierarchical tree structure, letting you find a target row in logarithmic time by walking from root to leaf. It's also strong at range queries and ordered scans, making it the most widely used general-purpose index.

More Database terms