Point-Stamped Temporal Models

  • Living reference work entry
  • First Online:
Encyclopedia of Database Systems
  • 43 Accesses

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 via an institution to check access.

Access this chapter

Institutional subscriptions

Recommended Reading

  1. Abiteboul S, Herr L, Van den Bussche J. Temporal versus first-order logic to query temporal databases. In: Proceedings of 15th ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems. 1996. pp. 49–57.

    Google Scholar 

  2. Chomicki J. Temporal query languages: a survey. In: Proceedings of 1st international conference on temporal logic. 1994. pp. 506–34.

    Google Scholar 

  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.

    Chapter  Google Scholar 

  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. Clifford J, Croker A, Tuzhilin A. On completeness of historical relational query languages. ACM Trans Database Syst. 1994;19(1):64–116.

    Article  Google Scholar 

  6. Jensen CS, Soo MD, Snodgrass RT. Unification of temporal data models. In: Proceedings of 9th international conference on data engineering. 1993.

    Google Scholar 

  7. Toman D. On incompleteness of multi-dimensional first-order temporal logics. In: International symposium on temporal representation and reasoning and international conference on temporal logic. 2003. pp. 99–106.

    Google Scholar 

  8. Toman D, Niwinski D. First-order queries over temporal databases inexpressible in temporal logic. In: Advances in database technology, Proceedings of 5th international conference on extending database technology. 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to David Toman .

Editor information

Editors and Affiliations

Section Editor information

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Toman, D. (2016). Point-Stamped Temporal Models. In: Liu, L., Özsu, M. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4899-7993-3_269-2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4899-7993-3_269-2

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, New York, NY

  • Online ISBN: 978-1-4899-7993-3

  • eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering

Publish with us

Policies and ethics

Navigation