Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Database Systems pp 3857–3862Cite as

Supporting Transaction Time Databases

  • Reference work entry
  • First Online:

  • 11 Accesses

Synonyms

Multi-version database; Temporal database

Definition

The temporal concepts glossary maintained at http://www.cs.aau.dk/~csj/Glossary/ defines transaction time as: “The transaction time of a database fact is the time when the fact is current in the database and may be retrieved.” A transaction time database thus stores versions of database records or tuples, each of which has a start time and an end time, delimiting the time range during which they represent the current versions of database facts. As each version is the result of transactions, the times associated with the version are the times for the transaction starting the version (the start time) and for the transaction ending the version (the end time). These transaction times are required to agree with the serialization order of the transaction, so that the database can present a transaction consistent view of the facts being stored.

Historical Background

Postgres was the first database system that supported transaction...

This is a preview of subscription content, 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   4,499.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   6,499.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

Recommended Reading

  1. Stonebraker M. The design of the POSTGRES storage system. In: Proceedings of the 13th International Conference on Very Large Data Bases; 1987.p. 289–300.

    Google Scholar 

  2. Guttman A. R-trees: a dynamic index structure for spatial searching. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1984, p. 47–57.

    Google Scholar 

  3. Lomet DB, Salzberg B. Access methods for multiversion data. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1989. p. 315–24.

    Google Scholar 

  4. Easton M. Key-sequence data sets on inedible storage. IBM J Res Dev. 1986;30(3):230–41.

    Article  Google Scholar 

  5. Hobbs L, England K. Rdb: a comprehensive guide. Newton: Digital Press; 1995.

    Google Scholar 

  6. Oracle. Oracle Flashback Technology (2005)http://www.oracle.com/technology/deploy/availability/htdocs/lashback_Overview.htm

  7. Tansel U, Clifford J, Gadia SK, Segev A, Snodgrass RT. Temporal databases: theory, design, and implementation. Benjamin/Cummings; 1993.

    Google Scholar 

  8. Torp K, Snodgrass RT, Jensen CS. Effective timestamping in databases. VLDB J. 2000;8(4):267–88.

    Article  Google Scholar 

  9. Clifford J, Dyreson C, Isakowitz T, Jensen CS, Snodgrass RT. On the semantics of “now” in databases. ACM Trans Database Syst. 1997;22(2):171–214.

    Article  Google Scholar 

  10. Lomet DB, Barga R, Mokbel M, Shegalov G, Wang R, Zhu Y. Transaction time support inside a database engine. In: Proceedings of the 22nd International Conference on Data Engineering; 2006. p. 35.

    Google Scholar 

  11. Salzberg B, Tsotras VJ. A comparison of access methods for time-evolving data. ACM Comput Surv. 1999;31(2):158–221.

    Article  Google Scholar 

  12. Becker B, Gschwind S, Ohler T, Seeger B, Widmayer P. An asymptotically optimal multiversion B-tree. VLDB J. 1996;5(4):264–75.

    Article  Google Scholar 

  13. Lomet DB, Snodgrass RT, Jensen CS. Using the lock manager to choose timestamps. In: Proceedings of the International Conference on Database Engineering and Applications; 2005. p. 357–68.

    Google Scholar 

  14. Lomet DB, Salzberg B. Exploiting a history database for backup. In: Proceedings of the 19th International Conference on Very Large Data Bases; 1993.p. 380–90.

    Google Scholar 

  15. Lomet DB, Vagena Z, Barga R. Recovery from “bad” user transactions. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2006. p. 337–46.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Microsoft Research, Redmond, WA, USA

    David Lomet

Authors
  1. David Lomet
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to David Lomet .

Editor information

Editors and Affiliations

  1. Georgia Institute of Technology College of Computing, Atlanta, GA, USA

    Ling Liu

  2. University of Waterloo School of Computer Science, Waterloo, ON, Canada

    M. Tamer Özsu

Section Editor information

  1. University of Arizona, Tucson, AZ, USA

    Richard T. Snodgrass

  2. Aalborg University, Aalborg Øst, Denmark

    Christian S. Jensen

Rights and permissions

Reprints and permissions

Copyright information

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

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Lomet, D. (2018). Supporting Transaction Time Databases. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_381

Download citation

Publish with us

Policies and ethics

Search

Navigation