arXiv (All)
open access
RaBitQ-SSD: Split Codes and Pipelined I/O for SSD-Resident Vector Search
SSD-resident approximate nearest-neighbor search is essential when vector collections exceed DRAM capacity. The challenge is to reduce SSD reads and hide I/O latency through concurrent reads and overlap with computation. However, for graph-based search, progressive candidate discovery limits advance
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
- RaBitQ-SSD: Split Codes and Pipelined I/O for SSD-Resident Vector Search#1181720
- BOA: Beamwidth Online Adaptation for Filtered-ANNS on a GPU#1110553
- BOA: Beamwidth Online Adaptation for Filtered-ANNS on a GPU#919339
- SwarmIO: Towards 100 Million IOPS SSD Emulation for Next-generation GPU-centric Storage Systems#2558
- One Global Beam Across Many GPUs: High-Throughput Beam Search at Billion-Record Frontier Scale#1217565
Record · ID 1186966
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