Rethink the Scan in MVCC Databases
Jong-Bin Kim, Kihwang Kim, Hyunsoo Cho, Jaeseon Yu, Sooyong Kang, Hyungsoo Jung
Abstract
A scan is one of the fundamental operations in databases for retrieving tuples from tables, and research on access methods has been of importance to query optimization. However, our community is aware of the inconvenient truth that its performance may plummet amid steep increases in search costs when acting on MVCC databases since multi-versioning may forfeit all the benefits of using database indexes. An execution plan for a query on multi-versioned data often comprises a series of point lookup operations, of which each internally executes a linear traversal of record versions. Therefore, the generated plan is surprisingly worse than a full table (or version store) scan, mainly due to redundant access to database pages. To address such an all-or-nothing approach, we propose version weaver (vWeaver), a light-weight access method for record versions, that expedites a scan on record versions with each being augmented by just a few pointer fields. vWeaver incrementally constructs a version search structure over even an append-only version store (e.g., undo space) and allows a scan to traverse new version search structures for fast lookup. We applied vWeaver to in-memory and disk-based MVCC databases and demonstrated that the systems with vWeaver generally improved scan performance under various workloads with negligible space overhead.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 0771a7c4-c2f0-4359-8def-05f69ea40d9dCited by top-tier papers9
- Memory-Optimized Multi-Version Concurrency Control for Disk-Based Database SystemsMichael J. Freitag, Alfons Kemper, Thomas NeumannVLDB 2022 · 14 citations
- Deploying Computational Storage for HTAP DBMSs Takes More Than Just Computation OffloadingKitaek Lee, Insoon Jo, Jaechan Ahn, Hyuk Lee et al.VLDB 2023 · 14 citations
- Revisiting Secondary Indexing in LSM-based Storage Systems with Persistent MemoryJing Wang, Youyou Lu, Qing Wang, Yuhao Zhang et al.USENIX ATC 2023 · 13 citations
- AeonG: An Efficient Built-in Temporal Support in Graph DatabasesJiamin Hou, Zhanhao Zhao, Zhouyu Wang, Wei Lu et al.VLDB 2024 · 8 citations
- One-shot Garbage Collection for In-memory OLTP through Temporality-aware Version StorageAunn Raza, Periklis Chrysogelos, Angelos-Christos G. Anadiotis, Anastasia AilamakiSIGMOD 2023 · 7 citations
Related papers
- Diva: Making MVCC Systems HTAP-FriendlyJong-Bin Kim, Jaeseon Yu, Jaechan Ahn, Sooyong Kang et al.SIGMOD 2022 · 12 citations
- LiveBin: A Localized and Version-Aware Binned Scan IndexZikang Liu, Linwei Li, Fei Ye, Zhenying He et al.SIGMOD 2026
- Scalable Garbage Collection for In-Memory MVCC SystemsJan Böttcher, Viktor Leis, Thomas Neumann, Alfons KemperVLDB 2020 · 50 citations
- BinDex: A Two-Layered Index for Fast and Robust ScansLinwei Li, Kai Zhang, Jiading Guo, Wen He et al.SIGMOD 2020 · 8 citations
- TVA: A Version-aware Temporal Graph Storage System for Real-time AnalyticsWenhao Li, Zhanhao Zhao, Jinhao Dong, Jiamin Hou et al.VLDB 2026
