Unified protocols of concurrency control and recovery in distributed object-based databases

Sang-Geun Lee, C. S. Hwang

Research output: Contribution to journalArticle

Abstract

This paper provides unified protocols of concurrency control and recovery in distributed object-based databases by using two unified conflict notions: Preservation and weak preservation. The two conflict relations provide the solutions to (i) the low-level heterogeneity of different recovery mechanisms and/or object models, and (ii) the correct schedules from both concurrency control and recovery points of view. In particular, preservation can be used for accepting serializable and strict (SR-ST) and/or serializable and avoiding cascading aborts (SR-ACA) schedules, whereas weak preservation can be used for accepting serializable and recoverable (SR-RC) schedules. It is also shown that the unified protocols are general enough for object-based databases in addition to the classical read/write databases.

Original languageEnglish
Pages (from-to)201-213
Number of pages13
JournalComputer Journal
Volume44
Issue number3
DOIs
Publication statusPublished - 2001 Dec 1

Fingerprint

Concurrency control
Network protocols
Recovery

ASJC Scopus subject areas

  • Hardware and Architecture
  • Information Systems
  • Computer Graphics and Computer-Aided Design
  • Software

Cite this

Unified protocols of concurrency control and recovery in distributed object-based databases. / Lee, Sang-Geun; Hwang, C. S.

In: Computer Journal, Vol. 44, No. 3, 01.12.2001, p. 201-213.

Research output: Contribution to journalArticle

@article{5f3b4414c93d4ad2b243c3e5c0f7c096,
title = "Unified protocols of concurrency control and recovery in distributed object-based databases",
abstract = "This paper provides unified protocols of concurrency control and recovery in distributed object-based databases by using two unified conflict notions: Preservation and weak preservation. The two conflict relations provide the solutions to (i) the low-level heterogeneity of different recovery mechanisms and/or object models, and (ii) the correct schedules from both concurrency control and recovery points of view. In particular, preservation can be used for accepting serializable and strict (SR-ST) and/or serializable and avoiding cascading aborts (SR-ACA) schedules, whereas weak preservation can be used for accepting serializable and recoverable (SR-RC) schedules. It is also shown that the unified protocols are general enough for object-based databases in addition to the classical read/write databases.",
author = "Sang-Geun Lee and Hwang, {C. S.}",
year = "2001",
month = "12",
day = "1",
doi = "10.1093/comjnl/44.3.201",
language = "English",
volume = "44",
pages = "201--213",
journal = "Computer Journal",
issn = "0010-4620",
publisher = "Oxford University Press",
number = "3",

}

TY - JOUR

T1 - Unified protocols of concurrency control and recovery in distributed object-based databases

AU - Lee, Sang-Geun

AU - Hwang, C. S.

PY - 2001/12/1

Y1 - 2001/12/1

N2 - This paper provides unified protocols of concurrency control and recovery in distributed object-based databases by using two unified conflict notions: Preservation and weak preservation. The two conflict relations provide the solutions to (i) the low-level heterogeneity of different recovery mechanisms and/or object models, and (ii) the correct schedules from both concurrency control and recovery points of view. In particular, preservation can be used for accepting serializable and strict (SR-ST) and/or serializable and avoiding cascading aborts (SR-ACA) schedules, whereas weak preservation can be used for accepting serializable and recoverable (SR-RC) schedules. It is also shown that the unified protocols are general enough for object-based databases in addition to the classical read/write databases.

AB - This paper provides unified protocols of concurrency control and recovery in distributed object-based databases by using two unified conflict notions: Preservation and weak preservation. The two conflict relations provide the solutions to (i) the low-level heterogeneity of different recovery mechanisms and/or object models, and (ii) the correct schedules from both concurrency control and recovery points of view. In particular, preservation can be used for accepting serializable and strict (SR-ST) and/or serializable and avoiding cascading aborts (SR-ACA) schedules, whereas weak preservation can be used for accepting serializable and recoverable (SR-RC) schedules. It is also shown that the unified protocols are general enough for object-based databases in addition to the classical read/write databases.

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

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

U2 - 10.1093/comjnl/44.3.201

DO - 10.1093/comjnl/44.3.201

M3 - Article

AN - SCOPUS:0035652920

VL - 44

SP - 201

EP - 213

JO - Computer Journal

JF - Computer Journal

SN - 0010-4620

IS - 3

ER -