TY - CHAP
T1 - Chapter 14 Temporal databases
AU - Chomicki, Jan
AU - Toman, David
PY - 2005
Y1 - 2005
N2 - Time is ubiquitous in information systems. Almost every enterprise faces the problem of its data becoming out of date. However, such data is often valuable, so it should be archived and some means of accessing it should be provided. Also, some data may be inherently historical, e.g., medical, cadastral, or judicial records. Temporal databases provide a uniform and systematic way of dealing with historical data. This chapter develops point-based data models and query languages for temporal databases in the relational framework. The models provide a separation between the conceptual data (what is stored in the database) and the way the data is compactly represented in the temporal relations (how it is stored). This approach leads to a clean and elegant data model while still providing an efficient implementation path. The foundations of the approach can be traced to the constraint database technology [Kanellakis et al., 1995]: constraint representation is used as the basis for a space-efficient representation of temporal relations.
AB - Time is ubiquitous in information systems. Almost every enterprise faces the problem of its data becoming out of date. However, such data is often valuable, so it should be archived and some means of accessing it should be provided. Also, some data may be inherently historical, e.g., medical, cadastral, or judicial records. Temporal databases provide a uniform and systematic way of dealing with historical data. This chapter develops point-based data models and query languages for temporal databases in the relational framework. The models provide a separation between the conceptual data (what is stored in the database) and the way the data is compactly represented in the temporal relations (how it is stored). This approach leads to a clean and elegant data model while still providing an efficient implementation path. The foundations of the approach can be traced to the constraint database technology [Kanellakis et al., 1995]: constraint representation is used as the basis for a space-efficient representation of temporal relations.
UR - https://www.scopus.com/pages/publications/77956782657
U2 - 10.1016/S1574-6526(05)80016-1
DO - 10.1016/S1574-6526(05)80016-1
M3 - Chapter
T3 - Foundations of Artificial Intelligence
SP - 429
EP - 467
BT - Foundations of Artificial Intelligence
PB - Elsevier
ER -