The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Database High Availability: An Extended Survey
|
|
Author(s): Moh’d A. Radaideh (Abu Dhabi Police – Ministry of Interior, United Arab Emirates)and Hayder Al-Ameed (United Arab Emirates University, United Arab Emirates)
Copyright: 2007
Pages: 33
Source title:
Architecture of Reliable Web Applications Software
Source Author(s)/Editor(s): Moh’d A. Radaideh (Abu Dhab Police – Ministry of Interior, United Arab Emirates)and Hayder Al-Ameed (United Arab Emirates University, United Arab Emirates)
DOI: 10.4018/978-1-59904-183-4.ch001
Purchase
|
Abstract
With the advancement of computer technologies and the World Wide Web, there has been an explosion in the amount of available e-services, most of which represent database processing. Efficient and effective database performance tuning and high availability techniques should be employed to insure that all e-services remain reliable and available all times. To avoid the impacts of database downtime, many corporations have taken interest in database availability. The goal for some is to have continuous availability such that a database server never fails. Other companies require their content to be highly availabile. In such cases, short and planned downtimes would be allowed for maintenance purposes. This chapter is meant to present the definition, the background, and the typical measurement factors of high availability. It also demonstrates some approaches to minimize a database server’s shutdown time.
Related Content
|
Rachna Rana, Pankaj Bhambri.
© 2025.
30 pages.
|
|
Rachna Rana, Pankaj Bhambri.
© 2025.
42 pages.
|
|
Neeta Baporikar.
© 2025.
42 pages.
|
|
Ananya Pandey, Jipson Joseph, Manshu Goyal.
© 2025.
24 pages.
|
|
Usharani Bhimavarapu.
© 2025.
16 pages.
|
|
Supriya Dam.
© 2025.
32 pages.
|
|
Nina Lestari, Nur Azizah Wahyuni, Muhammad Younus, Andi Luhur Prianto, Aqmal Reza Amri, Ahmad Harakan, Achmad Nurmandi, Hajira Gul, Ibrahim Shah, Ihyani Malik.
© 2025.
32 pages.
|
|
|