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.
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.
