Deferred Lock Enforcement | SpringerLink
Skip to main content

Deferred Lock Enforcement

Weak exclusive locks for more concurrency and more throughput

  • Chapter
On Transactional Concurrency Control

Part of the book series: Synthesis Lectures on Data Management ((SLDM))

  • 120 Accesses

Abstract

Within a database transaction, the longest phases execute the application logic and harden the commit log record on stable storage. Two existing techniques, early lock release and controlled lock violation, eliminate or weaken conflicts during the hardening phase. Two new techniques, deferred lock acquisition and deferred lock enforcement, do the same during execution of the application logic. Together, deferred lock enforcement and controlled lock violation minimize the duration of strict exclusive locks, maximize concurrency and throughput, yet ensure full serializability. The new techniques complement snapshot isolation and multi-version storage.

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

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 7435
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 9294
Price includes VAT (Japan)
  • Compact, lightweight 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.

Similar content being viewed by others

References

  • Chan, A., Fox, S., Lin, W.-T. K., Nori, A., and Ries, D. R. (1982). The implementation of an integrated concurrency control and recovery scheme. ACM SIGMOD, pages 184-191. 10.1145/582383.582386. 329

    Google Scholar 

  • Diaconu, C., Freedman, C., Ismert, E., Larson, P., Mittal, P., Stonecipher, R., Verma, N., and Zwilling, M. (2013). Hekaton: SQL server’s memory-optimized OLTP engine. ACM SIGMOD, pages 1243-1254. 10.1145/2463676.2463710. 335

    Google Scholar 

  • Graefe, G. (2003). Sorting and indexing with partitioned B-trees. CIDR. 340

    Google Scholar 

  • Graefe, G., Lillibridge, M., Kuno, H. A., Tucek, J., and Veitch, A. C. (2013). Controlled lock violation. ACM SIGMOD, pages 85-96 (Chapter 4). 10.1145/2463676.2465325. 335, 336, 355, 359

    Google Scholar 

  • Graefe, G., Guy, W., and Sauer, C. (2016). Instant Recovery with Write-Ahead Logging: Page Repair, System Restart, Media Restore, and System Failover, 2nd ed., Synthesis Lectures on Data Management, pages 1-113, Morgan & Claypool Publishers. 10.2200/s00710ed2v01y201603dtm044. 354

    Google Scholar 

  • Graefe, G. and Kimura, H. (2015). Orthogonal key-value locking. BTW, pages 237-256 (Chapter 5). 333

    Google Scholar 

  • Graefe, G. and Zwilling, M. J. (2004). Transaction support for indexed views. ACM SIG-MOD, pages 323-334 (Chapter 3). Extended in G. Graefe: Concurrent queries and updates in summary views and their indexes. Hewlett Packard Technical Report HPL-2011-16. 10.1145/1007568.1007606. 351, 352

    Google Scholar 

  • Gray, J., Lorie, R. A., Putzolu, G. R., and Traiger, I. L. (1976). Granularity of locks and degrees of consistency in a shared data base. IFIP Working Conference on Modelling in Data Base Management Systems, pages 365-394. 328, 332, 348

    Google Scholar 

  • Gray, J. and Reuter, A. (1993). Transaction Processing Concepts and Techniques, Morgan Kaufmann. 331

    Google Scholar 

  • Härder, T. (1984). Observations on optimistic concurrency control schemes. Information Systems, 9(2), pages 111-120. 10.1016/0306-4379(84)90020-6. 330

    Article  Google Scholar 

  • Korth, H. F. (1983). Locking primitives in a database system. Journal of the ACM, 30(1), pages 55-79. 10.1145/322358.322363. 331, 332

    Article  MathSciNet  MATH  Google Scholar 

  • Kung, H. T. and Robinson, J. T. (1981). On optimistic methods for concurrency control. ACM TODS, 6(2), pages 221-226. 10.1145/319566.319567. 330, 338, 355.

    Article  Google Scholar 

  • Lomet, D. B. (1993). Key range locking strategies for improved concurrency. VLDB, pages 655664. 338

    Google Scholar 

  • Mohan, C. (1990). ARIES/KVL: A key-value locking method for concurrency control of mul-tiaction transactions operating on B-tree indexes. VLDB, pages 392-405. 333, 338

    Google Scholar 

  • Mohan, C. and Levine, F. E. (1992). ARIES/IM: An efficient and high concurrency index management method using write-ahead logging. ACM SIGMOD, pages 371-380. 10.1145/130283.130338. 338, 343

    Google Scholar 

  • O’Neil, P. E., Cheng, E., Gawlick, D., and O’Neil, E. J. (1996). The log-structured merge-tree (LSM-tree). Acta Information, 33(4), pages 351-385. 10.1007/s002360050048. 340

    Article  Google Scholar 

  • SQ Lite. (2004). File locking and concurrency in SQLite version 3. http://sqlite.org/lockingv3.html 331

  • Thomasian, A. (1998). Performance analysis of locking methods with limited wait depth. Performance Evaluation, 34(2), pages 69-89. 10.1016/s0166-5316(98)00025-x. 339, 357

    Article  Google Scholar 

Download references

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Cite this chapter

Graefe, G. (2019). Deferred Lock Enforcement. In: On Transactional Concurrency Control. Synthesis Lectures on Data Management. Springer, Cham. https://doi.org/10.1007/978-3-031-01873-2_12

Download citation

Publish with us

Policies and ethics