Concurrency control in distributed databases through time intervals and short-term locks

Date

1989

Author

Halıcı, Uğur

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

296
views

0
downloads

A method for concurrency control in distributed database management systems that increases the level of concurrent execution of transactions, called ordering by serialization numbers (OSN), is proposed. The OSN method works in the certifier model and uses time-interval techniques in conjunction with short-term locks to provide serializability and prevent deadlocks. The scheduler is distributed, and the standard transaction execution policy is assumed, that is, the read and write operations are issued continuously during transaction execution. However, the write operations are copied into the database only when the transaction commits. The amount of concurrency provided by the OSN method is demonstrated by log classification. It is shown that the OSN method provides more concurrency than basic timestamp ordering and two-phase locking methods and handles successfully some logs which cannot be handled by any of the past methods. The complexity analysis of the algorithm indicates that the method works in a reasonable amount of time

Subject Keywords

Concurrency control, Distributed databases, Concurrent computing, Transaction databases, System recovery, Costs, Testing, Algorithm design and analysis, Performance analysis, Communication system control

URI

https://hdl.handle.net/11511/52070

Journal

IEEE Transactions on Software Engineering

DOI

https://doi.org/10.1109/32.31355

Collections

Department of Electrical and Electronics Engineering, Article

Suggestions

OpenMETU
Core

Concurrency control in distributed databases through dummy locks Halıcı, Uğur (1990-10-01) An optimistic scheme, called ODL, that uses dummy locks to test the validity of a transaction for concurrency control in distributed database systems is suggested. The dummy locks are long-term locks; however, they do not conflict with any other lock. By the use of long-term dummy locks, the need for the information about the write sets of validated transactions is eliminated, and during the validation test only the related sites are checked. Also, the transactions to be aborted are immediately recognized b...
Concurrency control for distributed multiversion databases through time intervals Halıcı, Uğur (1991-04-01) © 1991 ACM.Multiversion Schedulers are now a widely accepted method for enhancing performance of the concurrency control component of a database. When the read and write sets of transactions are known in advance, the amount of concurrency provided by the Multiversion Schedulers can further be improved. In this paper, a new concurrency control technique, which uses multiversion data in conjunction with predeclared read-write sets and the Time Interval technique is suggested. With the proposed method, a trans...
Hierarchical multitasking control of discrete event systems: Computation of projections and maximal permissiveness Schmidt, Klaus Verner; Cury, José E.r. (null; 2010-12-01) This paper extends previous results on the hierarchical and decentralized control of multitasking discrete event systems (MTDES). Colored observers, a generalization of the observer property, together with local control consistency, allow to derive sufficient conditions for synthesizing modular and hierarchical control that are both strongly nonblocking (SNB) and maximally permissive. A polynomial procedure to verify if a projection fulfills the above properties is proposed and in the case they fail for a g...
Error Control of Multiple-Precision MLFMA Kalfa, Mert; Ergül, Özgür Salih; Erturk, Vakur B. (Institute of Electrical and Electronics Engineers (IEEE), 2018-10) We introduce and demonstrate a new error control scheme for the computation of far-zone interactions in the multilevel fast multipole algorithm when implemented within a multiple-precision arithmetic framework. The proposed scheme provides the optimum truncation numbers as well as the machine precisions given the desired relative error thresholds and the box sizes for the translation operator at all frequencies. In other words, unlike the previous error control schemes which are valid only for high-frequenc...
AN OPTIMISTIC LOCKING TECHNIQUE FOR CONCURRENCY-CONTROL IN DISTRIBUTED DATABASES Halıcı, Uğur (1991-07-01) An optimistic scheme, called ODL, which uses dummy locks to test the validity of a transaction for concurrency control in distributed database systems, is suggested. The dummy locks are long-term locks; however, they do not conflict with any other lock. By the use of long-term dummy locks, the need for the information about the write sets of validated transactions is eliminated and during the validation test only the related sites are checked. Also, the transactions to be aborted are immediately recogniz...

Citation Formats

U. Halıcı, “Concurrency control in distributed databases through time intervals and short-term locks,” IEEE Transactions on Software Engineering, pp. 994–1003, 1989, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/52070.