EDBT 2026 Demo / reviewers in the wild / expert
Juhun Kim
dblp:295/7299
· DBLP profile ↗
3ranked-venue papers
0as first author
3since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 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.
| Databases, data mining, and information retrieval
2 papers |
Data mining · 54% Database system architecture and tuning · 20% Data models and query languages · 20% |
Topics — the 5 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Database system architecture and tuning
database benchmarking |
0.6 | 1 | 2022 | M2Bench: A Database Benchmark for Multi-Model Analytic Workloads · Proc. VLDB Endow. 2022 |
Data mining
clustering |
0.5 | 1 | 2021 | DISC: Density-Based Incremental Clustering by Striding over Streaming Data · ICDE 2021 |
Data mining › clustering
density-based clustering |
0.5 | 1 | 2021 | DISC: Density-Based Incremental Clustering by Striding over Streaming Data · ICDE 2021 |
Data mining › clustering › online clustering
incremental clustering |
0.5 | 1 | 2021 | DISC: Density-Based Incremental Clustering by Striding over Streaming Data · ICDE 2021 |
Data stream processing › continuous query processing
sliding window |
0.1 | 1 | 2021 | DISC: Density-Based Incremental Clustering by Striding over Streaming Data · ICDE 2021 |
Methods — techniques the papers use, named apart from their topics
benchmark design · 0.6incremental DBSCAN · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | M2Bench: A Database Benchmark for Multi-Model Analytic WorkloadsabstractAs the world becomes increasingly data-centric, the tasks dealt with by a database management system (DBMS) become more complex and diverse. Compared with traditional workloads that typically require only a single data model, modern-day computational tasks often involve multiple data sources and rely on more than one data model. Unfortunately, however, there is currently no standard benchmark program that can evaluate a DBMS in the various aspects of multi-model databases, especially when the array data model is concerned. In this paper, we propose M2Bench , a new benchmark program capable of evaluating a multi-model DBMS that supports several important data models such as relational, document-oriented, property graph, and array models. M2Bench consists of multi-model workloads that are inspired by real-world problems. Each task of the workload mimics a real-life scenario where at least two different models of data are involved. To demonstrate the efficacy of M2Bench , we evaluated polyglot or multi-model database systems with the M2Bench workloads and unfolded the diverse characteristics of the database systems for each data model. Bogyeong Kim, Kyoseung Koo, Undraa Enkhbat, Juhun Kim, Bongki Moon |
Proc. VLDB Endow. | 5 |
| 2021 | DISC: Density-Based Incremental Clustering by Striding over Streaming DataabstractGiven the prevalence of mobile and IoT devices, continuous clustering against streaming data has become an essential tool of increasing importance for data analytics. Among many clustering approaches, the density-based clustering has garnered much attention due to its unique advantages. The main drawback is, however, the limited scalability attributed to its relatively high computational cost, which is further aggravated when it has to update clusters continuously along with evolving data. In this paper, we present a new incremental density-based clustering algorithm called DISC optimized for the sliding window model. DISC is capable of producing exactly the same clustering results as existing methods such as Incremental DBSCAN for streaming data much more quickly and efficiently. Bogyeong Kim, Kyoseung Koo, Juhun Kim, Bongki Moon |
ICDE | 3 |
| 2021 | MISE: An Array-Based Integrated System for Atmospheric Scanning LiDARabstractResearchers suffer from two problems while building a data processing pipeline for atmospheric scanning LiDAR. First, they must build an entire system that handles collecting signals, processing data, and visualizing the results. Second, they should support fast data processing to expand and deploy their system. In this paper, we introduce MISE, a fast integrated system that handles atmospheric scanning LiDAR data. MISE provides end-to-end processing, configuration options, and predefined signal-processing methods. In addition, the system uses an efficient chunking approach for fast processing with an array database. We demonstrate the construction and operation of a fine-dust particle monitoring system (based on a real-world scenario) using MISE. This demonstration demonstrates the usability and fast performance of MISE. Kyoseung Koo, Juhun Kim, Bongki Moon |
SSDBM | 2 |