The Community for Technology Leaders
2013 IEEE 29th International Conference on Data Engineering (ICDE) (2002)
San Jose, California
Feb. 26, 2002 to Mar. 1, 2002
ISBN: 0-7695-1531-2
pp: 0191
Dimitris Papadias , Hong Kong University of Science and Technology
Jun Zhang , Hong Kong University of Science and Technology
Yufei Tao , Hong Kong University of Science and Technology
ABSTRACT
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., banking) and emerging (e.g., spatio-temporal) applications. In this paper, we propose frameworks for reducing performance analysis of overlapping and multi-version structures to that of the corresponding ephemeral structures, thus simplifying the problem significantly. The frameworks lead to accurate cost models that predict the sizes of the trees, the node accesses and query selectivity. Although we focus on B-tree-based structures, the proposed models can be employed with a variety of indexes.
INDEX TERMS
Cost Modes, Overlapping, Multi-Version B-trees
CITATION
Dimitris Papadias, Jun Zhang, Yufei Tao, "Cost Models for Overlapping and Multi-Version B-Trees", 2013 IEEE 29th International Conference on Data Engineering (ICDE), vol. 00, no. , pp. 0191, 2002, doi:10.1109/ICDE.2002.994709
96 ms
(Ver 3.3 (11022016))