Handling infinite temporal data
- 2 April 1990
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 392-403
- https://doi.org/10.1145/298514.298590
Abstract
In this paper, we present a powerful framework for describing, storing, and reasoning about infinite temporal information. This framework is an extension of classical relational databases. It represents infinite temporal information by generalized tuples defined by linear repeating points and constraints on these points. We prove that relations formed from generalized tuples are closed under the operations of relational algebra. A characterization of the expressiveness of generalized relations is given in terms of predicates definable in Presburger arithmetic. Finally, we provide some complexity results.Keywords
This publication has 15 references indexed in Scilit:
- Adding time dimension to relational model and extending relational algebraInformation Systems, 1986
- A temporally oriented data modelACM Transactions on Database Systems, 1986
- Making believers out of computersArtificial Intelligence, 1986
- Automata-theoretic techniques for modal logics of programsJournal of Computer and System Sciences, 1986
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986
- Checking that finite state concurrent programs satisfy their linear specificationPublished by Association for Computing Machinery (ACM) ,1985
- Towards a general theory of action and timeArtificial Intelligence, 1984
- Maintaining knowledge about temporal intervalsCommunications of the ACM, 1983
- Formal semantics for time in databasesACM Transactions on Database Systems, 1983
- On fourier’s analysis of linear inequality systemsPublished by Springer Nature ,1974