The BT-tree: A Branched and Temporal Access Method
Linan Jiang, Betty Joan Salzberg, David Lomet, Manuel Barrena García · 2000
Temporal databases assume a single line of time evolution. In other words, they support timeevolving 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. 1 Introduction There are many database applications that require the support of time-evolving data. Temporal database systems model explicitly the temporal behavior of data, thus providing the ability to store and query temporal data efficiently [9]. Conventional temporal databases assume a single line of time evolution. As an example, consider an architect's design of a new house (say J...