Rethink the Scan in MVCC Databases

16Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Kim, J., Kim, K., Cho, H., Yu, J., Kang, S., & Jung, H. (2021). Rethink the Scan in MVCC Databases. In Proceedings of the ACM SIGMOD International Conference on Management of Data (pp. 938–950). Association for Computing Machinery. https://doi.org/10.1145/3448016.3452783

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free