DBScholar

Back to papers

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)

Paper ID
10858
Venue
VLDB
Year
2013
Pagerank
5.9675155e-05
Overall Rank
6,126 | 57.98%
DOI
10.14778/2556549.2556566

Incoming Non-self Citations Over Time

Authors

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 3 of 3 citing papers.

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.

Previous Page 1 / 1 Next

Semantically Similar Papers