B-Tree vs Hash Indexes

Problem

Your team is deciding on the index type for a key-value search. You explain that while B-Trees are great for range lookups, Hash indexes are faster for exact equals matches but do not support sorting. Write a query that outputs explanation with the value: "Hash indexes provide O(1) lookups for equality comparisons but cannot optimize range queries or ORDER BY sorting."

Database Schema

This problem acts as a scratchpad. You will write your own DDL/DML or conceptual queries, so there is no predefined schema.

Try It

Hint

Solution