By Topic

Efficient optimistic concurrency control for mobile real-time transactions in a wireless data broadcast environment

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Li Guohui ; Sch. of Comput. Sci. & Technol., Huazhong Univ. of Sci. & Technol., Wuhan, China ; Yang Bing ; Chen Jixiong

In this paper, we introduce a variant of the optimistic concurrency control protocols. The broadcast cycle is divided into multiple sub-cycles. Between two sub-cycles, there is a reserved space to accomodate identities for all the data objects which are updated by transactions in the server after the first sub-cycle begins. A read-only mobile transaction can validate its consistency autonomously by comparing its read-set with the committed write-set of the update transactions. If a read-only transaction cannot pass the partial validation, it is not simply aborted and restarted. Instead, an enhanced forward validation policy is applied, which help read-only transactions have more chances to commit. Extensive experiments are conducted to evaluate the performance of the proposed algorithms.

Published in:

11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'05)

Date of Conference:

17-19 Aug. 2005