VLDB 2026 Research / reviewers in the wild / expert
Wenhao Ou
dblp:01/10777
· DBLP profile ↗
3ranked-venue papers
0as first author
3since 2021 · last 2026
0009-0000-3959-9805ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 3 · 3 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.
| Computer architecture, parallel and distributed computing, and storage systems
2 papers |
Storage systems · 95% Cloud and datacenter computing · 5% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Storage systems › data reduction
data deduplication |
1.0 | 1 | 2026 | Improving the Restore Performance of Fine-Grained Deduplication on Docker Container Image Storage · IEEE Trans. Parallel Distributed Syst. 2026 |
Storage systems
data reduction |
1.0 | 1 | 2026 | Once Rolling Hashing is Enough: Exploiting Rolling Hash Reuse in Delta Compression · EuroSys 2026 |
Storage systems › data compression
delta compression |
1.0 | 1 | 2026 | Once Rolling Hashing is Enough: Exploiting Rolling Hash Reuse in Delta Compression · EuroSys 2026 |
Storage systems › data reduction › data deduplication
restore performance |
1.0 | 1 | 2026 | Improving the Restore Performance of Fine-Grained Deduplication on Docker Container Image Storage · IEEE Trans. Parallel Distributed Syst. 2026 |
Storage systems
storage reliability |
1.0 | 1 | 2026 | Once Rolling Hashing is Enough: Exploiting Rolling Hash Reuse in Delta Compression · EuroSys 2026 |
Storage systems
backup storage |
0.3 | 1 | 2026 | Once Rolling Hashing is Enough: Exploiting Rolling Hash Reuse in Delta Compression · EuroSys 2026 |
Cloud and datacenter computing
container registry |
0.3 | 1 | 2026 | Improving the Restore Performance of Fine-Grained Deduplication on Docker Container Image Storage · IEEE Trans. Parallel Distributed Syst. 2026 |
Methods — techniques the papers use, named apart from their topics
rolling hashing · 1.0popularity-aware rewriting · 1.0hybrid-granularity deduplication · 1.0delta compression · 1.0across-layer-aware reorganization · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Once Rolling Hashing is Enough: Exploiting Rolling Hash Reuse in Delta CompressionabstractIn backup storage, delta compression successfully achieves a much higher data reduction ratio than chunk-level deduplication by applying a finer granularity in redundancy detection and elimination. However, it introduces additional, intensive computation overhead and results in a 50%–70% worsening backup throughput. Haoliang Tan, Wenhao Ou, Xiangyu Zou, Yanqi Pan, Zhaoquan Gu, Wen Xia |
EuroSys | 2 |
| 2026 | Improving the Restore Performance of Fine-Grained Deduplication on Docker Container Image StorageabstractThe rapid growth of container images leads to heavy storage pressures on image registries. Fine-grained deduplication, such as at the file and chunk levels, is a promising technique for reducing the storage space in image registries, compared to Docker's native coarse-grained image layer deduplication. However, fine-grained deduplication often incurs significant image restoration latency due to fragmented I/Os, resulting in up to 8× restoration I/O slowdowns. Moreover, existing restore-optimized deduplication techniques are not tailored to the characteristics of the container image, resulting in low deduplication ratios of images. Consequently, restoring performance remains a critical barrier to the practical adoption of fine-grained deduplication in container image registries. To address this challenge, we propose MiDedup, a restore-friendly fine-grained deduplication approach tailored for container image registries. MiDedup is built on an underexplored observation: the redundancy across layers of images follows a non-uniform distribution. Based on this insight, MiDedup introduces three core techniques: ① Across-layer-aware reorganization, which reorganizes deduplicated data into a compact, sequential layout, significantly reduces fragmented I/Os during image restore. ② Popularity-aware rewriting, which selectively rewrites hot image layers to further improve the balance between deduplication ratio and restore performance. ③ Hybrid-granularity deduplication, which combines file-level and chunk-level deduplication to reduce metadata and fragmented data. Experiments on the real-world Docker image dataset show that MiDedup reduces the 50–80% restore I/O overhead of fine-grained deduplication, which is comparable to the restore performance of native layer-level deduplication, while achieving 1.2–7.3× higher deduplication ratios. Haoliang Tan, Wenhao Ou, Xiangyu Zou, Lisha Qin, Zhaoquan Gu, Wen Xia |
IEEE Trans. Parallel Distributed Syst. | 2 |
| 2024 | MiDedup: A Restore-Friendly Deduplication Method on Docker Image Storage Systems
Lisha Qin, Haoliang Tan, Xiangyu Zou, Wenhao Ou, Rubing Huang, Wen Xia |
NPC (1) | 4 |