四层树撑百亿向量，AlloyDB拆算力墙
AlloyDB ScaNN 预览版引入四层树结构，搜索复杂度从 O(N^{1/3}) 压到 O(N^{1/4})，在 100 亿向量规模下做到 95% 召回、p95 延迟 51ms 以内——但这是 Google 自家测试数据。
The skinny
The skinny isn't ready yet — notes appear once the transcript is processed.
AlloyDB ScaNN 预览版引入四层树结构，搜索复杂度从 O(N^{1/3}) 压到 O(N^{1/4})，在 100 亿向量规模下做到 95% 召回、p95 延迟 51ms 以内——但这是 Google 自家测试数据。
The skinny isn't ready yet — notes appear once the transcript is processed.