Skip to main content

A point-based temporal extension of SQL

  • Extending DBMS Features
  • Conference paper
  • First Online:
Deductive and Object-Oriented Databases (DOOD 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1341))

Included in the following conference series:

Abstract

We propose a new approach to temporal extensions of SQL. Unlike the current proposals, e.g., SQL/Temporal, we use point-based references to time as the basis of our approach. The proposed language—SQL/TP—extends the syntax and semantics of SQL/92 in a very natural way: by adding a single data type to represent a linearly ordered universe of individual time instants. Such an extension allows the users to write temporal queries in customary fashion and vastly simplifies the semantics of the proposed language: we merely use the familiar SQL semantics. In this way SQL/TP also fixes many problems present in the semantics of the temporal query languages based on explicit interval-valued temporal attributes. In addition, we propose an efficient query evaluation procedure over a compact interval-based encoding of temporal relations. The algorithm is based on a sophisticated compilation technique that translates SQL/TP queries to SQL/92. In this way existing database systems can be used for managing temporal data. We substantiate this claim by proposing an experimental version of a SQL/TP compiler to serve as a front-end for DB21 [13].

This research was supported by a NATO/NSERC PDF fellowship, 1996-98.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abiteboul, S., Herr, L., Van den Bussche, J. Temporal versus First-Order Logic to Query Temporal Databases. Proc. ACM PODS 1996, 49–57, 1996.

    Google Scholar 

  2. Allen, J. F. Maintaining knowledge about temporal intervals. Communications of the ACM, 26(11):832–843, 1983.

    Article  Google Scholar 

  3. Bohlen, M. H., Chomicki, J., Snodgrass, R. T., Toman, D. Querying TSQL2 Databases with Temporal Logic. In Proc. EDBT'96, LNCS 1057, 325–341, 1996.

    Google Scholar 

  4. Böhlen, M. H., Jensen, C. S. Seamless Integration of Time into SQL. University of Aalborg, http://www.cs.auc.dk/boehlen/Software/Tiger/atsgl.ps.gz, 1996.

    Google Scholar 

  5. Böhlen, M. H., Jensen, C. S., Snodgrass, R. T. Evaluating and Enhancing the Completeness of TSQL2. Technical Report TR 95-5, Computer Science Department, University of Arizona, June 1995.

    Google Scholar 

  6. Böhlen, M. H., Snodgrass, R. T., Soo, M. D. Coalescing in Temporal Databases. Proc. 22nd Int. Conf. on Very Large Databases, 180–191, 1996.

    Google Scholar 

  7. Clifford J., Croker A., Tuzhilin A. On Completeness of Historical Relational Query Languages. ACM Transactions on Database Systems, Vol. 19, No. 1, 64–116, 1994.

    Article  Google Scholar 

  8. Codd, E. F. Relational completeness of database sublanguages. In Rustin, R.(ed.) Courant Computer Science Symposium 6: Data Base Systems, 65–98, Prentice-Hall, 1972.

    Google Scholar 

  9. Chomicki J. Temporal Query Languages: a Survey. Proc. International Conference on Temporal Logic, July 1994, Bonn, Germany, Springer-Verlag (LNAI 827), 506–534.

    Google Scholar 

  10. Chomicki, J., Kuper, G. M. Measuring Infinite Relations. Proc. ACM PODS 1995, 78–85, 1995.

    Google Scholar 

  11. Chomicki, J., Goldin, D. Q., Kuper, G. M. Variable Independence and Aggregation Closure. Proc. ACM PODS 1996, 40–48, 1996.

    Google Scholar 

  12. Date, C. J., Drawen, H. A Guide to the SQL Standard (3rd ed.), Addison-Welsley, 1993.

    Google Scholar 

  13. IBM Database 2, SQL Reference for common servers. IBM Corp., 1995.

    Google Scholar 

  14. Jensen, C. S., Snodgrass, R. T., Soo, M. J. Unification of Temporal Data Models. Proc. 9th Int. Conf. on Data Engineering, 262–271, 1993.

    Google Scholar 

  15. Kanellakis, P. C., Kuper, G. M., Revesz, P.Z. Constraint Query Languages. Journal of Computer and System Sciences 51(1):26–52, 1995.

    Article  Google Scholar 

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

    Article  Google Scholar 

  17. Snodgrass R.T. (editor). The TSQL2 Temporal Query Language. Kluwer Academic Publishers, 674+xxiv pages, 1995.

    Google Scholar 

  18. Snodgrass, R. T., Böhlen, M. H., Jensen C. S., Steiner, A. Adding Valid Time to SQL/Temporal, ISO/IEC JTC1/SC21/WG3 DBL MAD-146r2 21/11/96, (change proposal).

    Google Scholar 

  19. Toman, D. Point-based vs. Interval-based Temporal Query Languages Proc. ACM PODS 1996, 58–67, 1996.

    Google Scholar 

  20. Toman, D., Niwinski, D. First-Order Temporal Queries Inexpressible in Temporal Logic Proc. EDBT'96, Arpes, Bouzeghoub (eds.), LNCS 1057, 307–324, 1996.

    Google Scholar 

  21. Williams, H. P. Fourier-Motzkin Elimination Extension to Integer Programming Problems. In Journal of Combinatorial Theory (A) 21, 118–123, 1976.

    Article  Google Scholar 

  22. Kabanza, F., Stevenne, J.-M., Wolper, P. Handling Infinite Temporal Data. JOSS 51(1): 3–17, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

François Bry Raghu Ramakrishnan Kotagiri Ramamohanarao

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Toman, D. (1997). A point-based temporal extension of SQL. In: Bry, F., Ramakrishnan, R., Ramamohanarao, K. (eds) Deductive and Object-Oriented Databases. DOOD 1997. Lecture Notes in Computer Science, vol 1341. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63792-3_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-63792-3_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63792-9

  • Online ISBN: 978-3-540-69647-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics