Epsilon serializability (ESR) was proposed to relax serializability constraints by allowing transactions to execute with a limited amount of inconsistency (ε-spec). Divergence control algorithms, viewed as extensions of concurrency control algorithms, enable read-only transactions to complete if their inconsistencies do not exceed ε-spec. This paper studies the performance of two-phase locking divergence control (2PLDC) and optimistic divergence control (ODC) algorithms. We develop a central part of the ESR transaction processing system that runs with 2PLDC and ODC. We applied a comprehensive centralized database simulation model to measure the performance. Evaluations are conducted with multi-class workloads where on-line update transactions and long-duration queries progress under various ε-spec. Our results demonstrate that significant performance enhancements are achieved with a non-zero tolerable inconsistency. With sufficient ε-spec and limited system resources, both algorithms result in comparable performance. However, with low resource contention, ODC performs significantly better than 2PLDC. Furthermore, in the range of small ε-spec, the queries committed by ODC have more accurate results than those committed by 2PLDC.

In this paper, we propose a new transaction numbering scheme and a new validation scheme for controlling transactions optimistically in client-server architectural mobile distributed database systems (MDDBSs). In the system, mobile units (MUs) request transaction-related services, e.g., concurrency control, commit process, then the mobile support stations (MSSs) provide the required services. The mobile computing environment makes it very difficult for each MU to assign unique transaction number to transactions since it is allowed to move in communication disconnected states. Besides, validating transactions numbered by the previous transaction numbering scheme could wait indefinitely in the case of data transfer delay. Thus, we propose a new transaction numbering scheme called datatransfer time oriented transaction numbering scheme (DATTO) ,in which we can remove waiting time for validation by determining validation-start time with data-transfer completion time. However, if the previous validation scheme for the static environment is directly applied transactions numbered by DATTO, undesirable results could occur in abnormal cases due to latency on the wireless communication. Thus, we also propose a new validation scheme, called commit-order oriented validation (COOV) ,which is always able to produce correct results by applying backward validation to the abnormal cases.