Skip to main content

Performance Evaluation on Several Cautious Schedulers for Database Concurrency Control

  • Chapter
Database Machines and Knowledge Base Machines

Part of the book series: The Kluwer International Series in Engineering and Computer Science ((SECS,volume 43))

Abstract

In recent studies on concurrency control of database systems, “cautious schedulers” have been developed intensively because they avoid both abortion and rollback in the process of concurrency control. In this paper, by means of simulation studies, we will evaluate the performance of three cautious schedulers: (1) cautious two-phase locking scheduling, (2) exclusive preclaimed two-phase locking scheduling, and (3) cautious conflict serializable scheduling. The performance of these cautious schedulers is compared with that of corresponding non-cautious schedulers.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bernstein, P.A. and Goodman, N., ACM Comput. Surv. Vol.13, No.2, pp.185–222, June 1981.

    Article  MathSciNet  Google Scholar 

  2. Bernstein, P.A., Hadzilacos, V., and Goodman, N., “Concurrency Control and Recovery in Database Systems”, Addison-Wesley, Reading, Mass., 1987.

    Google Scholar 

  3. Brzozowski, J.A. and Muro, S., Inter. J. Comput. Inf. Sci. Vol.14, No.6 pp.387–403, Dec. 1985.

    Article  MATH  Google Scholar 

  4. Buckley, G.N. and Silberschatz, A., Proc. 9th Int. Conf. on VLDB, VLDB Endowment, pp.74–80, Florence, Oct.-Nov. 1983.

    Google Scholar 

  5. Carey, M.J., “Modeling and Evaluation of Database Concurrency Control Algorithms”, Ph.D. dissertation, Computer Science Div. (EECS), University of California, Berkeley, Aug. 1983.

    Google Scholar 

  6. Carey, M.J. and Muhanna, W.A., ACM Trans. Computer Syst. Vol.4, No.4, pp.338–378, Nov. 1986.

    Article  Google Scholar 

  7. Casanova, M.A. and Bernstein, P.A., ACTA Informatica, Vol.14, pp.195–220, 1980.

    Article  MathSciNet  MATH  Google Scholar 

  8. Casanova, M.A., “The Concurrency Control Problem for Database Systems”, Lecture Notes in Computer Science Vol. 116, Springer-Verlag, Heidelberg, 1981.

    MATH  Google Scholar 

  9. Eswaran, K.P., Gray, J.N., Lorie, P.A., and Traiger, I.L., Comm. ACM, Vol.19, No.11, pp.624–633, Nov. 1976.

    Article  MathSciNet  MATH  Google Scholar 

  10. Gray, J.N., In: Operating Systems: An Advanced Course (Eds. Bayer, R, Graham, R.M., and Seegmüller, G.), Lecture Notes in Computer Science Vol.60, Springer-Verlag, Heidelberg, pp.393–481, 1978.

    Google Scholar 

  11. Ibaraki, T., Kameda, T., and Minoura, T., Proc. 9th Int. Conf. on VLDB, VLDB Endowment, pp.89–91, Florence, Oct.-Nov. 1983.

    Google Scholar 

  12. Ibaraki, T., Kameda, T., and Katoh, N., “Cautious Schedulers for Database Concurrency Control”, TR 85–2, Dept. of Comput. Sci., Simon Fraser University, 1985.

    Google Scholar 

  13. Katoh, N., Ibaraki, T., and Kameda, T., ACM Trans. Database Syst., Vol.10, No.2, pp.205–229, June 1985.

    Article  MATH  Google Scholar 

  14. Katoh, N., Ibaraki, T., and Kameda, T., Proc. Int. Seminar on Operations Research and Systems, pp.193–224, Kyoto, Nov. 1985.

    Google Scholar 

  15. Lin, W.K. and Nolte, J., Proc. 9th Int. Conf. on VLDB, VLDB Endowment, pp.109–119, Florence, Oct.-Nov. 1983.

    Google Scholar 

  16. Muro, S., Kameda, T., and Minoura, T., J. Comput. Syst. Sci., Vol.29, No.2, pp.207–224, 1984.

    Article  MathSciNet  MATH  Google Scholar 

  17. Papadimitriou, C.H., J.ACM, Vol.26, No.4, pp.631–653, Oct. 1979.

    Article  MathSciNet  MATH  Google Scholar 

  18. Papadimitriou, C.H. and Kanellakis, P.C., ACM Trans. Database Syst., Vol.9, No.1, pp.89–91, Mar. 1984.

    Article  MathSciNet  MATH  Google Scholar 

  19. Papadimitriou, C.H., “The Theory of Database Concurrency Control”, Computer Science Press, Rockville, Maryland, 1986.

    MATH  Google Scholar 

  20. Watanabe, M., “Simulation Studies on Performance of Several Database Concurrency Control”, Master Thesis, Dept. of Applied Mathematics and Physics, Kyoto University, Feb. 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Kluwer Academic Publishers, Boston

About this chapter

Cite this chapter

Nishio, S., Watanabe, M., Ohiwa, Y., Hasegawa, T. (1988). Performance Evaluation on Several Cautious Schedulers for Database Concurrency Control. In: Kitsuregawa, M., Tanaka, H. (eds) Database Machines and Knowledge Base Machines. The Kluwer International Series in Engineering and Computer Science, vol 43. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1679-4_12

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-1679-4_12

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4612-8948-7

  • Online ISBN: 978-1-4613-1679-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics