Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/9244
Title: AN OPTIMISTIC APPROACH TO CONCURRENCY CONTROL IN DISTRIBUTED DATABASES
Authors: Gupta, Satyanarain
Keywords: ELECTRONICS AND COMPUTER ENGINEERING;CONCURRENCY CONTROL;DISTRIBUTED DATABASES;CRASH RECOVERY SCHEME
Issue Date: 1994
Abstract: In a distributed database management system, several users can concurrently access and modify the same data objects, which may result in a conflict. A concurrency control algorithm is required to control interleaving of conflicting transactions to maintain the database consistency and correctness. Locking and timestamping are two commonly used concurrency control methods. But both of them are suitable for environment, where conflicts occur very often, because they try to resolve conflicts even before starting of the execution of the transaction. In cases, where conflicts are rare, another class of algorithms, popularly known as optimistic approach, is found to be more suitable, because it allows the transactions to run to completion on a local copy. The conflicts are resolved only before transferring the results to the actual database. An optimistic voting algorithm has been implemented in this dissertation work. It incorporates optimistic approach in conventional voting (timestamping) algorithm to improve the degree of concurrency, and hence throughput. Since transactions are executed on a local copy and only the results are transferred to the actual database, transaction can easily be aborted by discarding the local copy in case of site-failure. Using this feature the proposed algorithm also incorporates the crash recovery scheme.
URI: http://hdl.handle.net/123456789/9244
Other Identifiers: M.Tech
Research Supervisor/ Guide: Joshi, R. C.
metadata.dc.type: M.Tech Dessertation
Appears in Collections:MASTERS' DISSERTATIONS (E & C)

Files in This Item:
File Description SizeFormat 
ECD246539.pdf3.36 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.