Demo Data from EDBT 2026 / reviewers in the wild / expert
Dohyun Park
dblp:255/8177
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2025
0009-0009-2010-7757ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 since 2021Software engineering, systems software and programming languages · 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.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Storage systems · 50% Hardware accelerators and domain-specific architectures · 50% | |
| Databases, data mining, and information retrieval
1 paper |
Query processing and optimization · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Hardware accelerators and domain-specific architectures › database accelerator
FPGA-based query processing |
0.9 | 1 | 2025 | UPP: Universal Predicate Pushdown to Smart Storage · ISCA 2025 |
Storage systems › computational storage
in-storage computing |
0.9 | 1 | 2025 | UPP: Universal Predicate Pushdown to Smart Storage · ISCA 2025 |
Query processing and optimization › shared computation
shared filter evaluation |
0.3 | 1 | 2025 | UPP: Universal Predicate Pushdown to Smart Storage · ISCA 2025 |
Methods — techniques the papers use, named apart from their topics
hardware-software co-design · 1.7bitwise comparison · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | UPP: Universal Predicate Pushdown to Smart StorageabstractIn large-scale analytics, in-storage processing (ISP) can significantly boost query performance by letting ISP engines (e.g., FPGAs) preselect only the relevant data before sending them to databases.This reduces the amount of not only data transfer between storage and host, but also database computation, facilitating faster query processing.However, existing ISP solutions cannot effectively support a wide range of modern analytical queries because they only support simple combinations of frequently used operators (e.g., =, <), particularly on fixed-length columns.As modern databases allow filter predicates to include numerous operators/functions (e.g., dateadd) compatible with diverse data formats (and their complex combinations), it becomes more challenging for existing approaches to accelerate such queries efficiently.To address the limitations, we propose a new ISP approach, called Universal Predicate Pushdown (UPP), that can accelerate modern analytical databases, leveraging hardware/software co-design for a high level of flexibility.Our core insight is that instead of programming for individual filter operators/functions, we should devise a compact instruction set architecture (ISA) tailored explicitly for predicate pushdown.The software (i.e., database) layer recognizes and compiles various general filters (called a universal predicate) to a set of UPP-compliant instructions, which are then processed efficiently by FPGA using bitwise comparisons, leveraging lightweight metadata.In our experiments with a 100 GB TPC-H dataset, UPP running on SmartSSD could speed up Spark's end-to-end query performance by 1.2×-7.9×without changing input data formats. Ipoom Jeong, Jinghan Huang 0001, Chuxuan Hu, Dohyun Park, Jaeyoung Kang 0004, Nam Sung Kim, Yongjoo Park |
ISCA | 4 |