Multiversion Concurrency Control With The Precedence Graph Generation Algorithm
Prateek Vikram1, Salman Abdul Moiz2, G R Anil3
1Prateek Vikram, School of Computer and Information Sciences, University of Hyderabad, Hyderabad, Telangana, India.
2Salman Abdul Moiz, School of Computer and Information Sciences, University of Hyderabad, Hyderabad, Telangana, India.
3G R Anil, School of Computer and Information Sciences, University of Hyderabad, Hyderabad, Telangana, India.
Manuscript received on 09 August 2019 | Revised Manuscript received on 16 August 2019 | Manuscript Published on 31 August 2019 | PP: 95-100 | Volume-8 Issue-9S2 August 2019 | Retrieval Number: I10190789S219/19©BEIESP DOI: 10.35940/ijitee.I1019.0789S219
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open-access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Simultaneous access of a shared record by multiple transactions leads to conflicts while writing. Such scenario generates the problems like lost update, dirty read, nonrepeatable read etc . In such a case, transaction need to be rolled back to get the system into a consistent state. To handle these conflicts Multiversion Concurrency control (MVCC) is used. MVCC has the ability to avoid the read-write conflicts by performing the read operations using the older version when the write request is in progress. When the multiple write operation concurrently executes then the transaction is aborted or rolled back. To address the problem of rollbacks, a methodology using the Precedence Graph generation based algorithm to reschedule the sequence of the transaction is proposed. In the proposed methodology whenever there is a system failure or network failure the transaction need not be started again, rather it is partially rolled back. The proposed methodology is executed and compared with the other MVCC approached on same set of transactions defined on shared and non shared data items. It is observed that the proposed methodology achieves better execution time as compared to the methods available in the literature.
Keywords: Concurrency Control, Database, Multiversion Timestamp Protocol, Precedence Graph Generation, Partial Rollback
Scope of the Article: Next Generation Internet & Web Architectures