A Dynamic Overwrite Protocol for Multiversion Concurrency Control Algorithms

  • Tadeusz Morzy


The main difficulty with multiversion database systems is that of storage space, i.e. in a multiversion database we would need to keep a potentially unlimited number of versions of data items. As storage space is always limited, the number data item versions maintained in the database is also limited. This means that some write operations must overwrite old versions of data items in order to create new ones. This paper presents the novel dynamic overwrite protocol which compared to conventional natural overwrite protocol used in practice minimize the number of transactions abortions caused by the limited storage space. The main idea of this new overwrite protocol lies on finding data item versions which can be safely overwritten because no active transaction accesses them in the future.


Data Item Concurrency Control Read Operation Version Node Database Operation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    D. Agrawal, and S. Sengupta. Modular Synchronization in Multiversion Databases: Version Control and Concurrency Control, Proc. of the ACM-SIGMOD Conf. on Management of Data, pp. 74–83, (1989).Google Scholar
  2. [2]
    P. A. Bernstein, and N. Goodman. Multiversion concurrency control: theory and algorithms, ACM Trans. on Database Systems 8, 4, pp. 465–483, (1983).MathSciNetCrossRefGoogle Scholar
  3. [3]
    P. A. Bernstein, N. Goodman, and V. Hadzilacos. Concurrency Control and Recovery in Database Systems, Addison-Wesley Publ. Co. (1987).Google Scholar
  4. [4]
    W. Cellary, E. Gelenbe, and T. Morzy. Concurrency control in distributed database systems, North-Holland Publ. Co., (1988).MATHGoogle Scholar
  5. [5]
    A. Chan, and R. Gray. Implementing distributed read-only transactions, IEEE Trans. on Software Engineering SE-11, 2, pp. 205–212, (1985).CrossRefGoogle Scholar
  6. [6]
    T. Hadzilacos, and C. H. Papadimitriou. Algorithmic aspects of multiversion concurrency control, Journal of Computer and System Sciences 3,3, pp. 297–310, (1986).Google Scholar
  7. [7]
    T. Harder, and E. Petry. Evaluation of a multiple version scheme for concurrency control, Information Systems 12, 1, pp. 83–98, (1987).CrossRefGoogle Scholar
  8. [8]
    Morzy, T., On the use of the timestamp-ordering algorithm for concurrency control in K-version database systems, Proc. Int. Congress on New Technologies for Software and Supercomputers Development, Caracas, (1989).Google Scholar
  9. [9]
    S. Muro, T. Kameda, and T. Minoura. Multi-version con-currency control scheme for a database system, Journal of Computer and System Sciences 29, 2, pp. 207–224, (1984).MathSciNetMATHCrossRefGoogle Scholar
  10. [10]
    Oracle Corporation, Oracle Database Administrator’s Giude,(1983).Google Scholar
  11. [11]
    C. H. Papadimitriou, and P. C. Kanellakis. On concurrency control by multiple versions, ACM Trans. on Database Systems 9, 1, pp. 89–99, (1984).MathSciNetMATHCrossRefGoogle Scholar
  12. [12]
    C. H. Papadimitriou. The theory of database concurrency control, Computer Science Press, (1986).Google Scholar
  13. [13]
    D. P. Reed. Implementing atomic actions on decentralized data, ACM Trans. on Computer Systems 1, 1, pp. 3–23, (1983).CrossRefGoogle Scholar
  14. [14]
    A. Silberschatz. A multi-version concurrency scheme with no rollbacks, Proc. ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing, Ottawa, pp. 216–223, (1982).Google Scholar
  15. [15]
    Son, S.H., and Haghighi, N., Performance evaluation of multiversion database systems, Proc. 6th IEEE Data Engineering Conference, pp. 129–136, (1990).Google Scholar
  16. [16]
    R. Sun, and G. Thomas. Performance results on multiversion timestamp concurrency control with predeclared writesets,Proc. 6th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, San Diego, pp. 177–184Google Scholar

Copyright information

© Springer-Verlag Wien 1991

Authors and Affiliations

  • Tadeusz Morzy
    • 1
  1. 1.Institute of Computing ScienceTechnical University of PoznańPoznańPoland

Personalised recommendations