5 / 9 Indexing: B-Tree, LSM & Inverted

Every Predicate An Access Condition

You have one index:

CREATE INDEX tickets_lookup ON tickets (tenant_id, status, created_at);

Which of these can be answered by scanning a single contiguous slice of that index, with every WHERE predicate used to position the scan rather than to filter rows the index already handed back? More than one applies.

A 
WHERE status = 'open' AND created_at >= '2026-08-01'
B 
WHERE tenant_id = 7
C 
WHERE tenant_id = 7 AND status = 'open'
  AND created_at >= '2026-08-01'
D 
WHERE tenant_id = 7 AND created_at >= '2026-08-01'
E 
WHERE tenant_id = 7 AND status = 'open'
ORDER BY created_at DESC LIMIT 50