arXiv CS
open access
Analyzing and Reducing Search Quality Differences in Vector Similarity Search
Modern database services scalably search over large data collections via Approximate Nearest Neighbor Search, which improves search performance at the cost of search quality, measured by recall. In practice, a database operator seeks to achieve a target mean recall while maximizing throughput across
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Semantics at an Angle: When Cosine Similarity Works Until It Doesn't#793428
- Semantics at an Angle: When Cosine Similarity Works Until It Doesn't#789424
- Adaptive search promotes asymmetrical learning#263530
- The effects of unique encoding on the recall of numeric information#488824
- Fine-Tuning a KV Cache Concatenation-Aware Model or Recomputing KV Caches? Why Not Both?#996590
Record · ID 1043170
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive