Skip to main content
SpringerLink
Log in

Databases and Temporal Constraints: Semantics and Complexity

  • Conference paper
Recent Advances in Temporal Databases

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

Abstract

We continue the development of a theory of constraint databases with indefinite information which we originated in our previous research. Initially we review the schemes of ℒ-constraint databases and indefinite ℒ -constraint databases where ℒ, the parameter, is a first-order constraint language. Then we consider several instances of these schemes where ℒ is a language for expressing information about atomic data values and time. We collectively refer to these models as temporal constraint databases and indefinite temporal constraint databases. We give a detailed characterization of the computational complexity of query answering for various classes of temporal constraint databases and queries. Our results results are theoretical but can be summarized as follows for a wider database audience: The worst-case complexity of query evaluation does not change when we move from queries in relational calculus over relational databases, to queries in relational calculus with temporal constraints over temporal constraint databases. This fact remains true even if we consider indefinite relational databases vs. indefinite temporal constraint databases.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abiteboul, P. Kanellakis, and G. Grahne. On the Representation and Querying of Sets of Possible Worlds. Theoretical Computer Science, T8 (1): 159–187, 1991.

    Article  MathSciNet  Google Scholar 

  2. J.F. Allen. Towards a General Model of Action and Time. Artificial Intelligence, 23 (2): 123–154, July 1984.

    Article  MATH  Google Scholar 

  3. V. Brusoni, L. Console, B. Pernici, and P. Terenziani. Extending temporal relational databases to deal with imprecise and qualitative temporal information. In Proceedings of the International Workshop On Temporal Databases, 1995.

    Google Scholar 

  4. A. Chandra and D. Harel. Structure and Complexity of Relational Queries. Journal of Computer and System Sciences, 25: 99–128, 1982.

    Article  MATH  Google Scholar 

  5. Jan Chomicki. Temporal Databases. Unpublished notes from a tutorial presented at the 12th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 1993.

    Google Scholar 

  6. J. Cox and K. McAloon. Decision Procedures for Constraint Based Extensions of Datalog. In F. Benhamou and A. Colmerauer, editors, Constraint Logic Programming: Selected Research. MIT Press, 1993. Originally appeared as Technical Report No. 90-09, Dept. of Computer and Information Sciences, Brooklyn College of C.U.N.Y.

    Google Scholar 

  7. T. Dean. Using Temporal Hierarchies to Efficiently Maintain Large Temporal Databases. Journal of ACM, 36 (4): 687–718, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  8. C. Dyreson and R. Snodgrass. Valid-time Indeterminacy. In Proceedings of the, 9th International Conference on Data Engineering, pages 335–343, 1993.

    Chapter  Google Scholar 

  9. H.-B. Enderton. A Mathematical Introduction to Logic. Academic Press, 1972.

    Google Scholar 

  10. J. Ferrante and C. Rackoff. A Decision Procedure for the First Order Theory of Real Addition with Order. SIAM Journal on Computing, 4 (1): 69–76, 1975.

    Article  MATH  MathSciNet  Google Scholar 

  11. Gosta Grahne. The Problem of Incomplete Information in Relational Databases. Technical Report Report A-1989-1, Department of Computer Science, University of Helsinki, Finland, 1989. Also published as Lecture Notes in Computer Science 554, Springer Verlag, 1991.

    Google Scholar 

  12. S. Grumbach, J. Su, and C. Tollu. Linear constraint databases. In D. Leivant, editor, Proceedings of the Logic and Computational Complexity Workshop, Indianapolis, 1994. Springer Verlag. To appear in LNCS.

    Google Scholar 

  13. T. Imielinski and W. Lipski. Incomplete Information in Relational Databases. Journal of ACM, 31 (4): 761–791, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  14. Jaffar J., A. Brodsky, and M. Maher. Towards Practical Constraint Databases. In Proceedings of 19th International Conference on Very Large Databases (VLDB-93), pages 567–580, 1993.

    Google Scholar 

  15. J. Jaffar, S. Michaylov, P. Stuckey, and R. Yap. The CLP(R) language and system. ACM Transaction on Programming Languages and Systems, 14 (3): 339–395, July 1992.

    Article  Google Scholar 

  16. D.S. Johnson. A Catalog of Complexity Classes. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A, chapter 2. North- Holland, 1990.

    Google Scholar 

  17. F. Kabanza, J.-M. Stevenne, and P. Wolper. Handling Infinite Temporal Data. In Proceedings of ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 392–403, 1990.

    Chapter  Google Scholar 

  18. Paris Kanellakis. Elements of Relational Database Theory. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 17. North-Holland, 1990.

    Google Scholar 

  19. Paris C. Kanellakis, Gabriel M. Kuper, and Peter Z. Revesz. Constraint Query Languages. In Proceedings of the 9th ACM SIGACT-SIGMOD- SIGART Symposium on Principles of Database Systems, pages 299–313, 1990. Long version to appear in Journal of Computer and System Sciences.

    Google Scholar 

  20. P.C. Kanellakis and D. Goldin. Constraint Programming and Database Query Languages. In Proceedings of Theoretical Aspects of Computer Software (TACS), volume 789 of Lecture Notes in Computer Science, pages 96–120. Springer-Verlag, April 1994.

    Google Scholar 

  21. M. Koubarakis. Foundations of Temporal Constraint Databases. PhD thesis, Computer Science Division, Dept. of Electrical and Computer Engineering, National Technical University of Athens, February 1994. Available by anonymous ftp from host passion. doc. ic. ac. uk, file IC- Par c/Papers/ M. Koubarakis/phdthesis. ps. Z.

    Google Scholar 

  22. Manolis Koubarakis. Representation and Querying in Temporal Databases: the Power of Temporal Constraints. In Proceedings of the 9th International Conference on Data Engineering, pages 327–334, April 1993.

    Chapter  Google Scholar 

  23. Manolis Koubarakis. Complexity Results for First-Order Theories of Temporal Constraints. In Principles of Knowledge Representation and Reasoning: Proceedings of the Fourth International Conference (KR’94), pages 379–390. Morgan Kaufmann, San Francisco, CA, May 1994.

    Google Scholar 

  24. Manolis Koubarakis. Database Models for Infinite and Indefinite Temporal Information. Information Systems, 19 (2): 141–173, March 1994.

    Article  Google Scholar 

  25. Manolis Koubarakis. Foundations of Indefinite Constraint Databases. In A. Borning, editor. Proceedings of the 2nd International Workshop on the Principles and Practice of Constraint Programming (PPCP’94volume 874 of Lecture Notes in Computer Science, pages 266–280. Springer Verlag, 1994.

    Google Scholar 

  26. H.J. Levesque. Foundations of a Functional Approach to Knowledge Representation. Artificial Intelligence, 23: 155–212, 1984.

    Article  MATH  Google Scholar 

  27. Witold Jr. Lipski. On Semantic Issues Connected with Incomplete Information Databases. ACM Transcactions on Database Systems, 4 (3): 262–296, September 1979.

    Article  Google Scholar 

  28. M. Maher. A Logic Programming View of CLP. In Proceedings of the 10th International Conference on Logic Programming, pages 737–753, 1993.

    Google Scholar 

  29. J. Paredaens, J. Van den Bussche, and D. Van Gucht. Towards a theory of spatial database queries. In Proceedings of the 13th ACM SIGACT- SIGMOD-SIGART Symposium on Principles of Database Systems, pages 279–288, 1994.

    Google Scholar 

  30. M.O. Rabin. Decidable theories. In Handbook of Mathematical Logic, volume 90 of Studies in Logic and the Foundations of Mathematics, pages 595–629. North-Holland, 1977.

    Google Scholar 

  31. Ray Reiter. On Integrity Constraints. In Proceedings of the 2nd Conference on Theoretical Aspects of Reasoning About Knowledge, pages 97–111, Asilomar, CA, 1988.

    Google Scholar 

  32. Peter Z. Revesz. A Closed Form for Datalog Queries with Integer Order. In Proceedings of the 3rd International Conference on Database Theory, pages 187–201, 1990. Long version to appear in Theoretical Computer Science.

    Google Scholar 

  33. Divesh Srivastava. Subsumption and Indexing in Constraint Query Languages with Linear Arithmetic Constraints. In Proceedings of the 2nd International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, Florida, January 1992.

    Google Scholar 

  34. Divesh Srivastava and Raghu Ramakrishnan. Pushing Constraint Selections. In Proceedings of the 11th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 301–315, 1992.

    Chapter  Google Scholar 

  35. Ron van der Meyden. The Complexity of Querying Indefinite Data About Linearly Ordered Domains (Preliminary Version). In Proceedings of the 11th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 331–345, 1992.

    Chapter  Google Scholar 

  36. Moshe Vardi. The Complexity of Relational Query Languages. In Proceedings of ACM SIGACT/SIGMOD Symposium on Principles of Database Systems, pages 137–146, 1982.

    Google Scholar 

  37. Moshe Vardi. Querying Logical Databases. Journal of Computer and System Sciences, 33: 142–160, 1986.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computation, UMIST, P.O. Box 88, Manchester, M60 1 QD, UK

    Manolis Koubarakis

Authors
  1. Manolis Koubarakis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Leonard N. Stern School of Business, Information Systems Department, New York University, 44 West 4th Street, Suite 9-170, 10012-1126, New York, NY, USA

    James Clifford PhD  & Alexander Tuzhilin PhD  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1995 British Computer Society

About this paper

Cite this paper

Koubarakis, M. (1995). Databases and Temporal Constraints: Semantics and Complexity. In: Clifford, J., Tuzhilin, A. (eds) Recent Advances in Temporal Databases. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3033-8_6

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3033-8_6

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19945-8

  • Online ISBN: 978-1-4471-3033-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation