Concurrency control in distributed databases through dummy locks

Date

1990-10-01

Author

Halıcı, Uğur

Metadata

Show full item record

Item Usage Stats

157
views

0
downloads

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 before the validation test, and therefore the cost of restarts is reduced. The usual read and write locks are used as short-term locks during the validation test. This use of short-term locks eliminates the need for the systemwide critical section and results in a distributed and parallel validation test.

Subject Keywords

Computer Operating Systems - Design, Concurrency control, Transaction processing

URI

https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=0025497837&origin=inward
https://hdl.handle.net/11511/74163
https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=128330

Conference Name

5th Jerusalem Conference on Information Technology ( 22-25 October 1990)

Collections

Department of Electrical and Electronics Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Concurrency control in distributed databases through time intervals and short-term locks Halıcı, Uğur (Institute of Electrical and Electronics Engineers (IEEE), 1989) 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 contin...
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...
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...
Serializability of nested transactions in multidatabases Halıcı, Uğur; Dogac, Asuman (1997-01-01) © Springer-Verlag Berlin Heidelberg 1997.The correctness of nested transactions for multidatabases differs from that of flat transactions in that, for nested transactions the execution order of siblings at each related site should also be consistent. In this paper we first propose a simple but powerful theory for the serializability of nested transactions in multidatabases and then a technique called Nested Tickets Method for Nested Transactions (NTNT). The NTNT technique provides correctness of nested tran...
Statistical analysis of block ciphers and hash functions Sulak, Fatih; Doğanaksoy, Ali; Department of Cryptography (2011) One of the most basic properties expected from block ciphers and hash functions is passing statistical randomness testing, as they are supposed to behave like random mappings. Previously, testing of AES candidate block ciphers was done by using the statistical tests defined in the NIST Test Suite. As some of the tests in this suite require long sequences, data sets are formed by concatenating the outputs of the algorithms obtained from various input types. However, the nature of block cipher and hash functi...

Citation Formats

U. Halıcı, “Concurrency control in distributed databases through dummy locks,” Jerusalem,Israel, 1990, p. 576, Accessed: 00, 2021. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=0025497837&origin=inward.