Efficient Bulk Updates on Multiversion B-trees
Summary: First bulk-loading algorithm for Multiversion B-Tree (MVBT) achieving the external-sort lower bound; enables bulk updates. Uses weight balancing and buffer-tree techniques to deliver efficient partially persistent indexing; experiments show bulk loading far faster than tuple-by-tuple updates. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Daniar Achakeev (Philipps University Marburg)
- 2. Bernhard Seeger (Philipps University Marburg)
BibTeX Citation
@article{achakeev_vldb13,
title = {{Efficient Bulk Updates on Multiversion B-trees}},
author = {Achakeev, Daniar and Seeger, Bernhard},
journal = {PVLDB},
series = {{VLDB} '13},
volume = {6},
number = {14},
pages = {1834--1845},
doi = {10.14778/2556549.2556566},
url = {https://doi.org/10.14778/2556549.2556566},
year = {2013}
}Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,495 | Provenance-based Data Skipping | 2022 | VLDB | 5.3304338e-05 |
| 9,750 | DITIR: Distributed Index for High Throughput Trajectory Insertion and Real-time Temporal Range Query | 2017 | VLDB | 5.1349531e-05 |
| 10,366 | Bounding the Fragmentation of B-Trees Subject to Batched Insertions | 2026 | PODS | 4.9793485e-05 |
| 10,992 | Demonstrating Indexing for Near-Sorted Data | 2026 | VLDB | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 687 | Access Methods For Multiversion Data | 1989 | SIGMOD | 0.00014763858 |
| 1,956 | A Generic Approach to Bulk Loading Multidimensional Index Structures | 1997 | VLDB | 9.3169059e-05 |
| 2,310 | The MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries | 2001 | VLDB | 8.6626285e-05 |
| 2,526 | Stream Warehousing with DataDepot | 2009 | SIGMOD | 8.3432541e-05 |
| 2,847 | Transaction Time Indexing with Version Compression | 2008 | VLDB | 7.9447157e-05 |
| 6,557 | Optimal Splitters for Temporal and Multi-version Databases | 2013 | SIGMOD | 5.7498216e-05 |
| 7,734 | Query Processing Techniques for Multiversion Access Methods | 1996 | VLDB | 5.4640143e-05 |
| 8,222 | The HV-tree: a Memory Hierarchy Aware Version Index | 2010 | VLDB | 5.3751545e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,364 | An Evaluation of Generic Bulk Loading Techniques | 2001 | VLDB |
| 2 | 3,855 | Making Updates Disk-I/O Friendly Using SSDs | 2013 | VLDB |
| 3 | 2,064 | Query and Update Efficient B+-Tree Based Indexing of Moving Objects | 2004 | VLDB |
| 4 | 631 | Persistent B+-Trees in Non-Volatile Main Memory | 2015 | VLDB |
| 5 | 1,956 | A Generic Approach to Bulk Loading Multidimensional Index Structures | 1997 | VLDB |
| 6 | 10,413 | ART That Lasts: Persistent Multiversion Adaptive Radix Trees with Fast Atomic Range Queries | 2026 | SIGMOD |
| 7 | 3,205 | Fully Persistent B+-trees | 1991 | SIGMOD |
| 8 | 11,232 | Efficient Concurrent Updates to Persistent Randomized Binary Search Trees | 2025 | VLDB |
| 9 | 3,077 | The Performance Of A Multiversion Access Method | 1990 | SIGMOD |
| 10 | 7,734 | Query Processing Techniques for Multiversion Access Methods | 1996 | VLDB |