Concurrency Control Protocol for Nested Transactions in Real-Time Databases

In this paper we consider real-time concurrency control for the nested transaction model. We analyze problems that have pure optimistic and pessimistic approaches. As the solution we propose a hybrid concurrency control algorithm which acts as an optimistic for transactions from different transaction trees and as pessimistic inside a single transaction tree.

Content

Author and article information

Conference

Publication date: September 1997

Publication date (Print): September 1997

Pages: 1-10

Affiliations

[0001]St. Petersburg University

St. Petersburg, Russia

Article

DOI: 10.14236/ewic/ADBIS1997.33

SO-VID: 372322ad-3b39-4691-91bf-591751994e58

Copyright © © Ekaterina Pavlova et al. Published by BCS Learning and Development Ltd. Proceedings of the First East-European Symposium on Advances in Databases and Information Systems, (ADBIS'97), St Petersburg

License:

This work is licensed under a Creative Commons Attribution 4.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

Conference name: Proceedings of the First East-European Symposium on Advances in Databases and Information Systems

Conference acronym: ADBIS

Conference number: 1

Conference location: St Petersburg

Conference date: 2-5 September 1997

Conference sponsor: Electronic Workshops in Computing (eWiC)

Conference theme: Advances in Databases and Information Systems

History

Product

1477-9358 BCS Learning & Development

Self URI (article page): https://www.scienceopen.com/hosted-document?doi=10.14236/ewic/ADBIS1997.33

Self URI (journal page): https://ewic.bcs.org/

Celebrating 65 years of The Computer Journal - free-to-read perspectives - bcs.org/tcj65

Concurrency Control Protocol for Nested Transactions in Real-Time Databases

Abstract