4 papers
VectorMaton: Efficient Vector Search with Pattern Constraints via an Enhanced Suffix Automaton
Haoxuan Xie, Siqiang Luo
Approximate nearest neighbor search (ANNS) has become a cornerstone in modern vector database systems. Given a query vector, ANNS retrieves the closest vectors from a set of base v…
RadixGraph: A Fast, Space-Optimized Data Structure for Dynamic Graph Storage (Extended Version)
Haoxuan Xie, Junfeng Liu, Siqiang Luo +1
Dynamic graphs model many real-world applications, and as their sizes grow, efficiently storing and updating them becomes critical. We present RadixGraph, a fast and memory-efficie…
[Extended Version] ArceKV: Towards Workload-driven LSM-compactions for Key-Value Store Under Dynamic Workloads
Junfeng Liu, Haoxuan Xie, Siqiang Luo
Key-value stores underpin a wide range of applications due to their simplicity and efficiency. Log-Structured Merge Trees (LSM-trees) dominate as their underlying structure, excell…
Finding Near-Optimal Maximum Set of Disjoint -Cliques in Real-World Social Networks
Wenqing Lin, Xin Chen, Haoxuan Xie +2
A -clique is a dense graph, consisting of fully-connected nodes, that finds numerous applications, such as community detection and network analysis. In this paper, we study…