Good for Range Queries and Equality

← Back to B-Tree Indexes

B-Tree indexes maintain sorted order, making them efficient for both exact match lookups (WHERE col = value) and range scans (WHERE col BETWEEN a AND b).

relational-databases indexing b-tree