Database Paper Browser

Back to papers

Fully Persistent B+-trees

Summary: Fully persistent B+-trees with two schemes: fat-node and pure version-block. Fat-node supports range queries and lookups on released versions; version-block is space-efficient when total keys across versions are small, while an earlier index reduces version-resolution accesses at high space cost for a few versions. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2551
Venue
SIGMOD
Year
1991
Pagerank
7.842391e-05
Overall Rank
2,942 | 79.54%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
965 A Unifying Framework for Version Control in a CAD Environment 1986 VLDB 0.00014973153
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
7,481 Buffered Persistence in B+ Trees 2024 SIGMOD 4.7180617e-05
531 Improving Index Performance through Prefetching 2001 SIGMOD 0.00020790058
1,982 On-line Reorganization of Sparsely-populated B+-trees 1996 SIGMOD 9.8662834e-05
6,480 Efficient Search of Multidimensional B-Trees 1995 VLDB 5.0475112e-05
1,774 Query and Update Efficient B+-Tree Based Indexing of Moving Objects 2004 VLDB 0.00010604097
8,065 The HV-tree: a Memory Hierarchy Aware Version Index 2010 VLDB 4.5937864e-05
10,562 FB+-tree: A Memory-Optimized B+-tree with Latch-Free Update 2025 VLDB 4.1945683e-05
819 Persistent B+-Trees in Non-Volatile Main Memory 2015 VLDB 0.00016298164
3,007 The Performance Of A Multiversion Access Method 1990 SIGMOD 7.7270764e-05
7,208 Efficient Bulk Updates on Multiversion B-trees 2013 VLDB 4.7998295e-05