. . .

About Us
Education
Research
PhD
Acta Cybernetica
Conferences
Sponsors

Departments:
- Image Processing and Computer Graphics
- Technical Informatics
- Foundations of Computer Science
- Computer Algorithms and Artificial Intelligence
- Computational Optimization
- Software Engineering
- Research Group on Artificial Intelligence

[University of Szeged]
Research>>> Acta Cybernetica>>> Previous Volumes>>> Magyarul

Hybrid Concurrency Control and Recovery for Multi-Level Transactions

 

 

 Klaus-Dieter Schewe * - Torsten Ripke * - Sven Drechsler1

  Date: Acta Cybernetica 14 (2000) 419-453.


Abstract:

 

 Multi-level transaction schedulers adapt conflict-serializability on different levels. They exploit the fact that many low-level conflicts (e.g. on the level of pages) become irrelevant, if higher-level application semantics is taken into account. Multi-level transactions may lead to an increase in concurrency.

 It is easy to generalize locking protocols to the case of multi-level transactions. In this, however, the possibility of deadlocks may diminish the increase in concurrency. This stimulates the investigation of optimistic or hybrid approaches to concurrency control.

 Until now no hybrid concurrency control protocol for multi-level transactions has been published. The new FoPL protocol ( F orward o riented Concurrency Control with P reordered L ocking) is such a protocol. It employs access lists on the database objects and forward oriented commit validation. The basic test on all levels is based on the reordering of the access lists. When combined with queueing and deadlock detection, the protocol is not only sound, but also complete for multi-level serializable schedules. This is definitely an advantage of FoPL compared with locking protocols. The complexity of deadlock detection is not crucial, since waiting transactions do not hold locks on database objects. Furthermore, the basic FoPL protocol can be optimized in various ways.

 Since the concurrency control protocol may force transactions to be aborted, it is necessary to support operation logging. It is shown that as well as multi-level locking protocols can be easily coupled with the ARIES algorithms. This also solves the problem of rollback during normal processing and crash recovery. Keywords. [H2.4] Transaction Processing, Concurrency [H2.7] Logging and Recovery General Terms. Algorithms, Reliability  


Footnotes

  1. Computer Science Institute, Clausthal Technical University, Julius-Albert-Str. 4, 38678 Clausthal-Zellerfeld, FRG [schewe-ripke-sdrechsl]@informatik.tu-clausthal.de

   

 

 Kocsorne Sebo Marianna

7/5/2000

Webmaster:webmaster@inf.u-szeged.hu