Optimistic Concurrency Control and Time-stamp Ordering


2. Optimistic Concurrency Control. The problems of 2PLThe overheads for locking and maintaining the lock tableDeadlock and distributed deadlock problemsLong lock holding time implies long blocking time (chain of blocking)Thrashing problem due to high data contention (Strict 2PL)Optimistic Concu

Presentation posted in : General

Download Presentation

Optimistic Concurrency Control and Time-stamp Ordering

An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other sites. SlideServe reserves the right to change this policy at anytime.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.











- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -




Presentation Transcript