85 citations · 219 across the 14 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.DB2021★ 1 cited
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…
cs.DB2021★ 10 cited
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…
cs.DB2021★ 2 cited
DBL: Efficient Reachability Queries on Dynamic Graphs (Complete Version)
Qiuyi Lyu, Yuchen Li, Bingsheng He +1
Reachability query is a fundamental problem on graphs, which has been extensively studied in academia and industry. Since graphs are subject to frequent updates in many application…