Indexing alternatives for multiversion locking

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we present several options for extending single-version indexing schemes for use with multiversion two-phase locking. The proposed options are orthogonal to the underlying indexing structure (e.g., hashing or B+ trees). The options differ in where they place references to individual versions; this version selection information is placed either with the data or in the leaf entries of one or more indices. We also briefly summarize the results of a performance study showing that storing version selection information with the data is usually the best option because it keeps indices smaller, thus enabling a larger fraction of the indices to remain cached in the buffer pool.

Cite

CITATION STYLE

APA

Bober, P. M., & Carey, M. J. (1994). Indexing alternatives for multiversion locking. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 779 LNCS, pp. 145–158). Springer Verlag. https://doi.org/10.1007/3-540-57818-8_48

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free