A Performance Study of Divergence Control Algorithms

Akira KAWAGUCHI; Kui W. MOK; Calton PU; Kun-Lung WU; Philip S. YU

A Performance Study of Divergence Control Algorithms

Akira KAWAGUCHI, Kui W. MOK, Calton PU, Kun-Lung WU, Philip S. YU

Full Text Views

0

Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Information Vol.E82-D No.1 pp.224-235

Publication Date: 1999/01/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Issue on New Generation Database Technologies)

Category: Concurrency Control

Cite this

Copy

Akira KAWAGUCHI, Kui W. MOK, Calton PU, Kun-Lung WU, Philip S. YU, "A Performance Study of Divergence Control Algorithms" in IEICE TRANSACTIONS on Information, vol. E82-D, no. 1, pp. 224-235, January 1999, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/information/10.1587/e82-d_1_224/_p

Copy

@ARTICLE{e82-d_1_224,
author={Akira KAWAGUCHI, Kui W. MOK, Calton PU, Kun-Lung WU, Philip S. YU, },
journal={IEICE TRANSACTIONS on Information},
title={A Performance Study of Divergence Control Algorithms},
year={1999},
volume={E82-D},
number={1},
pages={224-235},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={January},}

Copy

TY - JOUR
TI - A Performance Study of Divergence Control Algorithms
T2 - IEICE TRANSACTIONS on Information
SP - 224
EP - 235
AU - Akira KAWAGUCHI
AU - Kui W. MOK
AU - Calton PU
AU - Kun-Lung WU
AU - Philip S. YU
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E82-D
IS - 1
JA - IEICE TRANSACTIONS on Information
Y1 - January 1999
AB - 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.
ER -