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

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.