How it works
Why does it behave this way?
- 1
When a predicate is not a range
In which three ways does the reduction to a range fail, and which five families does that create?
2 pages - 2
Text search
Why is scoring the real cost of text search, and why is an inverted index columnar storage at its extreme?
6 pages - 3
Vector search
Why is brute-force similarity search memory-bound, and why does compression buy speed first?
5 pages - 4
Graph
Why can graph work not batch by address, and what does CSR layout buy?
4 pages - 5
Geospatial
Why is a coordinate meaningless without its reference system, and where does geospatial difficulty move?
4 pages - 6
Time series
Why does one new label bring down a metrics store when data volume barely changes?
4 pages - 7
What specialization adds
Which shape of answer does each family take, and what does a new system cost beyond its engine?