Bounded Inconsistency for Type-Specific Concurrency Control

Man Hon Wong, Divyakant Agrawal, Hang Kwong Mak

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

The traditional correctness criterion of serializability in databases is considered too restrictive especially when databases are used to model advanced applications. In general, two approaches are adopted to address this problem. The first approach considers placing more structure on data objects to exploit type specific properties while keeping serializability as the correctness criterion. The other approach uses explicit semantics of transactions and databases to permit interleaved executions of transactions that are non-serializable. In this paper, we attempt to bridge the gap between the two approaches by using the notion of serializability with bounded inconsistency. Users are free to specify the maximum level of inconsistency that can be allowed in the executions of operations dynamically. In particular, if no inconsistency is allowed in the execution of any operation, the protocol will be reduced to a standard strict two phase locking protocol based on type-specific semantics of data objects. On the other hand, if inconsistency is not bounded, the execution of transactions is unrestricted in the proposed model. The proposed protocols have been implemented and the paper includes a performance comparison with the two-phase locking protocol. The results demonstrate that the associated overhead in the proposed protocol is not overwhelming and the gains in transition throughput can be significant for object based systems. Bounded inconsistency can be applied to many areas which do not require exact values of the data such as for gathering information for statistical purpose, for decision support systems, and for reasoning in expert systems which can tolerate uncertainty in input data.

Original languageEnglish
Pages (from-to)31-75
Number of pages45
JournalDistributed and Parallel Databases
Volume5
Issue number1
Publication statusPublished - 1 Dec 1997
Externally publishedYes

Fingerprint

Concurrency control
Concurrency Control
Inconsistency
Network protocols
Transactions
Phase Locking
Correctness
Semantics
Performance Comparison
Decision Support Systems
Decision support systems
Expert System
Expert systems
Throughput
Reasoning
Concurrency
Uncertainty
Model
Demonstrate
Object

Keywords

  • Bounded inconsistency
  • Concurrency control
  • Serializability

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Information Systems
  • Theoretical Computer Science

Cite this

Wong, M. H., Agrawal, D., & Mak, H. K. (1997). Bounded Inconsistency for Type-Specific Concurrency Control. Distributed and Parallel Databases, 5(1), 31-75.

Bounded Inconsistency for Type-Specific Concurrency Control. / Wong, Man Hon; Agrawal, Divyakant; Mak, Hang Kwong.

In: Distributed and Parallel Databases, Vol. 5, No. 1, 01.12.1997, p. 31-75.

Research output: Contribution to journalArticle

Wong, MH, Agrawal, D & Mak, HK 1997, 'Bounded Inconsistency for Type-Specific Concurrency Control', Distributed and Parallel Databases, vol. 5, no. 1, pp. 31-75.
Wong, Man Hon ; Agrawal, Divyakant ; Mak, Hang Kwong. / Bounded Inconsistency for Type-Specific Concurrency Control. In: Distributed and Parallel Databases. 1997 ; Vol. 5, No. 1. pp. 31-75.
@article{2e565b092888480f86c08433bddacb87,
title = "Bounded Inconsistency for Type-Specific Concurrency Control",
abstract = "The traditional correctness criterion of serializability in databases is considered too restrictive especially when databases are used to model advanced applications. In general, two approaches are adopted to address this problem. The first approach considers placing more structure on data objects to exploit type specific properties while keeping serializability as the correctness criterion. The other approach uses explicit semantics of transactions and databases to permit interleaved executions of transactions that are non-serializable. In this paper, we attempt to bridge the gap between the two approaches by using the notion of serializability with bounded inconsistency. Users are free to specify the maximum level of inconsistency that can be allowed in the executions of operations dynamically. In particular, if no inconsistency is allowed in the execution of any operation, the protocol will be reduced to a standard strict two phase locking protocol based on type-specific semantics of data objects. On the other hand, if inconsistency is not bounded, the execution of transactions is unrestricted in the proposed model. The proposed protocols have been implemented and the paper includes a performance comparison with the two-phase locking protocol. The results demonstrate that the associated overhead in the proposed protocol is not overwhelming and the gains in transition throughput can be significant for object based systems. Bounded inconsistency can be applied to many areas which do not require exact values of the data such as for gathering information for statistical purpose, for decision support systems, and for reasoning in expert systems which can tolerate uncertainty in input data.",
keywords = "Bounded inconsistency, Concurrency control, Serializability",
author = "Wong, {Man Hon} and Divyakant Agrawal and Mak, {Hang Kwong}",
year = "1997",
month = "12",
day = "1",
language = "English",
volume = "5",
pages = "31--75",
journal = "Distributed and Parallel Databases",
issn = "0926-8782",
publisher = "Springer Netherlands",
number = "1",

}

