EDBT 2026 Demo / reviewers in the wild / expert
Jeonghun Yoon
dblp:26/11277
· DBLP profile ↗
2ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 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.
| Theoretical computer science
1 paper |
Algorithms and data structures · 75% Computational geometry · 25% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Algorithms and data structures › memory hierarchy
external memory data structures |
0.2 | 1 | 2013 | I/O-efficient planar range skyline and attrition priority queues · PODS 2013 |
Algorithms and data structures › memory hierarchy › external memory data structures
i/o-efficient data structures |
0.2 | 1 | 2013 | I/O-efficient planar range skyline and attrition priority queues · PODS 2013 |
Algorithms and data structures
priority queues |
0.2 | 1 | 2013 | I/O-efficient planar range skyline and attrition priority queues · PODS 2013 |
Computational geometry
range searching |
0.2 | 1 | 2013 | I/O-efficient planar range skyline and attrition priority queues · PODS 2013 |
Methods — techniques the papers use, named apart from their topics
linear-space data structure · 0.2external memory model · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | I/O-efficient 2-d orthogonal range skyline and attrition priority queues
Casper Kejlberg-Rasmussen, Yufei Tao 0001, Konstantinos Tsakalidis, Kostas Tsichlas, Jeonghun Yoon |
Comput. Geom. | 5 |
| 2013 | I/O-efficient planar range skyline and attrition priority queuesabstractWe study the static and dynamic planar range skyline reporting problem in the external memory model with block size B, under a linear space budget. The problem asks for an O(n/B) space data structure that stores n points in the plane, and supports reporting the k maximal input points (a.k.a.skyline) among the points that lie within a given query rectangle Q = [α1[α2] × [β1β2. When Q is 3-sided, i.e. one of its edges is grounded, two variants arise: top-open for β2 = ∞ and left-open for α1 = - ∞ (symmetrically bottom-open and right-open) queries. Casper Kejlberg-Rasmussen, Yufei Tao 0001, Konstantinos Tsakalidis, Kostas Tsichlas, Jeonghun Yoon |
PODS | 5 |