Tailor-made Concurrency Control - distributed transactions as a case

This paper applies a model for distributed databases and transactions with a distinction between global and local correctness criteria. The global requirements per system are weaker than the local requirements per site. The paper presents an application which suits such a two-level division. The mai...

Full description

Bibliographic Details
Main Author: Mads Nygard
Format: Article
Language:English
Published: Australasian Association for Information Systems 1995-11-01
Series:Australasian Journal of Information Systems
Subjects:
Online Access:http://journal.acs.org.au/index.php/ajis/article/view/396
id doaj-85c92961990e44ecb4dffd112b21b9be
record_format Article
spelling doaj-85c92961990e44ecb4dffd112b21b9be2021-08-02T03:05:33ZengAustralasian Association for Information SystemsAustralasian Journal of Information Systems1449-86181449-86181995-11-013110.3127/ajis.v3i1.396350Tailor-made Concurrency Control - distributed transactions as a caseMads NygardThis paper applies a model for distributed databases and transactions with a distinction between global and local correctness criteria. The global requirements per system are weaker than the local requirements per site. The paper presents an application which suits such a two-level division. The main motivation for our investigation is based on the fact that the commonly used correctness criteria for concurrency control and recovery, serializability and total recoverability, are very strict criteria. The use of more relaxed criteria (allowing more true parallel behaviour and more true partial behaviour) is therefore very appealing - as long as this can be achieved without compromising safety or applicability. The main paradigm in our approach is based on the observation that relatively little knowledge about the databases and transactions can lead to major gains in system throughput. This allows specific systems to have more tailormade correctness criteria. We analyse a specialized type of distributed database, the skeleton-database, and a specialized type of distributed transaction, the wander-transaction. Wander-transactions accessing a skeleton-database allow breaks with both the common serializability criterion and the common total recoverability criterion. Our main emphasis here is on the nonserializability aspect. The primary goal of this work is to designate correctness criteria for controlling local and global parallelism. The secondary goal is to specify priority rules for handling local and global criteria breaks. Wander-transactions accessing a skeleton-database experience dynamic priorities. Our resulting concept, priority serializability, gives increased parallelism without compromising safety.http://journal.acs.org.au/index.php/ajis/article/view/396distributed databasesconcurrency controlcorrectness
collection DOAJ
language English
format Article
sources DOAJ
author Mads Nygard
spellingShingle Mads Nygard
Tailor-made Concurrency Control - distributed transactions as a case
Australasian Journal of Information Systems
distributed databases
concurrency control
correctness
author_facet Mads Nygard
author_sort Mads Nygard
title Tailor-made Concurrency Control - distributed transactions as a case
title_short Tailor-made Concurrency Control - distributed transactions as a case
title_full Tailor-made Concurrency Control - distributed transactions as a case
title_fullStr Tailor-made Concurrency Control - distributed transactions as a case
title_full_unstemmed Tailor-made Concurrency Control - distributed transactions as a case
title_sort tailor-made concurrency control - distributed transactions as a case
publisher Australasian Association for Information Systems
series Australasian Journal of Information Systems
issn 1449-8618
1449-8618
publishDate 1995-11-01
description This paper applies a model for distributed databases and transactions with a distinction between global and local correctness criteria. The global requirements per system are weaker than the local requirements per site. The paper presents an application which suits such a two-level division. The main motivation for our investigation is based on the fact that the commonly used correctness criteria for concurrency control and recovery, serializability and total recoverability, are very strict criteria. The use of more relaxed criteria (allowing more true parallel behaviour and more true partial behaviour) is therefore very appealing - as long as this can be achieved without compromising safety or applicability. The main paradigm in our approach is based on the observation that relatively little knowledge about the databases and transactions can lead to major gains in system throughput. This allows specific systems to have more tailormade correctness criteria. We analyse a specialized type of distributed database, the skeleton-database, and a specialized type of distributed transaction, the wander-transaction. Wander-transactions accessing a skeleton-database allow breaks with both the common serializability criterion and the common total recoverability criterion. Our main emphasis here is on the nonserializability aspect. The primary goal of this work is to designate correctness criteria for controlling local and global parallelism. The secondary goal is to specify priority rules for handling local and global criteria breaks. Wander-transactions accessing a skeleton-database experience dynamic priorities. Our resulting concept, priority serializability, gives increased parallelism without compromising safety.
topic distributed databases
concurrency control
correctness
url http://journal.acs.org.au/index.php/ajis/article/view/396
work_keys_str_mv AT madsnygard tailormadeconcurrencycontroldistributedtransactionsasacase
_version_ 1721243572150206464