Encyclopedia of Database Systems

2018 Edition
| Editors: Ling Liu, M. Tamer Özsu

Point-Stamped Temporal Models

  • David Toman
Reference work entry
DOI: https://doi.org/10.1007/978-1-4614-8265-9_269

Synonyms

Point-based temporal models

Definition

Point-stamped temporal data models associate database objects with time instants, indivisible elements drawn from an underlying time domain. Such an association usually indicates that the information represented by the database object in question is valid (i.e., believed to be true by the database) at that particular time instant. The time instant is then called the timestamp of the object.

Historical Background

Associating time-dependent data with time instants has been used in sciences, in particular in physics, at least since Isaac Newton’s development of classical mechanics: time is commonly modeled as a two-way infinite and continuous linear order of indivisible time instants (often with distance defined as well). Similarly, in many areas of computer science, ranging from protocol specifications to program verification to model checking, discrete point-based timestamps play an essential role. In database systems (and in AI), however,...

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

Recommended Reading

  1. 1.
    Abiteboul S, Herr L, Van den Bussche J. Temporal versus first-order logic to query temporal databases. In: Proceedings of the 15th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems; 1996. p. 49–57.Google Scholar
  2. 2.
    Chomicki J. Temporal query languages: a survey. In: Proceedings of the 1st International Conference on Temporal Logic; 1994. p. 506–34.Google Scholar
  3. 3.
    Chomicki J, Toman D. Temporal databases. In: Gabbay D, Villa L, Fischer M, editors. Handbook of temporal reasoning in artificial intelligence. London: Elsevier; 2005. p. 429–67.CrossRefGoogle Scholar
  4. 4.
    Clifford J, Croker A, Tuzhilin A. On the completeness of query languages for grouped and ungrouped historical data models. In: Tansel A, Clifford J, Gadia S, Jajodia S, Segev A, Snodgrass RT, editors. Temporal databases: theory, design, and implementation. Redwood City: Benjamin/Cummings; 1993. p. 496–533.Google Scholar
  5. 5.
    Clifford J, Croker A, Tuzhilin A. On completeness of historical relational query languages. ACM Trans Database Syst. 1994;19(1):64–116.CrossRefGoogle Scholar
  6. 6.
    Jensen CS, Soo MD, Snodgrass RT. Unification of temporal data models. In: Proceedings of the 9th International Conference on Data Engineering; 1993.Google Scholar
  7. 7.
    Toman D. On incompleteness of multi-dimensional first-order temporal logics. In: Proceedings of the 10th International Symposium on Temporal Representation and Reasoning/4th International Conference on Temporal Logic; 2003. p. 99–106.Google Scholar
  8. 8.
    Toman D, Niwinski D. First-order queries over temporal databases inexpressible in temporal logic. In: Advances in Database Technology, Proceedings of the 5th International Conference on Extending Database Technology; 1996.Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.University of WaterlooWaterlooCanada

Section editors and affiliations

  • Richard T. Snodgrass
    • 1
  • Christian S. Jensen
    • 2
  1. 1.University of ArizonaTucsonUSA
  2. 2.Aalborg UniversityAalborg ØstDenmark