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

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

collaborators

14 papers

cs.AI2026

QCFuse: Query-Aware Cache Fusion via Compressed View for Efficient RAG Serving

Jianxin Yan, Wangze Ni, Zhenxin Li +8

Retrieval-augmented generation (RAG) improves large language model (LLM) answer quality by grounding generation in external evidence, but processing retrieved contexts makes the pr…

cs.IR2026

Explaining the "Why": A Unified Framework for the Additive Attribution of Changes in Arbitrary Measures

Changsheng Zhou, Dajun Chen, Zhitao Shen +3

Explaining why aggregated measures change is a critical challenge in data analytics that existing systems struggle to address. While current attribution methods exist, they lack a…

cs.DB2026

QCFuse: Query-Centric Cache Fusion for Efficient RAG Inference

Jianxin Yan, Zeheng Qian, Wangze Ni +6

Cache fusion accelerates generation process of LLMs equipped with RAG through KV caching and selective token recomputation, thereby reducing computational costs and improving effic…

cs.DB2026

FGIM: a Fast Graph-based Indexes Merging Framework for Approximate Nearest Neighbor Search

Zekai Wu, Jiabao Jin, Peng Cheng +7

As the state-of-the-art methods for high-dimensional data retrieval, Approximate Nearest Neighbor Search (ANNS) approaches with graph-based indexes have attracted increasing attent…

cs.DB2025

Approximate Nearest Neighbor Search of Large Scale Vectors on Distributed Storage

Kun Yu, Jiabao Jin, Xiaoyao Zhong +6

Approximate Nearest Neighbor Search (ANNS) in high-dimensional space is an essential operator in many online services, such as information retrieval and recommendation. Indices con…

cs.SE2025

OpenDerisk: An Industrial Framework for AI-Driven SRE, with Design, Implementation, and Case Studies

Peng Di, Faqiang Chen, Xiao Bai +12

The escalating complexity of modern software imposes an unsustainable operational burden on Site Reliability Engineering (SRE) teams, demanding AI-driven automation that can emulat…

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

LogLite: Lightweight Plug-and-Play Streaming Log Compression

Benzhao Tang, Shiyu Yang, Zhitao Shen +3

Log data is a vital resource for capturing system events and states. With the increasing complexity and widespread adoption ofmodern software systems and IoT devices, the daily vol…

cs.DB2025

EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search

Xiaoyao Zhong, Jiabao Jin, Peng Cheng +5

Recently, Approximate Nearest Neighbor Search in high-dimensional vector spaces has garnered considerable attention due to the rapid advancement of deep learning techniques. We obs…

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

ESG: Elastic Graphs for Range-Filtering Approximate k-Nearest Neighbor Search

Mingyu Yang, Wentao Li, Zhitao Shen +2

Range-filtering approximate -nearest neighbor (RFAKNN) search takes as input a vector and a numeric value, returning points from a database of high-dimensional points. T…

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…