Dağıtılmış veritabanı sistemlerinde eşzamanlılık kontrolü
Concurrency control in distributed database management systems
- Tez No: 46449
- Danışmanlar: DOÇ.DR. NADİA ERDOĞAN
- Tez Türü: Yüksek Lisans
- Konular: Bilgisayar Mühendisliği Bilimleri-Bilgisayar ve Kontrol, Computer Engineering and Computer Science and Control
- Anahtar Kelimeler: Belirtilmemiş.
- Yıl: 1995
- Dil: Türkçe
- Üniversite: İstanbul Teknik Üniversitesi
- Enstitü: Fen Bilimleri Enstitüsü
- Ana Bilim Dalı: Belirtilmemiş.
- Bilim Dalı: Belirtilmemiş.
- Sayfa Sayısı: 142
Özet
“lock”with each lock unit, this lock is set by a transaction before it is accessed and is reset at the end of its use. Obviously, a lock unit cannot be accessed by an operation if it is already locked. Thus a lock request by a transaction is granted only if the associated lock is not being held by any other transaction. Unlike the locking-based algorithms, timestamp- based concurrency control algorithms do not attempt to maintain serializability by mutual exclusion. Instead, they select, a priory a serialization order and execute transactions accordingly. To establish this ordering, the transaction manager assigns each transaction a unique timestamp. Deadlock is the one of the most important problem in the locking based concurrency control algorithms. Therefore, the distributed DBMS requires special procedures to handle this problem. Any locking-based concurrency control algorithm may result in deadlocks, since there is mutual exclusion of access to shared resources (data) and transactions may wait on locks. A deadlock can occur because transactions wait for one another. The deadlock problem in DDBSs is similar in nature to that encountered in operating systems. The competi tion among users for access to a set of resources (data, in this case) can result in deadlock if the synchronization mechanism is based on locking. The well known alternatives of prevention, avoidance and detection/recovery also apply to DDBSs.
Özet (Çeviri)
The goal of this study is to investigate the implementation issues of a centralized concurrency control algoithm based on two-phase locking for DDBMS on a single processer system, namely a personel computer, running under the DOS operating system. According to this algorithm, a single cite is delegated lock management responsibility. This means that only one site has a lock manager in distributed system. Before accessing data at any site, appropri ate locks must be obtained from the central lock manager. Altough there are several proposed locking based concurrency control algorithms, the basic one of them is choosen for this simulation. Because this algorithm is easily extend, for example, primary copy and distributed concurrency control algorithms. In primary copy two phase locking concurrency control algorithm, the only changes is that since every site has a lock manager, the primary copy locations have to be determined for each data item prior to sendidng a lock or unlock request to lock manager at a site. In a distributed two phase locking algorithm, if the database is not replicated, it degenerates into the primary copy two phase locking algorithm. XI“lock”with each lock unit, this lock is set by a transaction before it is accessed and is reset at the end of its use. Obviously, a lock unit cannot be accessed by an operation if it is already locked. Thus a lock request by a transaction is granted only if the associated lock is not being held by any other transaction. Unlike the locking-based algorithms, timestamp- based concurrency control algorithms do not attempt to maintain serializability by mutual exclusion. Instead, they select, a priory a serialization order and execute transactions accordingly. To establish this ordering, the transaction manager assigns each transaction a unique timestamp. Deadlock is the one of the most important problem in the locking based concurrency control algorithms. Therefore, the distributed DBMS requires special procedures to handle this problem. Any locking-based concurrency control algorithm may result in deadlocks, since there is mutual exclusion of access to shared resources (data) and transactions may wait on locks. A deadlock can occur because transactions wait for one another. The deadlock problem in DDBSs is similar in nature to that encountered in operating systems. The competi tion among users for access to a set of resources (data, in this case) can result in deadlock if the synchronization mechanism is based on locking. The well known alternatives of prevention, avoidance and detection/recovery also apply to DDBSs.The goal of this study is to investigate the implementation issues of a centralized concurrency control algoithm based on two-phase locking for DDBMS on a single processer system, namely a personel computer, running under the DOS operating system. According to this algorithm, a single cite is delegated lock management responsibility. This means that only one site has a lock manager in distributed system. Before accessing data at any site, appropri ate locks must be obtained from the central lock manager. Altough there are several proposed locking based concurrency control algorithms, the basic one of them is choosen for this simulation. Because this algorithm is easily extend, for example, primary copy and distributed concurrency control algorithms. In primary copy two phase locking concurrency control algorithm, the only changes is that since every site has a lock manager, the primary copy locations have to be determined for each data item prior to sendidng a lock or unlock request to lock manager at a site. In a distributed two phase locking algorithm, if the database is not replicated, it degenerates into the primary copy two phase locking algorithm. XI“lock”with each lock unit, this lock is set by a transaction before it is accessed and is reset at the end of its use. Obviously, a lock unit cannot be accessed by an operation if it is already locked. Thus a lock request by a transaction is granted only if the associated lock is not being held by any other transaction. Unlike the locking-based algorithms, timestamp- based concurrency control algorithms do not attempt to maintain serializability by mutual exclusion. Instead, they select, a priory a serialization order and execute transactions accordingly. To establish this ordering, the transaction manager assigns each transaction a unique timestamp. Deadlock is the one of the most important problem in the locking based concurrency control algorithms. Therefore, the distributed DBMS requires special procedures to handle this problem. Any locking-based concurrency control algorithm may result in deadlocks, since there is mutual exclusion of access to shared resources (data) and transactions may wait on locks. A deadlock can occur because transactions wait for one another. The deadlock problem in DDBSs is similar in nature to that encountered in operating systems. The competi tion among users for access to a set of resources (data, in this case) can result in deadlock if the synchronization mechanism is based on locking. The well known alternatives of prevention, avoidance and detection/recovery also apply to DDBSs.The goal of this study is to investigate the implementation issues of a centralized concurrency control algoithm based on two-phase locking for DDBMS on a single processer system, namely a personel computer, running under the DOS operating system. According to this algorithm, a single cite is delegated lock management responsibility. This means that only one site has a lock manager in distributed system. Before accessing data at any site, appropri ate locks must be obtained from the central lock manager. Altough there are several proposed locking based concurrency control algorithms, the basic one of them is choosen for this simulation. Because this algorithm is easily extend, for example, primary copy and distributed concurrency control algorithms. In primary copy two phase locking concurrency control algorithm, the only changes is that since every site has a lock manager, the primary copy locations have to be determined for each data item prior to sendidng a lock or unlock request to lock manager at a site. In a distributed two phase locking algorithm, if the database is not replicated, it degenerates into the primary copy two phase locking algorithm. XI
Benzer Tezler
- Dağıtılmış veritabanı sistemlerinde eşzamanlılık ve eşzamanlılık kontrolü
Başlık çevirisi yok
MOGAHED A. A. RASHED
Yüksek Lisans
Türkçe
1993
Bilgisayar Mühendisliği Bilimleri-Bilgisayar ve Kontrolİstanbul ÜniversitesiBilgisayar Mühendisliği Ana Bilim Dalı
DOÇ. DR. OYA KALIPSIZ
- İstemci/sunucu mimarisinde veritabanı uygulamaları
Database applications with client/server architecture
SERKAN YENİDOĞAN
Yüksek Lisans
Türkçe
1999
Bilgisayar Mühendisliği Bilimleri-Bilgisayar ve Kontrolİstanbul ÜniversitesiBilgisayar Bilimleri ve Mühendisliği Ana Bilim Dalı
YRD. DOÇ. DR. ZEYNEP ALTAN
- Blockchain-based secure management framework for unmanned vehicles, internet of things and aviation
İnsansız araçlar, nesnelerin interneti ve havacılık için blokzincir-tabanlı güvenli yönetim çerçevesi
OZAN ZORLU
Doktora
İngilizce
2024
Bilgisayar Mühendisliği Bilimleri-Bilgisayar ve KontrolHacettepe ÜniversitesiBilgisayar Mühendisliği Ana Bilim Dalı
DOÇ. DR. ADNAN ÖZSOY
- Applying blockchain in exchanging data
Veri transferinde blok zinciri uygulaması
RANEEM SEIRAWAN
Yüksek Lisans
İngilizce
2019
Bilgisayar Mühendisliği Bilimleri-Bilgisayar ve Kontrolİstanbul Teknik ÜniversitesiBilişim Uygulamaları Ana Bilim Dalı
DOÇ. DR. ENVER ÖZDEMİR
- Dynamic data replication and distribution in database systems
Veri tabanı sistemlerinde dinamik veri kopyalama ve dağıtımı
SAADI HAMAD THALIJ ALLUHAIBI
Doktora
İngilizce
2019
Bilgisayar Mühendisliği Bilimleri-Bilgisayar ve KontrolYıldız Teknik ÜniversitesiBilgisayar Mühendisliği Ana Bilim Dalı
Assoc. Prof. Dr. VELİ HAKKOYMAZ