Modification and Retrieval Algorithms for Bitemporal Databases

Abstract

Three system-level algorithms are proposed for time-related modification and retrieval in bitemporal databases. The algorithms adopt several strategies in their design, such as attribute-value timestamping, a special type of multi-lists for data storage and name-independency in operation calls. They also make use of two virtual data values：empty and null. The value empty makes single-values representation of consecutive time-intervals feasible, whereas the value null provides a limited capability of ‘resuming’ a value processed previously. The algorithms are superior to some existing ones in both storage space and efficiency.