2008 19th International Conference on Database and Expert Systems Application SODA: An Algorithm to Guarantee Correctness of Concurrent Transaction Execution in Mobile P2P Databases September 01-September 05 ISBN: 978-0-7695-3299-8
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DEXA.2008.96
This paper proposes an optimistic concurrency control (CC) algorithm, called Sequential Order with Dynamic Adjustment (SODA), that guarantees timely and correct execution of concurrent transaction in Mobile P2P databases. In Mobile P2P, as every peer is fully autonomous, needs timely response and has inherent characteristics (mobility, low bandwidth, limited battery power, limited storage and frequent disconnections), existing CC algorithms cannot be applied directly. SODA is an effort to fill in this gap. The analysis of SODA shows that it is able to improve the response time by applying the concept of sequential order and reduce the transaction abort rate by dynamically adjusting the sequential order.
Index Terms:
concurrency control, transaction, mobile P2P
Citation:
Zhaowen Xing, Le Gruenwald, K. K. Phang, "SODA: An Algorithm to Guarantee Correctness of Concurrent Transaction Execution in Mobile P2P Databases," dexa, pp.337-341, 2008 19th International Conference on Database and Expert Systems Application, 2008 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb