Abstract
This paper presents an adaptive strategy called K-locking algorithm for concurrency control in database system. The algorithm integrates an optimistic approach with the K-lock mechanism to control the degree of transaction interference. It is shown that the K-locking strategy is adaptive to the changes in transaction parameters and outperforms both an optimistic approach and a pessimistic approach.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
