Bi-temporal access methods
A bi-temporal index is a data structure that supports both temporal time dimensions, namely, transaction time (the time when a fact is stored in the database) and valid time (the time when a fact becomes valid in reality). The characteristics of the time dimensions supported imply various properties that the bi-temporal index should have to be efficient. As traditional indices, the performance of a temporal index is described by three costs: (i) storage cost (i.e., the number of pages the index occupies on the disk), (ii) update cost (the number of pages accessed to perform an update on the index, e.g., when adding, deleting, or updating a record), and (iii) query cost (the number of pages accessed for the index to answer a query).
Most of the early work on temporal indexing has concentrated on providing solutions for transaction-time databases. A basic property of transaction time is that it always increases. Each...
- 2.Bliujute R, Jensen CS, Saltenis S, Slivinskas G. R-tree based indexing of now-relative bitemporal data. In: Proceedings of the 24th International Conference on Very Large Data Bases; 1998. p. 345–56.Google Scholar
- 6.Nascimento MA, Silva JRO. Towards historical R-trees. In: Proceedings of the 1998 ACM Symposium on Applied Computing; 1998. p. 235–40.Google Scholar