DBScholar

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
2613
Venue
SIGMOD
Year
1991
Pagerank
7.7099874e-05
Overall Rank
3,145 | 78.43%
DOI
10.1145/115790.115861

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{lanka_sigmod91,
        title = {{Fully Persistent B+-trees}},
        author = {Lanka, Sitaram and Mays, Eric},
        series = {{SIGMOD} '91},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/115790.115861},
        url = {https://dl.acm.org/doi/10.1145/115790.115861},
        year = {1991}
}

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
1,408 A Unifying Framework for Version Control in a CAD Environment 1986 VLDB 0.00010855344
Previous Page 1 / 1 Next

Semantically Similar Papers