Gorgeous: Revisiting the Data Layout for Disk-Resident High-Dimensional Vector Search
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908497066590208 |
|---|---|
| author | Yin, Peiqi Yan, Xiao Zhou, Qihui Li, Hui Li, Xiaolu Zhang, Lin Wang, Meiling Yao, Xin Cheng, James |
| author_facet | Yin, Peiqi Yan, Xiao Zhou, Qihui Li, Hui Li, Xiaolu Zhang, Lin Wang, Meiling Yao, Xin Cheng, James |
| contents | Similarity-based vector search underpins many important applications, but a key challenge is processing massive vector datasets (e.g., in TBs). To reduce costs, some systems utilize SSDs as the primary data storage. They employ a proximity graph, which connects similar vectors to form a graph and is the state-of-the-art index for vector search. However, these systems are hindered by sub-optimal data layouts that fail to effectively utilize valuable memory space to reduce disk access and suffer from poor locality for accessing disk-resident data. Through extensive profiling and analysis, we found that the structure of the proximity graph index is accessed more frequently than the vectors themselves, yet existing systems do not distinguish between the two. To address this problem, we design the Gorgeous system with the principle of prioritizing graph structure over vectors. Specifically, Gorgeous features a memory cache that keeps the adjacency lists of graph nodes to improve cache hits and a disk block format that explicitly stores neighbors' adjacency lists along with a vector to enhance data locality. Experimental results show that Gorgeous consistently outperforms two state-of-the-art disk-based systems for vector search, boosting average query throughput by over 60% and reducing query latency by over 35%. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_15290 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Gorgeous: Revisiting the Data Layout for Disk-Resident High-Dimensional Vector Search Yin, Peiqi Yan, Xiao Zhou, Qihui Li, Hui Li, Xiaolu Zhang, Lin Wang, Meiling Yao, Xin Cheng, James Databases Similarity-based vector search underpins many important applications, but a key challenge is processing massive vector datasets (e.g., in TBs). To reduce costs, some systems utilize SSDs as the primary data storage. They employ a proximity graph, which connects similar vectors to form a graph and is the state-of-the-art index for vector search. However, these systems are hindered by sub-optimal data layouts that fail to effectively utilize valuable memory space to reduce disk access and suffer from poor locality for accessing disk-resident data. Through extensive profiling and analysis, we found that the structure of the proximity graph index is accessed more frequently than the vectors themselves, yet existing systems do not distinguish between the two. To address this problem, we design the Gorgeous system with the principle of prioritizing graph structure over vectors. Specifically, Gorgeous features a memory cache that keeps the adjacency lists of graph nodes to improve cache hits and a disk block format that explicitly stores neighbors' adjacency lists along with a vector to enhance data locality. Experimental results show that Gorgeous consistently outperforms two state-of-the-art disk-based systems for vector search, boosting average query throughput by over 60% and reducing query latency by over 35%. |
| title | Gorgeous: Revisiting the Data Layout for Disk-Resident High-Dimensional Vector Search |
| topic | Databases |
| url | https://arxiv.org/abs/2508.15290 |