Temporal Databases: Beyond Finite Extensions (position paper)

We argue that temporal databases should not be restricted to relations with finite extensions. Many temporal events are periodic and have no natural bounds. Moreover, such events have a more compact representation when allowed to be unbounded. We present two formalisms for representing and querying possibly infinite periodic data and discuss some of their properties, including expressiveness and query evaluation complexity. Finally, we turn to implementation issues and argue that significant extensions to existing database systems are necessary in order to implement the frameworks we describe.

[1]  Hamid Pirahesh,et al.  Extensions to Starburst: objects, types, functions, and rules , 1991, CACM.

[2]  Harry K. T. Wong,et al.  The role of time in information processing: a survey , 1982, SGMD.

[3]  Pierre Wolper,et al.  Handling Infinite Temporal Data , 1995, J. Comput. Syst. Sci..

[4]  John Wylie Lloyd,et al.  Foundations of Logic Programming , 1987, Symbolic Computation.

[5]  Jeffrey D. Ullman,et al.  Principles of Database and Knowledge-Base Systems, Volume II , 1988, Principles of computer science series.

[6]  Christian S. Jensen,et al.  Proposal for a Data Model for the Temporal Structured Query Language , 1992 .

[7]  M. Baudinet.  Logic programming semantics: techniques and applications , 1989 .

[8]  Laurent Fribourg,et al.  Bottom-up Evaluation of Datalog Programs with Arithmetic Constraints , 1994, CADE.

[9]  Jan Chomicki,et al.  Temporal deductive databases and infinite objects , 1988, PODS.

[10]  Michael Stonebraker,et al.  The POSTGRES next generation database management system , 1991, CACM.

[11]  R. Snodgrass,et al.  A Taxonomy of Time in Databases March , 1985 · ' , 1985 .

[12]  Marianne Baudinet,et al.  Temporal logic programming is complete and expressive , 1989, POPL '89.

[13]  Richard T. Snodgrass,et al.  Temporal databases status and research directions , 1990, SGMD.

[14]  Peter Z. Revesz.  A Closed Form for Datalog Queries with Integer Order , 1990, ICDT.

[15]  Jan Chomicki,et al.  Functional deductive databases: query processing in the presence of limited function symbols , 1990 .

[16]  Marianne Baudinet,et al.  Temporal Deductive Databases , 1993, Temporal Databases.

[17]  Moshe Y. Vardi.  The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.

[18]  Jan Chomicki,et al.  Finite representation of infinite query answers , 1993, TODS.

[19]  Jeffrey D. Ullman,et al.  Principles Of Database And Knowledge-Base Systems , 1979 .

[20]  John Grant,et al.  The impact of logic programming on databases , 1992, CACM.

[21]  Marianne Baudinet,et al.  On the representation of infinite temporal data and queries (extended abstract) , 1991, PODS '91.

[22]  Martín Abadi,et al.  Temporal Logic Programming , 1989, J. Symb. Comput..

[23]  Jack Minker,et al.  Logic and Databases: A Deductive Approach , 1984, CSUR.

[24]  Gabriel M. Kuper,et al.  Constraint Query Languages , 1995, J. Comput. Syst. Sci..

[25]  Arie Segev,et al.  A glossary of temporal database concepts , 1992, SGMD.

[26]  Robert A. Kowalski,et al.  The Semantics of Predicate Logic as a Programming Language , 1976, JACM.

[27]  Michael D. Soo,et al.  Bibliography on temporal databases , 1991, SGMD.

[28]  Richard T. Snodgrass,et al.  The temporal query language TQuel , 1987, TODS.

[29]  Jan Chomicki,et al.  Relational specifications of infinite query answers , 1989, SIGMOD '89.