Demo Data from EDBT 2026 / reviewers in the wild / expert
Caifeng Zhu
dblp:81/924
· DBLP profile ↗
3ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 1Human-computer interaction and ubiquitous computing · 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.
| Human-computer interaction and pervasive computing
1 paper |
Learning and educational technologies · 50% Design research and methods · 50% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Distributed systems · 56% Storage systems · 36% Cloud and datacenter computing · 8% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Design research and methods › participatory design
co-design with children |
0.9 | 1 | 2025 | Fostering children's dispositional autonomy and AI understanding through co-designing AI systems: A learning science perspective · Int. J. Hum. Comput. Stud. 2025 |
Distributed systems
consensus |
0.3 | 1 | 2018 | PolarFS: An Ultra-low Latency and Failure Resilient Distributed File System for Shared Storage Cloud Database · Proc. VLDB Endow. 2018 |
Storage systems › file systems
distributed file system |
0.3 | 1 | 2018 | PolarFS: An Ultra-low Latency and Failure Resilient Distributed File System for Shared Storage Cloud Database · Proc. VLDB Endow. 2018 |
Distributed systems › consensus › leader-based consensus
raft |
0.3 | 1 | 2018 | PolarFS: An Ultra-low Latency and Failure Resilient Distributed File System for Shared Storage Cloud Database · Proc. VLDB Endow. 2018 |
Cloud and datacenter computing
database-as-a-service |
0.1 | 1 | 2018 | PolarFS: An Ultra-low Latency and Failure Resilient Distributed File System for Shared Storage Cloud Database · Proc. VLDB Endow. 2018 |
Storage systems
shared storage |
0.1 | 1 | 2018 | PolarFS: An Ultra-low Latency and Failure Resilient Distributed File System for Shared Storage Cloud Database · Proc. VLDB Endow. 2018 |
Methods — techniques the papers use, named apart from their topics
learning science · 0.9co-design · 0.9userspace i/o · 0.3SPDK · 0.3RDMA · 0.3NVMe · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Fostering children's dispositional autonomy and AI understanding through co-designing AI systems: A learning science perspective
Yumeng Zhu, Samantha-Kaye Johnston, Caifeng Zhu, Yan Li 0086 |
Int. J. Hum. Comput. Stud. | 3 |
| 2018 | PolarFS: An Ultra-low Latency and Failure Resilient Distributed File System for Shared Storage Cloud DatabaseabstractPolarFS is a distributed file system with ultra-low latency and high availability, designed for the POLARDB database service, which is now available on the Alibaba Cloud. PolarFS utilizes a lightweight network stack and I/O stack in user-space, taking full advantage of the emerging techniques like RDMA, NVMe, and SPDK. In this way, the end-to-end latency of PolarFS has been reduced drastically and our experiments show that the write latency of PolarFS is quite close to that of local file system on SSD. To keep replica consistency while maximizing I/O throughput for PolarFS, we develop ParallelRaft , a consensus protocol derived from Raft, which breaks Raft's strict serialization by exploiting the out-of-order I/O completion tolerance capability of databases. ParallelRaft inherits the understand-ability and easy implementation of Raft while providing much better I/O scalability for PolarFS. We also describe the shared storage architecture of PolarFS, which gives a strong support for POLARDB. Wei Cao 0006, Zhenjun Liu, Caifeng Zhu |
Proc. VLDB Endow. | 5 |
| 2007 | A Fast Approach for Natural Image Matting using Structure InformationabstractNatural image matting plays an important role in image and video editing. It has been addressed hotly because it is inherently an under-constrained problem - we must estimate both the foreground and background colors (we call them component colors) at each pixel to calculate its opacity, according to the only known observed color. Prior assumption such as statistics and smoothness are utilized for estimation, but these methods either are simple to handle situations such as complex background and large interaction region or have high computational complexity. This paper proposes a fast technique to estimate the component colors based on structure information. Our approach exploits a simple convolution operation to detect structure information in images. It then uses two kinds of estimation methods to propagate colors based on the structure types. Experimental results show that our method is fast and efficient to handle objects with strong structures and large part of interaction region with the background. Qianhui Ning, Weiqiang Wang 0001, Caifeng Zhu, Laiyun Qing, Qingming Huang |
ICME | 3 |