Gorgeous redesigns the SSD/DRAM data layout for disk-resident vector search by caching and co-placing graph adjacency lists with vectors, claiming large throughput gains.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Gorgeous: Revisiting the Data Layout for Disk-Resident High-Dimensional Vector Search
Gorgeous redesigns the SSD/DRAM data layout for disk-resident vector search by caching and co-placing graph adjacency lists with vectors, claiming large throughput gains.