## Abstract

The relational algebra is a procedural query language for relational databases. In this paper we survey extensions of the relational algebra that can query databases recording time-varying data. Such an algebra is a critical part of a temporal DBMS. We identify 26 criteria that provide an objective basis for evaluating temporal algebras, Seven of the criteria are shown to be mutually unsatisfiable, implying there can be no perfect temporal algebra, Choices made as to which of the incompatible criteria are satisfied characterize existing algebras Twelve time-oriented algebras are summarized and then evaluated against the criteria. We demonstrate that the design space has in some sense been explored in that all combinations of basic design decisions have at least one representative algebra. Coverage of the remaining criteria provides one measure of the quality of each algebra We argue that all of the criteria are independent and that the criteria identified as compatible are indeed so, Finally, we list plausible properties proposed by others that are either subsumed by other criteria, are not well defined, or have no objective basis for being evaluated. The algebras realize many different approaches to what appears initially to be a straightforward design task.

Original language | English (US) |
---|---|

Pages (from-to) | 501-543 |

Number of pages | 43 |

Journal | ACM Computing Surveys (CSUR) |

Volume | 23 |

Issue number | 4 |

DOIs | |

State | Published - Jan 12 1991 |

## Keywords

- aggregate
- chronon
- historical relation
- homogeneity
- query optimization
- snapshot relation
- transaction time
- valid time

## ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)