Abstract
We define formal notions of temporal domain and temporal database, and use them to survey a wide spectrum of temporal query languages. We distinguish between an abstract temporal database and its concrete representations, and accordingly between abstract and concrete temporal query languages. We also address the issue of incomplete temporal information.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
K.R. Apt, H.A. Blair, and A. Walker. Towards a Theory of Declarative Knowledge. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 89–148. Morgan Kaufmann, 1988.
P. Atzeni and V. De Antonellis. Relational Database Theory. Benjamin/Cummings, 1993.
J.F. Allen. Maintaining Knowledge about Temporal Intervals. Communications of the ACM, 26(11):832–843, November 1983.
M. Abadi and Z. Manna. Temporal Logic Programming. Journal of Symbolic Computation, 8(3), September 1989.
S. Abiteboul and V. Vianu. Expressive Power of Query Languages. In Theoretical Studies in Computer Science. Academic Press, 1992.
M. Baudinet. Temporal Logic Programming is Complete and Expressive. In ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, 1989.
M. Baudinet. On the Expressiveness of Temporal Logic Programming. Information and Computation, 1994. To appear.
M. Baudinet, J. Chomicki, and P. Wolper. Temporal Deductive Databases. In A. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, and R. Snodgrass, editors, Temporal Databases: Theory, Design, and Implementation, pages 294–320. Benjamin/Cummings, 1993.
M. Baudinet, J. Chomicki, and P. Wolper. Constraint-Generating Dependencies. In Workshop on Principles and Practice of Constraint Programming, Orcas Island, Washington, May 1994.
C. Beeri. A formal approach to object-oriented databases. Data and Knowledge Engineering, 5:353–382, 1990.
A. Brodsky, J. Jaffar, and M.J. Maher. Towards Practical Constraint Databases. In International Conference on Very Large Data Bases, 1993.
M. Baudinet, M. Niézette, and P. Wolper. On the Representation of Infinite Temporal Data and Queries. In ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1991.
J. Clifford and A. Croker. The Historical Relational Data Model (HRDM) and Algebra Based on Lifespans. In IEEE International Conference on Data Engineering, 1987.
J. Clifford and A. Croker. The Historical Relational Data Model (HRDM) Revisited. In A. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, and R. Snodgrass, editors, Temporal Databases: Theory, Design, and Implementation, pages 6–27. Benjamin/Cummings, 1993.
J. Clifford, A. Croker, and A. Tuzhilin. On Completeness of Historical Relational Query Languages. ACM Transactions on Database Systems, 19(1):64–116, March 1994.
A.K. Chandra and D. Harel. Computable Queries for Relational Databases. Journal of Computer and System Sciences, 21:156–178, 1980.
A.K. Chandra and D. Harel. Structure and Complexity of Relational Queries. Journal of Computer and System Sciences, 25:99–128, 1982.
A.K Chandra. Theory of Database Queries. In ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 1–9, 1988.
S. Chaudhuri. Temporal Relationships in Databases. In International Conference on Very Large Data Bases, 1988.
J. Chomicki. Functional Deductive Databases: Query Processing in the Presence of Limited Function Symbols. PhD thesis, Rutgers University, New Brunswick, New Jersey, January 1990. Also Laboratory for Computer Science Research Technical Report LCSR-TR-142.
J. Chomicki. Polynomial-Time Computable Queries in Temporal Deductive Databases. In ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Nashville, Tennessee, April 1990.
J. Chomicki. History-less Checking of Dynamic Integrity Constraints. In IEEE International Conference on Data Engineering, Phoenix, Arizona, February 1992.
J. Chomicki and T. Imieliński. Temporal Deductive Databases and Infinite Objects. In ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Austin, Texas, March 1988.
J. Chomicki and T. Imieliński. Finite Representation of Infinite Query Answers. ACM Transactions on Database Systems, 18(2):181–223, June 1993.
J. Clifford and T. Isakowitz. On the Semantics of (Bi) Temporal Variable Databases. In International Conference on Extending Database Technology, Cambridge, UK, March 1994.
J. Clifford and A.U. Tansel. On an Algebra for Historical Relational Databases: Two Views. In ACM SIGMOD International Conference on Management of Data, 1985.
J. Clifford and D.S. Warren. Formal Semantics for Time in Databases. ACM Transactions on Database Systems, 8(2):214–254, June 1983.
R. Dechter, I. Meiri, and J. Pearl. Temporal Constraint Networks. Artificial Intelligence, 49:61–95, 1991.
C. E. Dyreson and R.T. Snodgrass. Historical Indeterminacy. In IEEE International Conference on Data Engineering, 1993.
C.E. Dyreson, M.D. Soo, and R.T. Snodgrass. The TSQL2 Data Model for Time. A TSQL2 Commentary, March 1994.
E.A. Emerson. Temporal and Modal Logic. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 16, pages 995–1072. Elsevier/MIT Press, 1990.
H.B. Enderton. A Mathematical Introduction to Logic. Academic Press, 1972.
M. Finger. Handling Database Updates in Two-Dimensional Temporal Logic. Journal of Applied Non-Classical Logic, 1992.
D. Gabbay. The Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems. In B. Banieqbal, B. Barringer, and A. Pnueli, editors, Temporal Logic in Specification, volume 398, pages 409–448. Springer-Verlag, LNCS 398, 1989.
S.K. Gadia. A Homogenous Relational Model and Query Languages for Temporal Databases. ACM Transactions on Database Systems, 13(4)418–448, December 1988.
S.K. Gadia. Temporal Databases: A Prelude to Parametric Data. In A. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, and R. Snodgrass, editors, Temporal Databases: Theory, Design, and Implementation, pages 28–66. Benjamin/Cummings, 1993.
D. Gabbay and P. McBrien. Temporal Logic and Historical Databases. In International Conference on Very Large Data Bases, 1991.
D. Gabbay, A. Pnueli, S. Shelah, and S. Stavi. On the Temporal Analysis of Fairness. In ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, 1980.
G. Grahne. The Problem of Incomplete Information in Relational Databases. Springer-Verlag, LNCS 554, 1991.
J.Y. Halpern and Y. Shoham. A Propositional Modal Logic of Time Intervals. Journal of the ACM, 38(4):935–962, October 1991.
T. Imielinski and W. Lipski. Incomplete Information in Relational Databases. Journal of the ACM, 31(4):761–791, 1984.
C.S. Jensen and L. Mark. Differential Query Processing in Transaction-Time Databases. In A. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, and R. Snodgrass, editors, Temporal Databases: Theory, Design, and Implementation, pages 457–496. Benjamin/Cuminings, 1993.
C.S. Jensen and R.T. Snodgrass. Temporal Specialization. In IEEE International Conference on Data Engineering, pages 594–603, 1992.
C.S. Jensen, M.D. Soo, and R.T. Snodgrass. Unification of Temporal Data Models. In IEEE International Conference on Data Engineering, 1993.
J.A.W. Kamp. Tense Logic and the Theory of Linear Order. PhD thesis, University of California, Los Angeles, 1968.
H. Kamp. Formal properties of’ now'. Theoria, 37:227–273, 1971.
P.C. Kanellakis, G.M. Kuper, and P.Z. Revesz. Constraint Query Languages. In ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 299–313, Nashville, Tennessee, April 1990. To appear in Journal of Computer and System Sciences.
H. Kautz and P. Ladkin. Integrating Metric and Qualitative Temporal Reasoning. In National Conference on Artificial Intelligence, 1991.
M. Koubarakis. The Complexity of Query Evaluation in Indefinite Temporal Constraint Databases. Manuscript.
M. Koubarakis. Representation and Querying in Temporal Databases: the Power of Temporal Constraints. In IEEE International Conference on Data Engineering, 1993.
M. Koubarakis. Foundations of Indefinite Constraint Databases. In Workshop on Principles and Practice of Constraint Programming, Orcas Island, Washington, May 1994.
P.G. Kolaitis and C.H. Papadimitriou. Why not Negation by Fixpoint? Journal of Computer and System Sciences, 43:125–144, 1991.
P.C. Kanellakis, S. Ramaswamy, D.E. Vengroff, and J.S. Vitter. Indexing for Data Models with Constraints and Classes. In ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1993.
F. Kabanza, J-M. Stevenne, and P. Wolper. Handling Infinite Temporal Data. In ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 392–403, Nashville, Tennessee, April 1990.
T.Y. Cliff Leung and R.R. Muntz. Stream Processing: Temporal Query Processing and Optimization. In A. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, and R. Snodgrass, editors, Temporal Databases: Theory, Design, and Implementation, pages 329–355. Benjamin/Cummings, 1993.
U.W. Lipeck and G. Saake. Monitoring Dynamic Integrity Constraints Based on Temporal Logic. Information Systems, 12(3):255–269, 1987.
I. Meiri. Combining Qualitative and Quantitative Constraints in Temporal Reasoning. In National Conference on Artificial Intelligence, 1991.
A. Montanari and B. Pernici. Temporal Reasoning. In A. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, and R. Snodgrass, editors, Temporal Databases: Theory, Design, and Implementation, pages 534–562. Benjamin/Cummings, 1993.
A. Montanari and B. Pernici. Towards a Temporal Logic Reconstruction of Temporal Databases. In Proc. International Workshop on an Infrastructure for Temporal Databases, Arlington, Texas, June 1993.
L.E. Jr. McKenzie and R.T. Snodgrass. Evaluation of Relational Algebras Incorporating the Time Dimension in Databases. ACM Computing Surveys, 23(4):501–543, December 1991.
M.A. Orgun. A Temporal Algebra Based on an Abstract Model. In M.E. Orlowska and M. Papazoglou, editors, Advances in Database Research: Proceedings of the 4th Australian Database Conference, pages 301–316. World Scientific, 1993.
T. C. Przymusinski. On the Declarative Semantics of Deductive Databases and Logic Programs. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 193–216. Morgan Kaufmann, 1988.
P.Z. Revesz. A Closed Form for Datalog Queries with Integer Order. In International Conference on Database Theory, pages 187–201. Springer-Verlag, LNCS 470, 1990. To appear in Theoretical Computer Science.
P.Z. Revesz. A Closed-Form Evaluation for Datalog Queries with Integer (Gap)-Order Constraints. Theoretical Computer Science, 116:117–149, 1993.
R. Snodgrass and I. Ahn. Temporal Databases. IEEE Computer, 19(9), 1986.
A. Segev. Join Processing and Optimization in Temporal Relational Databases. In A. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, and R. Snodgrass, editors, Temporal Databases: Theory, Design, and Implementation, pages 356–387. Benjamin/Cummings, 1993.
R. Snodgrass. The Temporal Query Language TQuel. ACM Transactions on Database Systems, 12(2):247–298, June 1987.
R.T. Snodgrass. Temporal Databases. In A.U. Frank, I. Campari, and U. Formentini, editors, Theories and Methods of Spatio-Temporal Reasoning in Geographic Space, pages 22–64. Springer-Verlag, LNCS 639, 1992.
A.P. Sistla and O. Wolfson. Temporal Triggers in Active Databases. IEEE Transactions on Knowledge and Data Engineering, 1994. To appear.
A. Tuzhilin and J. Clifford. A Temporal Relational Algebra as a Basis for Temporal Relational Completeness. In International Conference on Very Large Data Bases, 1990.
A. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, and R. Snodgrass, editors. Temporal Databases: Theory, Design, and Implementation. Benjamin/Cummings, 1993.
D. Toman, J. Chomicki, and D.S. Rogers. Datalog with Integer Periodicity Constraints. Technical Report TR-CS-94-1, Computing and Information Sciences, Kansas State University, 1994. Submitted for publication.
W. Thomas. A Combinatorial Approach to the Theory of ω-automata. Information and Control, 48(3):261–283, 1981.
J.D. Ullman. Principles of Database and Knowledge-Base Systems, volume 1. Computer Science Press, 1988.
M.Y. Vardi. The Complexity of Relational Query Languages. In ACM SIGACT Symposium on Theory of Computing, pages 137–146, 1982.
M. Y. Vardi. A Temporal Fixpoint Calculus. In ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, 1988.
J.F.A.K. van Benthem. The Logic of Time. D.Reidel, 2nd edition, 1991.
R. van der Meyden. The Complexity of Querying Indefinite Data about Linearly Ordered Domains. In ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1992.
M.H. van Emden and R.A. Kowalski. The Semantics of Predicate Logic as a Programming Language. Journal of the ACM, 23(4):733–742, 1976.
Y. Venema. Expressiveness and Completeness of an Interval Tense Logic. Notre Dame Journal of Formal Logic, 31(4):529–547, 1990.
A. Van Gelder and R.W. Topor. Safety and Translation of Relational Calculus Queries. ACM Transactions on Database Systems, 16(2):235–278, June 1991.
M. Vilain and H. Kautz. Constraint Propagation Algorithms for Temporal Reasoning. In National Conference on Artificial Intelligence, 1986.
X.S. Wang, S. Jajodia, and V.S. Subrahmanian. Temporal Modules: An Approach Toward Federated Temporal Databases. In ACM SIGMOD International Conference on Management of Data, pages 227–236, 1993.
P. Wolper. Temporal Logic Can Be More Expressive. Information and Control, 56:72–99, 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chomicki, J. (1994). Temporal query languages: A survey. In: Gabbay, D.M., Ohlbach, H.J. (eds) Temporal Logic. ICTL 1994. Lecture Notes in Computer Science, vol 827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014006
Download citation
DOI: https://doi.org/10.1007/BFb0014006
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58241-0
Online ISBN: 978-3-540-48585-8
eBook Packages: Springer Book Archive