Login | Register

High availability solution for a transactional database system

Title:

High availability solution for a transactional database system

Radulescu, Steluta Budrean (2002) High availability solution for a transactional database system. Masters thesis, Concordia University.

[thumbnail of MQ68528.pdf]
Preview
Text (application/pdf)
MQ68528.pdf
2MB

Abstract

In our increasingly wired world, there is stringent need for the IT community to provide uninterrupted services of networks, servers and databases. Considerable efforts, both by industrial and academic communities have been directed to this end. In this project, we examine the requirements for high availability, the measures used to express it, and the approaches used to implement this for databases. The purpose of this project is to present a high availability solution, using off-the-shelf hardware and software components, for fast fallback and restart in a fast changing transaction-based application. The approach uses synchronous replication, which, in case of a failure, is able to resynchronize the databases without shutting down the system.

Divisions:Concordia University > Gina Cody School of Engineering and Computer Science > Computer Science and Software Engineering
Item Type:Thesis (Masters)
Authors:Radulescu, Steluta Budrean
Pagination:vii, 91 leaves : ill. ; 29 cm.
Institution:Concordia University
Degree Name:M. Comp. Sc.
Program:Computer Science and Software Engineering
Date:2002
Thesis Supervisor(s):Desai, Bipin C.
Identification Number:QA 76.545 R33 2002
ID Code:1722
Deposited By: Concordia University Library
Deposited On:27 Aug 2009 17:21
Last Modified:13 Jul 2020 19:50
Related URLs:
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.

Repository Staff Only: item control page

Downloads per month over past year

Research related to the current document (at the CORE website)
- Research related to the current document (at the CORE website)
Back to top Back to top