Skip to main content

Evaluating the Completeness of TSQL2

  • Conference paper
Recent Advances in Temporal Databases

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

Abstract

The question of what is a well-designed temporal data model and query language is a difficult, but also an important one. The consensus temporal query language TSQL2 attempts to take advantage of the accumulated knowledge gained from designing and studying many of the earlier models and languages. In this sense, TSQL2 represents a constructive answer to this question. Others have provided analytical answers by developing criteria, formulated as completeness properties, for what is a good model and language.

This paper applies important existing completeness notions to TSQL2 in order to evaluate the design of TSQL2. It is shown that TSQL2 satisfies only a subset of these completeness notions.

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

Access this chapter

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. P. Atzeni and P. P. Chen. Completeness of Query Languages for the Entity- Relationship Model. In Proceedings of the Second International Conference on Entity-Relationship Approach, P. P. Chen, editor, pages 111–123, October 1981.

    Google Scholar 

  2. J. F. Allen. Maintaining Knowledge about Temporal Intervals. Communications of the ACM, 16 (11): 832–843, 1983.

    Article  Google Scholar 

  3. A. V. Aho and J. D. Ullman. Universality of data retrieval languages. In Proceedings of the 6th A CM Symposium on Principles of Programming Languages, pages 110–117, January 1979.

    Google Scholar 

  4. F. Bancilhon. On the Completeness of Query Languages for Relational Databases. In Proceedings of the 7th Symposium on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science, Springer Verlag, September 1978.

    Google Scholar 

  5. M. Böhlen and R. Marti. On the Completeness of Temporal Database Query Languages. Proceedings of the First International Conference on Temporal Logic, pages 283–300, July 1994.

    Google Scholar 

  6. M. Böhlen. The Temporal Deductive Database System ChronoLog. Ph.D. thesis, Departement Informatik, ETH Zurich, 1994.

    Google Scholar 

  7. 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.

    Article  Google Scholar 

  8. A. K. Chandra and D. Harel. Computable Queries for Relational Data Bases. Journal of Computer and System Sciences, 21 (2): 156–178, October 1980.

    Article  MATH  MathSciNet  Google Scholar 

  9. J. Chomicki. Temporal Query Languages: a Survey. Proceedings of the First International Conference on Temporal Logic, pages 506–534, July 1994.

    Google Scholar 

  10. E. F. Codd. A Relational Model of Data for Large Shared Data Banks. Communications of the ACM, 13 (6): 377–387r June 1970.

    Article  MATH  Google Scholar 

  11. E. F. Codd. Relational Completeness of Data Base Sublanguages. Courant Computer Symposia Series, 6: 65–98, 1972.

    Google Scholar 

  12. C. J. Date. Relational Database Writings 1991–1994. Addison-Wesley Publishing Company, 1995.

    Google Scholar 

  13. S. K. Gadia. A Homogeneous Relational Model and Query Languages for Temporal Databases. ACM Transactions on Database Systems, 13 (4): 418–448, December 1988.

    Article  MATH  MathSciNet  Google Scholar 

  14. S. K. Gadia and G. Bhargava. SQL-like Seamless Query of Temporal Data. In E. T. Snodgrass, editor, Proceedings of the International Workshop on an Infrastructure for Temporal Databases, Arlington, Texas, June 1993.

    Google Scholar 

  15. C. S. Jensen, J. Clifford, E. Elmasri, S. K. Gadia, P. Hayes, and S. Jajodia (eds.). A Glossary of Temporal Database Concepts. SIGMOD RECORD, 23(1):52–64, March 1994.

    Google Scholar 

  16. C. S. Jensen (ed.). A Consensus Test Suite of Temporal Database Queries. Technical Eeport E 93-2034, Department of Mathematics and Computer, Institute for Electronic Systems, Fredrik Bajers Vej 7, DK 9220 Aalborg, Denmark, November 1993.

    Google Scholar 

  17. G. Jaeschke and H.-J. Schek. Eemarks on the Algebra of Non First Normal Form Eelations. In Proceedings of the ACM Symposium on Principles of Database Systems, pages 124–138, March 1982.

    Chapter  Google Scholar 

  18. C. S. Jensen, M. D. Soo, and E. T. Snodgrass. Extending Normal Forms to Temporal Eelations. Technical Eeport TE 92–17, University of Arizona, July 1992.

    Google Scholar 

  19. C. S. Jensen, M. D. Soo, and E. T. Snodgrass. Unifying Temporal Models via a Conceptual Model. Information Systems, 19 (7): 513–547, 1994.

    Article  Google Scholar 

  20. C. S. Jensen, E. T. Snodgrass, and M. D. Soo. The TSQL2 Data Model. Chapter 10, The TSQL2 Temporal Query Language, E. T. Snodgrass (ed.), Kluwer Academic Pub., 1995, pp. 157–240.

    Book  Google Scholar 

  21. L. E. McKenzie and E. T. Snodgrass. Evaluation of Relational Algebras Incorporating the Time Dimension in Databases. ACM Computing Surveys, 23 (4): 501–543, 1991.

    Article  Google Scholar 

  22. J. Melton and A. E. Simon. Understanding the New SQL: A Complete Guide. Morgan Kaufmann Publishers, 1993.

    Google Scholar 

  23. P. O’Neil. Database: Principles, Programming and Performance. Morgan Kaufmann, San Francisco, 1994.

    MATH  Google Scholar 

  24. G. Ozsoyoglu and E. T. Snodgrass. Temporal and Real-Time Databases: A Survey. IEEE Transactions on Knowledge and Data Engineering, 7 (4), August 1995.

    Google Scholar 

  25. E. T. Snodgrass (ed.), I. Ahn, G. Ariav, D. Batory, J. Clifford, C. E. Dyreson, E. Elmasri, F. Grandi, C. S. Jensen, W. Käfer, N. Kline, K. Kulkarni, T. Y. C. Leung, N. Lorentzos, J. F. Eoddick, A. Segev, M. D. Soo, and S. M. Sripada. The TSQL2 Temporal Query Language. Kluwer Academic Pub., 1995, 674+xxiv pages.

    Google Scholar 

  26. R. T. Snodgrass, I. Ahn, G. Ariav, P. Bayer, J. Clifford, C. Dyreson, F. Grandi, L. Hermosilla, C. S. Jensen, W. Käfer, N. Kline, T. Y. C. Leung, N. Lorentzos, Y. Mitsopoulos, J. F. Roddick, M. D. Soo, and S. M. Sripada. An Evaluation of TSQL2. TSQL2 Commentary, September 1994.

    Google Scholar 

  27. B. Schueler. Update reconsidered. In G. M. Nijssen (ed.), Architecture and Models in Data Base Management Systems. North Holland Publishing Co., 1977.

    Google Scholar 

  28. R. T. Snodgrass. The Temporal Query Language TQuel. ACM Transactions on Database Systems, 12 (2): 247–298, 1987.

    Article  Google Scholar 

  29. S. M. Sripada. Temporal Reasoning in Deductive Databases. Ph.D. thesis, Imperial College of Science and Technology, University of London, 1991.

    Google Scholar 

  30. A. Tuzhilin and J. Clifford. A Temporal Relational Algebra as a Basis for Temporal Relational Completeness. In Proceedings of the International Conference on Very Large Databases, D. McLeod, R. Sacks-Davis, and H.- J. Schek, editors, pages 13–23, August 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1995 British Computer Society

About this paper

Cite this paper

Böhlen, M.H., Jensen, C.S., Snodgrass, R.T. (1995). Evaluating the Completeness of TSQL2. 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_9

Download citation

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

  • 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