3 papers
cs.DB2024
CANDY: A Benchmark for Continuous Approximate Nearest Neighbor Search with Dynamic Data Ingestion
Xianzhi Zeng, Zhuoyan Wu, Xinjing Hu +3
Approximate K Nearest Neighbor (AKNN) algorithms play a pivotal role in various AI applications, including information retrieval, computer vision, and natural language processing.…
cs.DC2024
FlowWalker: A Memory-efficient and High-performance GPU-based Dynamic Graph Random Walk Framework
Junyi Mei, Shixuan Sun, Chao Li +9
Dynamic graph random walk (DGRW) emerges as a practical tool for capturing structural relations within a graph. Effectively executing DGRW on GPU presents certain challenges. First…
cs.DB2023
Async-fork: Mitigating Query Latency Spikes Incurred by the Fork-based Snapshot Mechanism from the OS Level
Pu Pang, Gang Deng, Kaihao Bai +12
In-memory key-value stores (IMKVSes) serve many online applications because of their efficiency. To support data backup, popular industrial IMKVSes periodically take a point-in-tim…