TY - JOUR

T1 - Bounded Inconsistency for Type-Specific Concurrency Control

AU - Wong, Man Hon

AU - Agrawal, Divyakant

AU - Mak, Hang Kwong

PY - 1997/12/1

Y1 - 1997/12/1

N2 - The traditional correctness criterion of serializability in databases is considered too restrictive especially when databases are used to model advanced applications. In general, two approaches are adopted to address this problem. The first approach considers placing more structure on data objects to exploit type specific properties while keeping serializability as the correctness criterion. The other approach uses explicit semantics of transactions and databases to permit interleaved executions of transactions that are non-serializable. In this paper, we attempt to bridge the gap between the two approaches by using the notion of serializability with bounded inconsistency. Users are free to specify the maximum level of inconsistency that can be allowed in the executions of operations dynamically. In particular, if no inconsistency is allowed in the execution of any operation, the protocol will be reduced to a standard strict two phase locking protocol based on type-specific semantics of data objects. On the other hand, if inconsistency is not bounded, the execution of transactions is unrestricted in the proposed model. The proposed protocols have been implemented and the paper includes a performance comparison with the two-phase locking protocol. The results demonstrate that the associated overhead in the proposed protocol is not overwhelming and the gains in transition throughput can be significant for object based systems. Bounded inconsistency can be applied to many areas which do not require exact values of the data such as for gathering information for statistical purpose, for decision support systems, and for reasoning in expert systems which can tolerate uncertainty in input data.

AB - The traditional correctness criterion of serializability in databases is considered too restrictive especially when databases are used to model advanced applications. In general, two approaches are adopted to address this problem. The first approach considers placing more structure on data objects to exploit type specific properties while keeping serializability as the correctness criterion. The other approach uses explicit semantics of transactions and databases to permit interleaved executions of transactions that are non-serializable. In this paper, we attempt to bridge the gap between the two approaches by using the notion of serializability with bounded inconsistency. Users are free to specify the maximum level of inconsistency that can be allowed in the executions of operations dynamically. In particular, if no inconsistency is allowed in the execution of any operation, the protocol will be reduced to a standard strict two phase locking protocol based on type-specific semantics of data objects. On the other hand, if inconsistency is not bounded, the execution of transactions is unrestricted in the proposed model. The proposed protocols have been implemented and the paper includes a performance comparison with the two-phase locking protocol. The results demonstrate that the associated overhead in the proposed protocol is not overwhelming and the gains in transition throughput can be significant for object based systems. Bounded inconsistency can be applied to many areas which do not require exact values of the data such as for gathering information for statistical purpose, for decision support systems, and for reasoning in expert systems which can tolerate uncertainty in input data.

KW - Bounded inconsistency

KW - Concurrency control

KW - Serializability

UR - http://www.scopus.com/inward/record.url?scp=0030865443&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030865443&partnerID=8YFLogxK

M3 - Article

VL - 5

SP - 31

EP - 75

JO - Distributed and Parallel Databases

JF - Distributed and Parallel Databases

SN - 0926-8782

IS - 1

ER -