#PostgreSQL

Four-Level Tree Powers 10-Billion-Vector Search as AlloyDB Tears Down the Compute Wall

AlloyDB ScaNN preview introduces a four-level tree structure, cutting search complexity from O(N^{1/3}) to O(N^{1/4}), achieving 95% recall and sub-51ms p95 latency at 10-billion-vector scale—but these are Google's own benchmark numbers.