activity
20232025
most citedVSAG: An Optimized Search Framework for Graph-based Approximate Nearest Neighbor Search

2 citations · 4 across the 5 of their papers we have counts for

collaborators

5 papers

cs.DB2025

SINDI: An Efficient Index for Sparse Vector Approximate Maximum Inner Product Search

Ruoxuan Li, Xiaoyao Zhong, Jiabao Jin +7

Sparse vector Maximum Inner Product Search (MIPS) is crucial in multi-path retrieval for Retrieval-Augmented Generation (RAG). Recent inverted index-based and graph-based algorithm…

cs.DB2025

TierBase: A Workload-Driven Cost-Optimized Key-Value Store

Zhitao Shen, Shiyu Yang, Weibo Chen +12

In the current era of data-intensive applications, the demand for high-performance, cost-effective storage solutions is paramount. This paper introduces a Space-Performance Cost Mo…

cs.DB2025★ 2 cited

VSAG: An Optimized Search Framework for Graph-based Approximate Nearest Neighbor Search

Xiaoyao Zhong, Haotian Li, Jiabao Jin +11

Approximate nearest neighbor search (ANNS) is a fundamental problem in vector databases and AI infrastructures. Recent graph-based ANNS algorithms have achieved high search accurac…

cs.DB2024★ 2 cited

Effective and General Distance Computation for Approximate Nearest Neighbor Search

Mingyu Yang, Wentao Li, Jiabao Jin +5

Approximate K Nearest Neighbor (AKNN) search in high-dimensional spaces is a critical yet challenging problem. In AKNN search, distance computation is the core task that dominates…

cs.DB2023

High-Ratio Compression for Machine-Generated Data

Jiujing Zhang, Zhitao Shen, Shiyu Yang +7

Machine-generated data is rapidly growing and poses challenges for data-intensive systems, especially as the growth of data outpaces the growth of storage space. To cope with the s…