The BT-Tree: A Branched and Temporal Access Method

  • Linan Jiang ,
  • Betty Salzberg ,
  • David Lomet ,
  • Manuel Barrena

VLDB Conference |

Published by Very Large Data Bases Endowment Inc.

Temporal databases assume a single line of time evolution. In other words, they support time-evolving data. However there are applications which require the support of temporal data with branched time evolution. With new branches created as time proceeds, branched and temporal data tends to increase in size rapidly, making the need for efficient indexing crucial. We propose a new (paginated) access method for branched and temporal data: the BT-tree. The BT-tree is both storage efficient and access efficient. We have implemented the BT-tree and performance results confirm these properties.