About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
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 block 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. © 1991, ACM. All rights reserved.