3 citations · 4 across the 4 of their papers we have counts for
5 papers
RaBitQ-SSD: Split Codes and Pipelined I/O for SSD-Resident Vector Search
Yuexuan Xu, Jianyang Gao, Michael Norris +5
SSD-resident approximate nearest-neighbor search is essential when vector collections exceed DRAM capacity. The challenge is to reduce SSD reads and hide I/O latency through concur…
Revisiting RaBitQ and TurboQuant: A Symmetric Comparison of Methods, Theory, and Experiments
Jianyang Gao, Yutong Gou, Yuexuan Xu +5
This technical note revisits the relationship between RaBitQ and TurboQuant under a unified comparison framework. We compare the two methods in terms of methodology, theoretical gu…
SymphonyQG: Towards Symphonious Integration of Quantization and Graph for Approximate Nearest Neighbor Search
Yutong Gou, Jianyang Gao, Yuexuan Xu +1
Approximate nearest neighbor (ANN) search in high-dimensional Euclidean space has a broad range of applications. Among existing ANN algorithms, graph-based methods have shown super…
Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search
Jianyang Gao, Yutong Gou, Yuexuan Xu +3
Approximate nearest neighbor (ANN) query in high-dimensional Euclidean space is a key operator in database systems. For this query, quantization is a popular family of methods deve…
iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search
Yuexuan Xu, Jianyang Gao, Yutong Gou +2
Range-filtering approximate nearest neighbor (RFANN) search is attracting increasing attention in academia and industry. Given a set of data objects, each being a pair of a high-di…