Beomseok Nam

dblp:39/6491 · DBLP profile ↗
← Back
12ranked-venue papers in the field
2as first author
4since 2021 · last 2026
0000-0001-5481-6070ORCID · verified

Domains — venue-derived; a paper can count in several

Big Data, Cloud & Distributed Data Systems · 7Database Systems & Data Management · 5 (2 first)
YearPublicationVenuePosition
2026 Lockify: Understanding Linux Distributed Lock Management Overheads in Shared Storage
Taeyoung Park, Yunjae Jo, Daegyu Han, Beomseok Nam, Jae-Hyun Hwang
FAST4
2023 On Stacking a Persistent Memory File System on Legacy File Systems
Hobin Woo, Daegyu Han, Seungjoon Ha, Sam H. Noh, Beomseok Nam
FAST5
2023 NV-SQL: Boosting OLTP Performance with Non-Volatile DIMMs
abstract
When running OLTP workloads, relational DBMSs with flash SSDs still suffer from the durability overhead. Heavy writes to SSD not only limit the performance but also shorten the storage lifespan. To mitigate the durability overhead, this paper proposes a new database architecture, NV-SQL. NV-SQL aims at absorbing a large fraction of writes written from DRAM to SSD by introducing NVDIMM into the memory hierarchy as a durable write cache. On the new architecture, NV-SQL makes two technical contributions. First, it proposes the re-update interval-based admission policy that determines which write-hot pages qualify for being cached in NVDIMM. It is novel in that the page hotness is based solely on pages' LSN. Second, this study finds that NVDIMM-resident pages can violate the page action consistency upon crash and proposes how to detect inconsistent pages using per-page in-update flag and how to rectify them using the redo log. NV-SQL demonstrates how the ARIES-like logging and recovery techniques can be elegantly extended to support the caching and recovery for NVDIMM data. Additionally, by placing write-intensive redo buffer and DWB in NVDIMM, NV-SQL eliminates the log-force-at-commit and WAL protocols and further halves the writes to the storage. Our NV-SQL prototype running with a real NVDIMM device outperforms the same-priced vanilla MySQL with larger DRAM by several folds in terms of transaction throughput for write-intensive OLTP benchmarks. This confirms that NV-SQL is a cost-performance efficient solution to the durability problem.
Mijin An, Tianzheng Wang 0001, Beomseok Nam, Sang-Won Lee 0001
Proc. VLDB Endow.4
2022 In-Page Shadowing and Two-Version Timestamp Ordering for Mobile DBMSs
abstract
Increasing the concurrency level in mobile database systems has not received much attention, mainly because the concurrency requirements of mobile workloads has been regarded to be low. Contrary to popular belief, mobile workloads require higher concurrency. In this work, we propose novel journaling and concurrency mechanisms for mobile DBMSs, both of which build upon one common concept - In-Page Shadowing (IPS). We design and implement a novel In-Page Shadowing recovery method for SQLite to resolve the journaling of journal anomaly, which is known to quadruple the I/O traffic in mobile devices. IPS unions the previous and the next versions of a database page in the same physical page. Using the consolidated two versions of database page, we design Two-Version Timestamp-Ordering (2VTO) protocol that enables non-blocking reads as in multi-version concurrency control, but reduces the garbage collection overhead. Designed with mobile environments in mind, IPS and 2VTO are high-performant and resource-efficient transactional solutions. Our performance study shows that IPS and 2VTO outperform state-of-the-art logging methods and an optimistic concurrency control protocol for real mobile workloads.
Lam-Duy Nguyen, Sang-Won Lee 0001, Beomseok Nam
Proc. VLDB Endow.3
2020 Doubleheader Logging: Eliminating Journal Write Overhead for Mobile DBMS
abstract
Various transactional systems use out-of-place up-dates such as logging or copy-on-write mechanisms to update data in a failure-atomic manner. Such out-of-place update methods double the I/O traffic due to back-up copies in the database layer and quadruple the I/O traffic due to the file system journaling. In mobile systems, transaction sizes of mobile apps are known to be tiny and transactions run at low concurrency. For such mobile transactions, legacy out-of-place update methods such as WAL are sub-optimal. In this work, we propose a crash consistent in-place update logging method - doubleheader logging (DHL) for SQLite. DHL prevents previous consistent records from being lost by performing a copy-on-write inside the database page and co-locating the metadata-only journal information within the page. This is done, in turn, with minimal sacrifice to page utilization. DHL is similar to when journaling is disabled, in the sense that it incurs almost no additional overhead in terms of both I/O and computation. Our experimental results show that DHL outperforms other logging methods such as out-of-place update write-ahead logging (WAL) and in-place update multi-version B-tree (MVBT).
Sehyeon Oh, Wook-Hee Kim, Jihye Seo, Hyeonho Song, Sam H. Noh, Beomseok Nam
ICDE6
2019 SLM-DB: Single-Level Key-Value Store with Persistent Memory
Olzhas Kaiyrakhmet, Songyi Lee, Beomseok Nam, Sam H. Noh, Young-ri Choi
FAST3
2019 Write-Optimized Dynamic Hashing for Persistent Memory
Moohyeon Nam, Hokeun Cha, Young-ri Choi, Sam H. Noh, Beomseok Nam
FAST5
2018 Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree
Deukyeon Hwang, Wook-Hee Kim, Youjip Won, Beomseok Nam
FAST4
2017 WORT: Write Optimal Radix Tree for Persistent Memory Storage Systems
Se Kwon Lee, K. Hyun Lim, Hyunsub Song, Beomseok Nam, Sam H. Noh
FAST4
2014 Resolving journaling of journal anomaly in android I/O: multi-version B-tree with lazy split
Wook-Hee Kim, Beomseok Nam, Youjip Won
FAST2
2012 High-throughput query scheduling with spatial clustering based on distributed exponential moving average
Beomseok Nam, Deukyeon Hwang, Jinwoong Kim, Minho Shin
Distributed Parallel Databases1
2004 A Comparative Study of Spatial Indexing Techniques for Multidimensional Scientific Datasets
Beomseok Nam, Alan Sussman
SSDBM1