Skip to main content
SpringerLink
Log in

A conservative multiversion locking-graph scheduler algorithm

  • Regular Papers
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

In order to improve the concurrency of multiversion database systems, a conservative MV locking-graph scheduler algorithm is proposed, which takes the power of MVS as a target. The algorithm combines the advantages of locking and graph, and does optimizing processes on read-only and write-only operations to reduce the blocks of transctions. The correctness and complexity of the algorithm are also provided.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Chen Fang and Shi Baile, Multiversion Scheduler Analysis.Chinese Journal of Computers 13: 10 (1990).

  2. P. A. Bernstein and N. Goodman, Multiversion concurrency control —theory and algorithms.ACM TODS,8: 4 (1983), 465–483.

    Article  MATH  MathSciNet  Google Scholar 

  3. P. A. Bernstein, V. Hadzilacos and N. Goodman, Concurrency Control and Recovery in Database Systems. Addison-Wesley, Reading, Massachusetts, 1986.

    Google Scholar 

  4. G. Buckley and A. Silberschatz, Obtaining Progressive Protocols for a Simple Multiversion Database Model, 9th VLDB, Florence Italy, 74–80, 1983.

  5. T. Hadzilacos and C. H. Papadimitriou, Algorithmic Aspects of Multiversion on Concurrency Control. Proc. of 4th ACM SIGACT-SIGMOD Symp. on PODS, Portland, Oregon, 96–104, 1985.

  6. G. Lausen, Formal aspects of optimistic cuncurrency control in a multiple version database system.Inform. Systems,8: 4 (1983), 291–301.

    Article  MATH  Google Scholar 

  7. S. Muro, T. Kameda and T. Minoura, Multi-version concurrency control scheme for a database system.J. of Computer and System Sciences,29 (1984), 207–224.

    Article  MATH  MathSciNet  Google Scholar 

  8. C. H. Papadimitriou, The Theory of Concurrency Control. Computer Science Press., Rockville, MD, 1986.

    MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  10. R. H. Thomas, A majority consensus approach to concurrency control for multiple copy systems.ACM TODS,4: 2 (1979), 180–209.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Fudan University, 200433, Shanghai

    Chen Fang & Shi Baile

Authors
  1. Chen Fang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shi Baile
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, F., Shi, B. A conservative multiversion locking-graph scheduler algorithm. J. of Comput. Sci. & Technol. 6, 161–166 (1991). https://doi.org/10.1007/BF02945367

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02945367

Keywords

Search

Navigation