EDBT 2026 Demo / reviewers in the wild / expert
Undraa Enkhbat
dblp:322/1580
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 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 · 2 · 2 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 · 60% Database system architecture and tuning · 20% Data models and query languages · 20% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining
clustering |
0.6 | 1 | 2022 | DenForest: Enabling Fast Deletion in Incremental Density-Based Clustering over Sliding Windows · SIGMOD Conference 2022 |
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
density-based clustering |
0.6 | 1 | 2022 | DenForest: Enabling Fast Deletion in Incremental Density-Based Clustering over Sliding Windows · SIGMOD Conference 2022 |
Data mining › clustering › online clustering
incremental clustering |
0.6 | 1 | 2022 | DenForest: Enabling Fast Deletion in Incremental Density-Based Clustering over Sliding Windows · SIGMOD Conference 2022 |
Methods — techniques the papers use, named apart from their topics
spanning tree maintenance · 0.6logarithmic-time split detection · 0.6benchmark design · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | DenForest: Enabling Fast Deletion in Incremental Density-Based Clustering over Sliding WindowsabstractThe density-based clustering is utilized for various applications such as hot spot detection or segmentation. To serve those applications in real time, it is desired to update clusters incrementally by capturing only the recent data. The previous incremental density-based clustering algorithms often represent clusters as a graph and suffer serious performance degradation. This is because a costly graph traversal is required to check whether a cluster is still connected whenever a point is removed. In order to address the problem of slow deletion, this paper proposes a novel incremental density-based clustering algorithm called DenForest. By maintaining clusters as a group of spanning trees instead of a graph, DenForest can determine efficiently and accurately whether a cluster is to be split by a point removed from the window in logarithmic time. With extensive evaluations, it is demonstrated that DenForest outperforms the state-of-the-art density-based clustering algorithms significantly and achieves the clustering quality comparable with that of DBSCAN. Bogyeong Kim, Kyoseung Koo, Undraa Enkhbat, Bongki Moon |
SIGMOD Conference | 3 |
| 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. | 3 |