Abstract
There are applications which require the support of temporal data with branched time evolution, called branched-and-temporal data. In a branched-and-temporal database, both historic versions and current versions are allowed to be updated. We present an access method, the BTR-Tree, for branched-and-temporal databases with reasonable space and access time tradeoff. It is an index structure based on the BT-Tree 5. The BT-Tree always splits at a current version whenever a data page or an index page is full. The BTR-Tree is able to split at a previous version while still keeping the posting property that only one parent page needs to be updated. The splitting policy of the BTR-Tree is designed to reduce data redundancy in the structure introduced by branching. Performance results show that the BTR-Tree has better space efficiency and similar query efficiency than the BT-Tree, with no overhead in search and posting algorithm complexity.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Becker, B., Gschwind, S., Ohler, T., Seeger, B., Widmayer, P.: On optimal multiversion access structures. In: Abel, D.J., Ooi, B.-C. (eds.) SSD 1993. LNCS, vol. 692, pp. 123–141. Springer, Heidelberg (1993)
Driscoll, J.R., Sarnak, N., Sleator, D.D., Tarjan, R.E.: Making data structures persistent. Journal of Computer and System Sciences 38, 86–124 (1989)
Easton, M.C.: Key-sequence data sets on indelible storage. IBM J. Res. Development 30(3), 230–241 (1986)
Evangelidis, G., Lomet, D., Salzberg, B.: The hB-Π-tree: A Multiattribute Index Supporting Concurrency, Recovery and Node Consolidation. VLDB Journal 6(1) (1997)
Jiang, L., Salzberg, B., Lomet, D., Barrena, M.: The BT-tree: A branched and temporal access method. In: International Conference on Very Large Data Bases, Cairo, Egypt, September 2000, pp. 451–460 (2000)
Landau, G.M., Schmidt, J.P., Tsotras, V.J.: Historical queries along multiple lines of time evolution. VLDB Journal 4, 703–726 (1995)
Lanka, S., Mays, E.: Fully persistent B+-trees. In: Proceedings of the ACM SIGMOD conference on Management of Data, Denver, CO (1991)
Lomet, D., Salzberg, B.: The performance of a multiversion access method. In: Proceedings of the ACM SIGMOD conference on Management of Data, pp. 354–363 (1990)
Muth, P., O’neil, P., Pick, A., Weikum, G.: Design, implementation, and performance on the LHAM log-structured history data access method. In: Proceedings of the 24th VLDB Conference, New York, pp. 452–463 (1998)
Tsotras, V.J., Kangelaris, N.: The snapshot index: An I/O-optimal access method for timeslice queries. Information Systems 20(3), 237–260 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jiang, L., Salzberg, B., Lomet, D., Barrena, M. (2003). The BTR-Tree: Path-Defined Version-Range Splitting in a Branched and Temporal Structure. In: Hadzilacos, T., Manolopoulos, Y., Roddick, J., Theodoridis, Y. (eds) Advances in Spatial and Temporal Databases. SSTD 2003. Lecture Notes in Computer Science, vol 2750. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45072-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-45072-6_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40535-1
Online ISBN: 978-3-540-45072-6
eBook Packages: Springer Book Archive