Integrating DiskANN's graph index into Cosmos DB's Bw-Tree gives low-latency, low-cost vector search inside an operational database, with claimed scale-out to billions of vectors.
Razenshteyn, and Ludwig Schmidt
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Cost-Effective, Low Latency Vector Search with Azure Cosmos DB
Integrating DiskANN's graph index into Cosmos DB's Bw-Tree gives low-latency, low-cost vector search inside an operational database, with claimed scale-out to billions of vectors.