A reliable and consistent fully distributed database

This paper presents an integrated concurrency and recovery algorithm. Strict timestamp ordering was used for concurrency control and incremental log with immediate updates for recovery. Strict timestamp ordering delays each write operation on a data item until there is no active transaction that iss...

Full description

Saved in:
Bibliographic Details
Main Author: Claudio, Patricia Maria R.
Format: text
Language:English
Published: Animo Repository 1989
Subjects:
Online Access:https://animorepository.dlsu.edu.ph/etd_masteral/1228
https://animorepository.dlsu.edu.ph/cgi/viewcontent.cgi?article=8066&context=etd_masteral
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: De La Salle University
Language: English
id oai:animorepository.dlsu.edu.ph:etd_masteral-8066
record_format eprints
spelling oai:animorepository.dlsu.edu.ph:etd_masteral-80662022-05-26T06:42:12Z A reliable and consistent fully distributed database Claudio, Patricia Maria R. This paper presents an integrated concurrency and recovery algorithm. Strict timestamp ordering was used for concurrency control and incremental log with immediate updates for recovery. Strict timestamp ordering delays each write operation on a data item until there is no active transaction that issued a write on that file data. Reliability is achieved in the distributed database systems (DDBS) through replication and the recovery technique adopted. The algorithm allows a transaction to access any of the available copies of a data file. Since any copy of the data item can be accessed, data are available even in cases of site failures. The recovery technique ensures that each transaction would eventually terminate either by commiting or aborting. Moreover, it also takes care of restoring the database to a consistent state during recovery of a failed site. Consistency is achieved by controlling the accesses made to the database. This is solved by the concurrency control mechanism. Transaction restarts were minimized since strict timestamp ordering was used. The synchronization of the locals clocks was also included in the algorithm. The correctness of the algorithm was also proven and the message complexity of the algorithm was found to be of O (on), where a is a function of size of the queue used in the algorithm. A closed queueing network model was developed to evaluate the performance of the integrated algorithm. The performance measurements taken include response time, throughput and system utilization. The results indicate that the performance exhibited by the system is good even when subjected to heavy load. 1989-08-01T07:00:00Z text application/pdf https://animorepository.dlsu.edu.ph/etd_masteral/1228 https://animorepository.dlsu.edu.ph/cgi/viewcontent.cgi?article=8066&context=etd_masteral Master's Theses English Animo Repository Distributed databases Algorithms Computer Sciences Theory and Algorithms
institution De La Salle University
building De La Salle University Library
continent Asia
country Philippines
Philippines
content_provider De La Salle University Library
collection DLSU Institutional Repository
language English
topic Distributed databases
Algorithms
Computer Sciences
Theory and Algorithms
spellingShingle Distributed databases
Algorithms
Computer Sciences
Theory and Algorithms
Claudio, Patricia Maria R.
A reliable and consistent fully distributed database
description This paper presents an integrated concurrency and recovery algorithm. Strict timestamp ordering was used for concurrency control and incremental log with immediate updates for recovery. Strict timestamp ordering delays each write operation on a data item until there is no active transaction that issued a write on that file data. Reliability is achieved in the distributed database systems (DDBS) through replication and the recovery technique adopted. The algorithm allows a transaction to access any of the available copies of a data file. Since any copy of the data item can be accessed, data are available even in cases of site failures. The recovery technique ensures that each transaction would eventually terminate either by commiting or aborting. Moreover, it also takes care of restoring the database to a consistent state during recovery of a failed site. Consistency is achieved by controlling the accesses made to the database. This is solved by the concurrency control mechanism. Transaction restarts were minimized since strict timestamp ordering was used. The synchronization of the locals clocks was also included in the algorithm. The correctness of the algorithm was also proven and the message complexity of the algorithm was found to be of O (on), where a is a function of size of the queue used in the algorithm. A closed queueing network model was developed to evaluate the performance of the integrated algorithm. The performance measurements taken include response time, throughput and system utilization. The results indicate that the performance exhibited by the system is good even when subjected to heavy load.
format text
author Claudio, Patricia Maria R.
author_facet Claudio, Patricia Maria R.
author_sort Claudio, Patricia Maria R.
title A reliable and consistent fully distributed database
title_short A reliable and consistent fully distributed database
title_full A reliable and consistent fully distributed database
title_fullStr A reliable and consistent fully distributed database
title_full_unstemmed A reliable and consistent fully distributed database
title_sort reliable and consistent fully distributed database
publisher Animo Repository
publishDate 1989
url https://animorepository.dlsu.edu.ph/etd_masteral/1228
https://animorepository.dlsu.edu.ph/cgi/viewcontent.cgi?article=8066&context=etd_masteral
_version_ 1734392509233102848