Databases · Multiple choice

Which column gains the least from a B-tree index of its own?

medium

Options

Why

An index pays off when it narrows a query to a small fraction of the rows. A filter matching half the table reads so many rows that a full scan is cheaper, and the planner will usually ignore the index while every write still pays to maintain it.

Review this in your daily deck All cards in Databases