An incremental hash-based optimistic concurrency control scenario for failure management in HDDBs - an application approach Online publication date: Tue, 28-Jul-2015
by Dharavath Ramesh; Chiranjeev Kumar; Kumar Bitthal
International Journal of Intelligent Information and Database Systems (IJIIDS), Vol. 9, No. 1, 2015
Abstract: During real-time transaction process there is a high probability of transaction failure due to the application of various concurrency control-based protocols and network overload. There are no effective methods to manage these failed transactions that provide the clients an opportunity to renew their transaction in a short span of time. In this paper, we propose a methodology which caters to the need for an effective concurrency control management by providing an efficient way to decrease the real-time as well as non-real-time work done by the server. Our proposed methodology represents an excellent blossom in the failure management environment. This method is based on the calculation of hash value of the data field and compares the current hash value with the previous hash value every time before the write operation takes place. The proposed methodology also allows the client to renew a failed transaction using their previous transaction details. We perform extensive experiments to validate the proposed methodology by using remote method invocation (RMI). By performing extensive experiments, we epitomise the performance of this method with existing modalities. Experimental results show that the proposed methodology can achieve atomicity and optimistic instances for failure transactions in an efficient way.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Intelligent Information and Database Systems (IJIIDS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com