Demo Data from EDBT 2026 / reviewers in the wild / expert
Harry (Huan) Li
dblp:200/1297
· DBLP profile ↗
3ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2Software engineering, systems software and programming languages · 1
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 · 70% Performance modeling and evaluation · 23% Cloud and datacenter computing · 7% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Storage systems › distributed storage
disaggregated storage |
0.3 | 1 | 2018 | Performance Characterization of NVMe-over-Fabrics Storage Disaggregation · ACM Trans. Storage 2018 |
Storage systems
flash and SSD |
0.3 | 1 | 2018 | Performance Characterization of NVMe-over-Fabrics Storage Disaggregation · ACM Trans. Storage 2018 |
Storage systems › networked storage › storage networking
NVMe over Fabrics |
0.3 | 1 | 2018 | Performance Characterization of NVMe-over-Fabrics Storage Disaggregation · ACM Trans. Storage 2018 |
Performance modeling and evaluation
workload characterization |
0.3 | 1 | 2018 | Performance Characterization of NVMe-over-Fabrics Storage Disaggregation · ACM Trans. Storage 2018 |
Cloud and datacenter computing
datacenter storage |
0.1 | 1 | 2018 | Performance Characterization of NVMe-over-Fabrics Storage Disaggregation · ACM Trans. Storage 2018 |
Methods — techniques the papers use, named apart from their topics
stress testing · 0.3performance measurement · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Modeling Analytics for Computational StorageabstractNext generation flash storage will be armed with a substantial amount of computing power. In this paper, we investigate opportunities to utilize this computational capability to optimize Online Analytical Processing (OLAP) applications. We have directed our analysis at the performance of a subset of TPC-DS queries using Hadoop clusters and two database engines, SPARK-SQL and Presto. We model the expected speed-up achieved by offloading a few operations that are executed first within most SQL plans. Offloading these operations requires minimal cooperation from the database engine, and no changes to the existing plan. We show that the speed-up achieved varies significantly among queries and between engines, and that the queries benefiting the most are I/O heavy with high selectivity of the "needle in the haystack" variety. Our main contribution is estimating the speed-up anticipated from pushing the execution of a few key SQL building blocks (scan, filter, and project operations) to computational storage when using read optimized, columnar Parquet format files. Veronica Lagrange Moutinho dos Reis, Harry (Huan) Li, Anahita Shayesteh |
ICPE | 2 |
| 2018 | Performance Characterization of NVMe-over-Fabrics Storage DisaggregationabstractStorage disaggregation separates compute and storage to different nodes to allow for independent resource scaling and, thus, better hardware resource utilization. While disaggregation of hard-drives storage is a common practice, NVMe-SSD (i.e., PCIe-based SSD) disaggregation is considered more challenging. This is because SSDs are significantly faster than hard drives, so the latency overheads (due to both network and CPU processing) as well as the extra compute cycles needed for the offloading stack become much more pronounced. In this work, we characterize the overheads of NVMe-SSD disaggregation. We show that NVMe-over-Fabrics (NVMe-oF)—a recently released remote storage protocol specification—reduces the overheads of remote access to a bare minimum, thus greatly increasing the cost-efficiency of Flash disaggregation. Specifically, while recent work showed that SSD storage disaggregation via iSCSI degrades application-level throughput by 20%, we report on negligible performance degradation with NVMe-oF—both when using stress-tests as well as with a more-realistic KV-store workload. Zvika Guz, Harry (Huan) Li, Anahita Shayesteh, Vijay Balakrishnan |
ACM Trans. Storage | 2 |
| 2017 | NVMe-over-fabrics performance characterization and the path to low-overhead flash disaggregationabstractStorage disaggregation separates compute and storage to different nodes in order to allow for independent resource scaling and thus, better hardware resource utilization. While disaggregation of hard-drives storage is a common practice, NVMe-SSD (i.e., PCIe-based SSD) disaggregation is considered more challenging. This is because SSDs are significantly faster than hard drives, so the latency overheads (due to both network and CPU processing) as well as the extra compute cycles needed for the offloading stack become much more pronounced. Zvika Guz, Harry (Huan) Li, Anahita Shayesteh, Vijay Balakrishnan |
SYSTOR | 2 |