Fully persistent B+-trees
- 1 April 1991
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMOD Record
- Vol. 20 (2) , 426-435
- https://doi.org/10.1145/119995.115861
Abstract
In this paper, we investigate efficiently maintaining multiple versions of B+-trees. We propose two main schemes: the fat field method and the pure version b~ock method. The former method is suitable for range queries or whenever lookup on a released version is an important issue. The latter method is more space efficient, and is suitable when the total number of keys from all the versions are small.Keywords
This publication has 4 references indexed in Scilit:
- A persistent store for large shared knowledge basesIEEE Transactions on Knowledge and Data Engineering, 1991
- Making data structures persistentJournal of Computer and System Sciences, 1989
- Ubiquitous B-TreeACM Computing Surveys, 1979
- B-trees re-examinedCommunications of the ACM, 1978