Please use this identifier to cite or link to this item:

Cost models for overlapping and multiversion structures

Authors Tao, Yufei
Papadias, Dimitris
Zhang, Jun
Issue Date 2002
Source ACM transactions on database systems, v. 27, (3), 2002, p. 299-342
Summary Overlapping and multi-version techniques are two popular frameworks that transform an ephemeral index into a multiple logical-tree structure in order to support versioning databases. Although both frameworks have produced numerous efficient indexing methods, their performance analysis is rather limited; as a result there is no clear understanding about the behavior of the alternative structures and the choice of the best one, given the data and query characteristics. Furthermore, query optimization based on these methods is currently impossible. These are serious problems due to the incorporation of overlapping and multi-version techniques in several traditional (e.g., financial) and emerging (e.g., spatio-temporal) applications. In this paper, we reduce performance analysis of overlapping and multi-version structures to that of the corresponding ephemeral structures, thus simplifying the problem significantly. This reduction leads to accurate cost models that predict the sizes of the trees, the node/page accesses and selectivity of queries. Furthermore, the models offer significant insight into the behavior of the structures and provide guidelines about the selection of the most appropriate method in practice. Extensive experimentation proves that the proposed models yield error below 5% and 15% for uniform and non-uniform data respectively.
Rights © ACM, 2002. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM Transactions on Database Systems, v. 27, no. 3, 2002, p. 299-342
Language English
Format Article
Access View full-text via DOI
Files in this item:
File Description Size Format
TODS02CM.pdf pre-published version 563382 B Adobe PDF