10 citations · 14 across the 6 of their papers we have counts for
5 papers · 1 filter
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…
An In-Depth Study of Continuous Subgraph Matching (Complete Version)
Xibo Sun, Shixuan Sun, Qiong Luo +1
Continuous subgraph matching (CSM) algorithms find the occurrences of a given pattern on a stream of data graphs online. A number of incremental CSM algorithms have been proposed.…
ThunderRW: An In-Memory Graph Random Walk Engine (Complete Version)
Shixuan Sun, Yuhang Chen, Shengliang Lu +2
As random walk is a powerful tool in many graph processing, mining and learning applications, this paper proposes an efficient in-memory random walk engine named ThunderRW. Compare…
Cache-Efficient Fork-Processing Patterns on Large Graphs
Shengliang Lu, Shixuan Sun, Johns Paul +2
As large graph processing emerges, we observe a costly fork-processing pattern (FPP) that is common in many graph algorithms. The unique feature of the FPP is that it launches many…
PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration
Shixuan Sun, Yuhang Chen, Bingsheng He +1
We study the hop-constrained s-t path enumeration (HcPE) problem, which takes a graph , two distinct vertices and a hop constraint as input, and outputs all paths from…