Advertisement

The BTR-Tree: Path-Defined Version-Range Splitting in a Branched and Temporal Structure

  • Linan Jiang
  • Betty Salzberg
  • David Lomet
  • Manuel Barrena
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2750)

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.

Keywords

Current Version Version Range Multiple Parent Record Variant Data Page 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)Google Scholar
  2. 2.
    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)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Easton, M.C.: Key-sequence data sets on indelible storage. IBM J. Res. Development 30(3), 230–241 (1986)CrossRefGoogle Scholar
  4. 4.
    Evangelidis, G., Lomet, D., Salzberg, B.: The hB-Π-tree: A Multiattribute Index Supporting Concurrency, Recovery and Node Consolidation. VLDB Journal 6(1) (1997)Google Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    Landau, G.M., Schmidt, J.P., Tsotras, V.J.: Historical queries along multiple lines of time evolution. VLDB Journal 4, 703–726 (1995)CrossRefGoogle Scholar
  7. 7.
    Lanka, S., Mays, E.: Fully persistent B+-trees. In: Proceedings of the ACM SIGMOD conference on Management of Data, Denver, CO (1991)Google Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    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)Google Scholar
  10. 10.
    Tsotras, V.J., Kangelaris, N.: The snapshot index: An I/O-optimal access method for timeslice queries. Information Systems 20(3), 237–260 (1995)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Linan Jiang
    • 1
  • Betty Salzberg
    • 2
  • David Lomet
    • 3
  • Manuel Barrena
    • 4
  1. 1.Oracle Corp.Redwood ShoresUSA
  2. 2.College of Computer ScienceNortheastern UniverityBostonUSA
  3. 3.Microsoft ResearchOne Microsoft WayRedmondUSA
  4. 4.Universidad de ExtremaduraCáceresSpain

Personalised recommendations