arXiv (All)
open access
LSM-Vec: A Memory-Efficient Disk-Based System for Large-Scale Dynamic Vector Search
RAG and AI retrieval have made vector approximate nearest-neighbor (ANN) search a key retrieval operation in modern data systems. These workloads are both large and dynamic. Vector collections grow until index state no longer fits in DRAM and must reside on disk, and every new record arrives as an u
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
- VS-Flash: Harnessing Vector Search with Computational Memory-Semantic Flash#1402348
- VS-Flash: Harnessing Vector Search with Computational Memory-Semantic Flash#1394217
- RaBitQ-SSD: Split Codes and Pipelined I/O for SSD-Resident Vector Search#1186966
- RaBitQ-SSD: Split Codes and Pipelined I/O for SSD-Resident Vector Search#1181720
- SwarmIO: Towards 100 Million IOPS SSD Emulation for Next-generation GPU-centric Storage Systems#2558
Record · ID 1455331
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