6 citations · 10 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…
RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search
Jianyang Gao, Cheng Long
Searching for approximate nearest neighbors (ANN) in the high-dimensional Euclidean space is a pivotal problem. Recently, with the help of fast SIMD-based implementations, Product…
Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach
Kaiqiang Yu, Cheng Long
Mining cohesive subgraphs from a graph is a fundamental problem in graph data analysis. One notable cohesive structure is -quasi-clique (QC), where each vertex connects at least…
High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations
Jianyang Gao, Cheng Long
Approximate K nearest neighbor (AKNN) search is a fundamental and challenging problem. We observe that in high-dimensional space, the time consumption of nearly all AKNN algorithms…
Maximum -Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach
Kaiqiang Yu, Cheng Long
Enumerating maximal -biplexes (MBPs) of a bipartite graph has been used for applications such as fraud detection. Nevertheless, there usually exists an exponential number of MBP…