1.4k citations · 2k across the 34 of their papers we have counts for
9 papers · 1 filter
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…
A Coupled Design of Exploiting Record Similarity for Practical Vertical Federated Learning
Zhaomin Wu, Qinbin Li, Bingsheng He
Federated learning is a learning paradigm to enable collaborative learning across different parties without revealing raw data. Notably, vertical federated learning (VFL), where pa…
Skew-Oblivious Data Routing for Data-Intensive Applications on FPGAs with HLS
Xinyu Chen, Hongshi Tan, Yao Chen +3
FPGAs have become emerging computing infrastructures for accelerating applications in datacenters. Meanwhile, high-level synthesis (HLS) tools have been proposed to ease the progra…
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…
Model-Contrastive Federated Learning
Qinbin Li, Bingsheng He, Dawn Song
Federated learning enables multiple parties to collaboratively train a machine learning model without communicating their local data. A key challenge in federated learning is to ha…
Efficient Deep Learning Pipelines for Accurate Cost Estimations Over Large Scale Query Workload
Johan Kok Zhi Kang, Gaurav, Sien Yi Tan +3
The use of deep learning models for forecasting the resource consumption patterns of SQL queries have recently been a popular area of study. With many companies using cloud platfor…
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…
Federated Learning on Non-IID Data Silos: An Experimental Study
Qinbin Li, Yiqun Diao, Quan Chen +1
Due to the increasing privacy concerns and data regulations, training data have been increasingly fragmented, forming distributed databases of multiple "data silos" (e.g., within d…
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…