暂无图片
暂无图片
暂无图片
暂无图片
暂无图片
向量检索计算型盘加速_SUSTech_DBGroup_刘仁杰.pdf
95
22页
4次
2023-11-20
免费下载
In-storage Approximate Nearest
Neighbor Search
Renjie Liu (
刘仁杰
)
liurj2023@mail.sustech.edu.cn
Existing Work
Hybrid Mem-Storage Hierarchy:
v Jayaram Subramanya, S., Devvrit, F., Simhadri, H. V., Krishnawamy, R., &
Kadekodi, R. DiskANN: Fast Accurate Billion-point Nearest Neighbor
Search on a Single Node. NeurIPS 2019.
v Ren, J., Zhang, M., & Li, D. HM-ANN: Efficient Billion-point Nearest
Neighbor Search on Heterogeneous Memory. NeurIPS 2019.
v Chen, Q., Zhao, B., Wang, H., Li, M., Liu, C., Li, Z., ... & Wang, J. SPANN:
Highly-efficient Billion-scale Approximate Nearest Neighborhood
Search. NeurIPS 2021.
Near/In-storage Computing:
v Sun, G., & Jun, S. W. Bandwidth Efficient Near-storage Accelerator for
High-dimensional Similarity Search. FPT 2020.
ü Liang, S., Wang, Y., Yuan, Z., Liu, C., Li, H., & Li, X. VStore: In-storage
Graph Based Vector Search Accelerator. DAC 2022.
DiskANN
Fast Accurate Billion-point Nearest Neighbor Search on a Single Node:
v How to build a graph over a billion points?
v How to compute distance between query and candidate?
Caching frequently visited vertices, distance re-ranking, beam search…
But sacrifice search accuracy in some scale…
Overlapped Clustering
Merge
Compressed Vectors
Quantize
01 02 03 04
05 06 07 08
09 10 11 12
13 14 15 16
DRAM
SSD
of 22
免费下载
【版权声明】本文为墨天轮用户原创内容,转载时必须标注文档的来源(墨天轮),文档链接,文档作者等基本信息,否则作者和墨天轮有权追究责任。如果您发现墨天轮中有涉嫌抄袭或者侵权的内容,欢迎发送邮件至:contact@modb.pro进行举报,并提供相关证据,一经查实,墨天轮将立刻删除相关内容。