Skip to main content

Multi-version Serializability and Concurrency Control

  • Reference work entry
  • 194 Accesses

Synonyms

Multi-version databases; Multi-version concurrency control; Multi-version concurrency control algorithms

Definition

Given a multi-version database, where each data item is a sequence of its versions. The number of versions of a data item may be limited or not. If it is unlimited, then each update of a data item over the limit gives rise to its next version. If it is limited, than each update of a data item replaces its oldest version. In case of limited number of versions, a database is called a K-version database. In multi-version databases any read operation of a data item, subsequent to a write operation of this data item, may access any of its currently existing versions. Thus, a multi-version schedule of a transaction set differs form the ordinary, mono-version schedule by a mapping of the data item read operations into the data item version read operations. Multi-version serializability plays the same role for the multi-version databases, as serializability for the...

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Recommended Reading

  1. Bernstein P.A. and Goodman N. A sophisticate’s introduction to distributed database concurrency control. In Proc. 8th Int. Conf. on Very Data Bases, 1982, pp. 62–76.

    Google Scholar 

  2. Bernstein P.A. and Goodman N. Concurrency Control and Recovery for Replicated Distributed Databases. Tech. Rep. TR-20/83, Harvard University, 1983.

    Google Scholar 

  3. Bernstein P.A. and Goodman N. Multiversion concurrency control – theory and algorithms. ACM Trans. Database Syst., 8(4):465–483, 1983.

    Article  MathSciNet  MATH  Google Scholar 

  4. Bernstein P.A., Hadzilacos V., and Goodman N. Concurrency Control and Recovery in Database Systems.Addison-Wesley, Reading, MA, 1987.

    Google Scholar 

  5. Cellary W., Gelenbe E., and Morzy T. Concurrency Control in Distributed Database Systems, Elsevier Science, North-Holland, 1988.

    MATH  Google Scholar 

  6. Hadzilacos T. and Papadimitriou C.H. Algorithmic aspects of multiversion concurrency control. J. Comput. Syst. Sci., 33(2):297–310, 1986.

    Article  MathSciNet  MATH  Google Scholar 

  7. Lausen G. Formal aspects of optimistic concurrency control in a multiple version database system. Inf. Syst., 8(4):291–301, 1983.

    Article  MATH  Google Scholar 

  8. Muro S., Kameda T., and Minoura T. Multi-version concurrency control scheme for database system. J. Comput. Syst. Sci., 29:207–224, 1984.

    Article  MathSciNet  MATH  Google Scholar 

  9. Papadimitriou C.H. and Kanellakis P.C. On concurrency control by multiple versions. ACM Trans. Database Syst., 9(1):89–99, 1984.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer Science+Business Media, LLC

About this entry

Cite this entry

Cellary, W. (2009). Multi-version Serializability and Concurrency Control. In: LIU, L., ÖZSU, M.T. (eds) Encyclopedia of Database Systems. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-39940-9_228

Download citation

Publish with us

Policies and ethics