Dechao Gao

dblp:263/2037 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Graph learning · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 50% Hardware accelerators and domain-specific architectures · 50%
Databases, data mining, and information retrieval
1 paper
Data stream processing · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data stream processing › continuous query processing
sliding window
0.212023
NeutronStream: A Dynamic GNN Training Framework with Sliding Window for Graph Streams · Proc. VLDB Endow. 2023
Parallel and multicore computing › parallel computing › parallel machine learning
parallel training
0.212023
NeutronStream: A Dynamic GNN Training Framework with Sliding Window for Graph Streams · Proc. VLDB Endow. 2023
Hardware accelerators and domain-specific architectures › graph processing accelerator
streaming graph processing
0.212023
NeutronStream: A Dynamic GNN Training Framework with Sliding Window for Graph Streams · Proc. VLDB Endow. 2023

Methods — techniques the papers use, named apart from their topics

sliding window · 2.0parallel execution engine · 2.0
YearPublicationVenuePosition
2023 NeutronStream: A Dynamic GNN Training Framework with Sliding Window for Graph Streams
abstract
Existing Graph Neural Network (GNN) training frameworks have been designed to help developers easily create performant GNN implementations. However, most existing GNN frameworks assume that the input graphs are static, but ignore that most real-world graphs are constantly evolving. Though many dynamic GNN models have emerged to learn from evolving graphs, the training process of these dynamic GNNs is dramatically different from traditional GNNs in that it captures both the spatial and temporal dependencies of graph updates. This poses new challenges for designing dynamic GNN training frameworks. First, the traditional batched training method fails to capture real-time structural evolution information. Second, the time-dependent nature makes parallel training hard to design. Third, it lacks system supports for users to efficiently implement dynamic GNNs. In this paper, we present NeutronStream, a framework for training dynamic GNN models. NeutronStream abstracts the input dynamic graph into a chronologically updated stream of events and processes the stream with an optimized sliding window to incrementally capture the spatial-temporal dependencies of events. Furthermore, NeutronStream provides a parallel execution engine to tackle the sequential event processing challenge to achieve high performance. NeutronStream also integrates a built-in graph storage structure that supports dynamic updates and provides a set of easy-to-use APIs that allow users to express their dynamic GNNs. Our experimental results demonstrate that, compared to state-of-the-art dynamic GNN implementations, NeutronStream achieves speedups ranging from 1.48X to 5.87X and an average accuracy improvement of 3.97%.
Chaoyi Chen, Dechao Gao, Yanfeng Zhang 0001, Qiange Wang, Zhenbo Fu, Xuecang Zhang, Junhua Zhu, Yu Gu 0002, Ge Yu 0001
Proc. VLDB Endow.2