Author(s): Mohammed Khaja Nizamuddin | Syed Abdul Sattar
Journal: ARPN Journal of Systems and Software
ISSN 2222-9833
Volume: 1;
Issue: 1;
Start page: 34;
Date: 2011;
Original page
Keywords: Absolute Validity Interval | Priority Value | Semaphore | Mobile Host | Fixed Host
ABSTRACT
In a mobile computing environment, clients can access shared data irrespective of their physical location and can be updated by each client independently. This leads to inconsistency of the data. Several concurrency control techniques are proposed in literature to prevent data inconsistency. In this paper we first analyze the existing scheme of concurrency control without locking and justify its performance limitations. A new priority based scheme is proposed in which priority is given to the older transaction whenever conflict arises, there by decreasing transaction re-executions and current load of the database server. Experimental results show performance benefits such as increase in commit rate and decrease in re-execution of the transactions.
Journal: ARPN Journal of Systems and Software
ISSN 2222-9833
Volume: 1;
Issue: 1;
Start page: 34;
Date: 2011;
Original page
Keywords: Absolute Validity Interval | Priority Value | Semaphore | Mobile Host | Fixed Host
ABSTRACT
In a mobile computing environment, clients can access shared data irrespective of their physical location and can be updated by each client independently. This leads to inconsistency of the data. Several concurrency control techniques are proposed in literature to prevent data inconsistency. In this paper we first analyze the existing scheme of concurrency control without locking and justify its performance limitations. A new priority based scheme is proposed in which priority is given to the older transaction whenever conflict arises, there by decreasing transaction re-executions and current load of the database server. Experimental results show performance benefits such as increase in commit rate and decrease in re-execution of the transactions.