VStore: In-Storage Graph Based Vector Search Accelerator

16Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Graph-based vector search that finds best matches to user queries based on their semantic similarities using a graph data structure, becomes instrumental in data science and AI application. However, deploying graph-based vector search in production systems requires high accuracy and cost-efficiency with low latency and memory footprint, which existing work fails to offer. We present VStore, a graph-based vector search solution that collaboratively optimizes accuracy, latency, memory, and data movement on large-scale vector data based on in-storage computing. The evaluation shows that VStore exhibits significant search efficiency improvement and energy reduction while attaining accuracy over CPU, GPU, and ZipNN platforms.

Cite

CITATION STYLE

APA

Liang, S., Wang, Y., Yuan, Z., Liu, C., Li, H., & Li, X. (2022). VStore: In-Storage Graph Based Vector Search Accelerator. In Proceedings - Design Automation Conference (pp. 997–1002). Institute of Electrical and Electronics Engineers Inc. https://doi.org/10.1145/3489517.3530560

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free