Abstract

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. Wehaveimplemented the BT-tree and performance results confirm these properties.

Citations