Using abstract state machines for the design of multi-level transaction schedulers

Authors:
Markus Kirchberg;Klaus-Dieter Schewe;Jane Zhao
Affiliations:
Institute for Infocomm Research (I2R), A*STAR, Singapore;Information Science Research Centre, Palmerston North, New Zealand;Information Science Research Centre, Palmerston North, New Zealand
Venue:
Rigorous Methods for Software Construction and Analysis
Year:
2009

Citing 11
Cited 0

A model for concurrency in nested transactions systems

Journal of the ACM (JACM)
Principles and realization strategies of multilevel transaction management

ACM Transactions on Database Systems (TODS)
Hybrid concurrency control and recovery for multi-level transactions

Acta Cybernetica
A comparison of multi-level concurrency control protocols

ADC '01 Proceedings of the 12th Australasian database conference
Databases and Transaction Processing: An Application-Oriented Approach

Databases and Transaction Processing: An Application-Oriented Approach
Transaction Processing: Concepts and Techniques

Transaction Processing: Concepts and Techniques
Operational semantics of transactions

ADC '03 Proceedings of the 14th Australasian database conference - Volume 17
ASM Refinement and generalizations of forward simulation in data refinement: a comparison

Theoretical Computer Science - Abstract state machines and high-level system design and analysis
ASM-based design of data warehouses and on-line analytical processing systems

Journal of Systems and Software - Special issue: Quality software
A multi-level architecture for distributed object bases

Data & Knowledge Engineering
Refinements in typed abstract state machines

PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multi-level transactions have been suggested as an approach to increase transaction throughput in databases. The central idea is to enable some low-level conflicts to be ignored by taking higher-level application semantics into account. In this paper, we approach the formal specification of a multi-level transaction scheduler using Abstract State Machines. We are particularly interested in showing that concrete protocols for multi-level transaction processing arise as refinements of an abstract ground model specification. Furthermore, we are interested in the proof of desirable properties of such schedulers such as the correctness and if possible also completeness with respect to serialisability, and the recoverability of the accepted schedules. For this we investigate a two-phase locking and a hybrid protocol.