Representation and querying in temporal databases: the power of temporal constraints
Published 30 December 2002Open access
Manolis Koubarakis
Citations45
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A temporal database model capable of representing absolute, relative, imprecise, and infinite temporal data is proposed, and an algebraic query language for temporal tables is defined, and some problems related to query answering are discussed.
Abstract
A temporal database model capable of representing absolute, relative, imprecise, and infinite temporal data is proposed. The model is based on temporal tables such as relation-like representations that can contain variables constrained by the formulas of a temporal theory. An algebraic query language for temporal tables is defined, and some problems related to query answering are discussed
Keywords
Computer Science
Artificial IntelligenceTowards a general theory of action and time
2,562 Citations1984James F. Allen
A formalism for reasoning about actions that is based on a temporal logic allows a much wider range of actions to be described than with previous approaches such as the situation calculus and a framework for planning in a dynamic world with external events and multiple agents is suggested.
Journal of the ACMIncomplete Information in Relational Databases
1,018 Citations1984Tomasz Imieliński, Witold Lipski
There are precise conditions that should be satisfied in a semantically meaningful extension of the usual relational operators, such as projection, selection, union, and join, from operators on relations to operators on tables with “null values” of various kinds allowed.
ACM Transactions on Information SystemsTelos: representing knowledge about information systems
787 Citations1990John Mylopoulos, Alex Borgida +2 more
Telos is a language intended to support the development of information systems based on the premise that information system development is knowledge intensive and that the primary responsibility of any language intended for the task is to be able to formally represent the relevent knowledge.
Journal of Computer and System SciencesConstraint Query Languages
679 Citations1995Paris C. Kanellakis, Gabriel M. Kuper +1 more
It is shown that efficient, declarative database programming can be combined with efficient constraint solving and the key intuition is that the generalization of a ground fact is a conjunction of constraints over a small number of variables.
Reasoning About Change: Time and Causation from the Standpoint of Artificial Intelligence
522 Citations1987Yoav Shoham
Artificial IntelligenceTemporal data base management
392 Citations1987Thomas Dean, Drew McDermott
The system described in this paper extends classical predicate-calculus data bases, such as those used by PROLOG, to deal with time in an efficient and natural manner to perform the temporal analog of (static) reason maintenance.
Combining Qualitative and Quantitative Constraints in Temporal Reasoning
215 Citations1995Itay Meiri
Constraint query languages (preliminary report)
197 Citations1990Paris C. Kanellakis, Gabriel M. Kuper +1 more
It is shown that bottom-up, efficient, declarative database programming can be combined with efficient constraint solving, and the key intuition is that the generalization of a ground fact, or tuple, is a conjunction of constraints.
Lecture notes in computer scienceThe Problem of Incomplete Information in Relational Databases
186 Citations1991
Handling infinite temporal data
145 Citations1990F. Kabanza, J.-M. Stevenne +1 more
It is proved that relations formed from generalized tuples are closed under the operations of relational algebra, and a characterization of the expressiveness of generalized relations is given in terms of predicates definable in Presburger arithmetic.
ACM SIGMOD RecordTemporal databases status and research directions
97 Citations1990Richard T. Snodgrass
The evolution of this field is characterized, as an introduction to the approximately 350 papers specifically relating time to databases that have appeared thus far, and areas where more work is needed are identified.
Very Large Data BasesIncomplete Information in Relational Temporal Databases
52 Citations1992Shashi K. Gadia, Sunil S. Nair +1 more
The model generalizes the previous model for complete temporal information and shows that it is shown that the relational operators produce results that are reliable and that if the definitions of the onerators were strengthened to give more information, the results may be not reliable.
Representation and querying in temporal databases: the power of temporal constraints
45 Citations2002Manolis Koubarakis
A temporal database model capable of representing absolute, relative, imprecise, and infinite temporal data is proposed, and an algebraic query language for temporal tables is defined, and some problems related to query answering are discussed.
Very Large Data BasesTemporal Relationships in Databases
17 Citations1988Surajit Chaudhuri
An interesting computational model for the temporal domain is presented that trades completeness of the deduction for computational efficiency and provides a framework to estimate the cost of query evaluation and to identify domain characteristics for query optimization.