Vehicle Pings in a Month
Easy About 10 min Katabench Pro
A composite index answers from its leading column inward, or it does not answer at all.
The full brief is part of Katabench Pro
Pro opens this kata's brief, its starter code and its grader. To see how the track works first, try Existence Without Loading, which is free.
How it is graded
Your LINQ or SQL runs against real PostgreSQL. You see the SQL your code generates on the sample tests and can inspect its execution plan, so you learn when the database did the wrong work.
What it practices
- Sargable predicates
- Write predicates an index can serve: bare columns, ranges and pruned partitions.
- Composite indexes
- Column order, filter plus sort, ORDER BY with LIMIT, and when bitmap scans combine indexes.
- Query plans
- Read EXPLAIN output to see which access path the planner chose and why.
Related katas
- Books by Genre or Language Easy Pro An OR is only as indexable as its weakest branch.
- Cars by Make and Color Easy Pro Why does a planner that happily intersects two indexes settle for one of them here? The statistics are fresh, so the answer is in the WHERE clause.
- Emails by Folder or Label Easy Pro The AND search on this mailbox screen answers in a millisecond. The OR search beside it, written by the same hand, reads all three hundred thousand messages.
- Items by Brand and Category Easy Pro A marketplace filter fetches fifteen hundred listings to return a hundred, because only one of its two indexes ever made it into the plan.