arXiv CS
open access
WaRP: Workload-Aware Request Planning for Vector Retrieval on Object Storage
Modern vector search systems keep payload vectors in cloud object storage and only a compact routing index on fast local storage, typically using cluster-based ANN indexes. This design inherits a problem existing systems do not address. On object storage, small Range-GETs have latency dominated by f
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
- WaRP: Workload-Aware Request Planning for Vector Retrieval on Object Storage#1414294
- Aker: Density-Aware Approximate Caching for Vector Search (Extended Version)#926604
- Effectiveness and predictability of in-network storage cache for Scientific Workflows#1038674
- Aker: Density-Aware Approximate Caching for Vector Search (Extended Version)#639751
- Guard: Scalable Straggler Detection and Node Health Management for Large-Scale Training#200460
Record · ID 1406558
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