City University of Hong Kong

CityU Institutional Repository >
3_CityU Electronic Theses and Dissertations >
ETD - Dept. of Computer Science  >
CS - Master of Philosophy  >

Please use this identifier to cite or link to this item:

Title: Resolving executing-committing conflict in distributed real-time database systems
Other Titles: Jie jue zai fen bu shi shi shi shu ju ku nei zhi xing yu ti jiao zhi chong tu
Authors: Pang, Chung-leung (彭仲良)
Department: Dept. of Computer Science
Degree: Master of Philosophy
Issue Date: 2000
Publisher: Dept. of Computer Science, City University of Hong Kong
Subjects: Database management
Transaction systems (Computer systems)
Notes: CityU Call Number: QA76.545.P36 2000
Includes bibliographical references (leaves 94-96)
Thesis (M.Phil.)--City University of Hong Kong, 2000
iv, 96 leaves : ill. ; 30 cm.
Type: Thesis
Abstract: In a distributed real-time database system (DRTDBS), the interaction of transactions and failure atomicity are handled by concurrency and commitment control protocol separately. When there is a conflict between the system concurrency and failure atomicity, system concurrency is always given way to the failure atomicity. Because of this, executing transactions are usually blocked whenever they conflict with committing transactions - the executing-committing conflict. However, blocking the executing transactions is unnecessary most of the time and this approach adversely affects the performance of a system. Yet, the significance of the executing-committing conflict has long been neglected. In this thesis, a new protocol called Deadline-driven Conflict Resolution (DDCR) protocol is proposed. This protocol integrates concurrency control and commitment management to resolve executing-committing conflict in a DRTDBS. With the DDCR, higher degree of concurrency can be achieved since the number of data conflicts, not just the executing-committing conflict, are reduced. Data objects that are held by committing transactions can now be shared with executing transactions. Also, the impact of temporary failure, which occurred during the commitment stage of a transaction, is alleviated because the dependency among transactions can be reversed. In this thesis, a simulation model has been developed and extensive experiments have been performed to compare the performance of the DDCR with other protocols such as the OPT [6], the Healthy-OPT [7] and the Base protocol. The simulation results show that the DDCR can significantly improve the performance of a system under various workloads and distributions. Its performance is consistently better than the Base protocol and the OPT protocols in both the main-memory and disk resident DRTDBS. Finally, the DDCR is modified to include a different notion of serializability and is applied to a mixed transaction DRTDBS. It shows that the DDCR protocol can be easily modified to deal with different working environment and further improves system performance.
Online Catalog Link:
Appears in Collections:CS - Master of Philosophy

Files in This Item:

File Description SizeFormat
fulltext.html159 BHTMLView/Open
abstract.html159 BHTMLView/Open

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


Valid XHTML 1.0!
DSpace Software © 2013 CityU Library - Send feedback to Library Systems
Privacy Policy · Copyright · Disclaimer