Demo Data from EDBT 2026 / reviewers in the wild / expert
Kangcheng Wang
dblp:160/1162
· DBLP profile ↗
3ranked-venue papers
1as first author
1since 2021 · last 2022
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 2 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1Human-computer interaction and ubiquitous computing · 1 · 1 first-author
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.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Storage systems · 77% Distributed systems · 23% | |
| Databases, data mining, and information retrieval
1 paper |
Graph data management · 100% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Graph data management › graph database
distributed graph database |
0.6 | 1 | 2022 | ByteGraph: A High-Performance Distributed Graph Database in ByteDance · Proc. VLDB Endow. 2022 |
Distributed systems › replication
geo-replication |
0.2 | 1 | 2022 | ByteGraph: A High-Performance Distributed Graph Database in ByteDance · Proc. VLDB Endow. 2022 |
Methods — techniques the papers use, named apart from their topics
index optimization · 1.1adaptive thread pool optimization · 1.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | ByteGraph: A High-Performance Distributed Graph Database in ByteDanceabstractMost products at ByteDance, e.g., TikTok, Douyin, and Toutiao, naturally generate massive amounts of graph data. To efficiently store, query and update massive graph data is challenging for the broad range of products at ByteDance with various performance requirements. We categorize graph workloads at ByteDance into three types: online analytical, transaction, and serving processing, where each workload has its own characteristics. Existing graph databases have different performance bottlenecks in handling these workloads and none can efficiently handle the scale of graphs at ByteDance. We developed ByteGraph to process these graph workloads with high throughput, low latency and high scalability. There are several key designs in ByteGraph that make it efficient for processing our workloads, including edge-trees to store adjacency lists for high parallelism and low memory usage, adaptive optimizations on thread pools and indexes, and geographic replications to achieve fault tolerance and availability. ByteGraph has been in production use for several years and its performance has shown to be robust for processing a wide range of graph workloads at ByteDance. Changji Li, Yingqian Hu, Xiangchen Li, Dongqing Han, Huiming Zhu, Xuwei Fu, Tingwei Wu, Hongfei Tan, Hengtian Ding, Mengjin Liu, Kangcheng Wang, Ting Ye, Chenguang Zheng, James Cheng |
Proc. VLDB Endow. | 18 |
| 2017 | Multi-level Multi-task Structured Sparse Learning for Diagnosis of Schizophrenia Disease
Xiaoke Hao, Jiashuang Huang, Kangcheng Wang, Xijia Xu, Daoqiang Zhang |
MICCAI (3) | 4 |
| 2017 | Automatic hyper-parameter tuning for soft sensor modeling based on dynamic deep neural networkabstractDeep learning has been proposed for soft sensor modeling in process industries. However, conventional deep neural network (DNN) is a static network and thereby can not embrace evident dynamics in processes. Motivated by nonlinear autoregressive with exogenous input (NARX) model and neural nets based dynamic modeling, a dynamic network called NARX-DNN is put forward by further utilizing historical process samples and quality samples in a period of time. A modified hyper-parameter tuning method is proposed to choose optimal hyper-parameters of NARX-DNN with little manual intervention, which automatizes the training procedure and reduces computational cost. The quality prediction error of validation data is interpreted from different aspects, and the most appropriate delay of historical data can be determined automatically. The effectiveness of the proposed method is validated by case studies on a sulfur recovery unit and a debutanizer column. As training, validation and test data sets are selected by the original orders of data samples, the accurate prediction results of NARX-DNN demonstrate its ability in dealing with operation condition changes which are common in real processes. Kangcheng Wang, Chao Shang 0002, Fan Yang 0005, Yongheng Jiang, Dexian Huang |
SMC | 1 |