Jaesang Hwang

Jaesang Hwang

Auto-generated profile, based on publicly available information

Jaesang Hwang

Department of Computer Science and Engineering, Konkuk University, Seoul, Republic of Korea

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 August 2025 in IEEE Access
Verified
Journal Article
Open access
CJChristine Euna Jung
Christine Euna Jung
JHJaesang Hwang
Jaesang Hwang
YNYedam Na
Yedam Na
HLHaena Lee
Haena Lee
WKWook-Hee Kim
Wook-Hee Kim
Various devices such as smart cars, healthcare systems, and IoT platforms generate a massive amount of time series data. This type of data exhibits unique characteristics that pose new challenges for in-memory indexes, including heavy insert rates, monotonically increasing keys, and workloads dominated by range queries. In this paper, we propose a new in-memory index, Segmented Block-based Tree (SB-Tree), designed specifically for time series workloads. To support high insert throughput, SB-Tree decouples the index into a search layer and a data layer, and updates the search layer asynchronously to reduce write amplification. It introduces a shortcut mechanism to reduce tree traversal overhead and uses segmented blocks with per-thread data blocks to minimize contention during inserts. In addition, SB-Tree employs a lightweight block allocator to reduce system call overhead during memory management. We evaluate SB-Tree using synthetic time series workloads with varying levels of delayed data, inserting up to 1 billion keys across 80 threads. Our results show that SB-Tree outperforms state-of-the-art in-memory indexes, achieving up to $7\times $ higher throughput on insert-only workloads and $2.4\times $ lower 99.99th percentile tail latency on scan workloads compared to state-of-the-art.