SODA: An Algorithm to Guarantee Correctness of Concurrent Transaction Execution in Mobile P2P Databases

Authors:
Zhaowen Xing;Le Gruenwald;K. K. Phang
Affiliations:
-;-;-
Venue:
DEXA '08 Proceedings of the 2008 19th International Conference on Database and Expert Systems Application
Year:
2008

Citing 0
Cited 3

An optimistic concurrency control algorithm for mobile ad-hoc network databases

Proceedings of the Fourteenth International Database Engineering & Applications Symposium
An energy-efficient concurrency control algorithm for mobile ad-hoc network databases

DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I
Managing concurrent execution of transactions in mobile ad-hoc network database systems: an energy-efficient approach

Distributed and Parallel Databases

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.