RemusDB

Transparent high availability for database systems

Umar Farooq Minhas, Shriram Rajagopalan, Brendan Cully, Ashraf Aboulnaga, Kenneth Salem, Andrew Warfield

Research output: Chapter in Book/Report/Conference proceedingChapter

22 Citations (Scopus)

Abstract

In this paper we present a technique for building a high-availability (HA) database management system (DBMS). The proposed technique can be applied to any DBMS with little or no customization, and with reasonable performance overhead. Our approach is based on Remus, a commodity HA solution implemented in the virtualization layer, that uses asynchronous virtual machine (VM) state replication to provide transparent HA and failover capabilities. We show that while Remus and similar systems can protect a DBMS, database workloads incur a performance overhead of up to 32% as compared to an unprotected DBMS. We identify the sources of this overhead and develop optimizations that mitigate the problems. We present an experimental evaluation using two popular database systems and industry standard benchmarks showing that for certain workloads, our optimized approach provides very fast failover (≤ 3 seconds of downtime) with low performance overhead when compared to an unprotected DBMS. Our approach provides a practical means for existing, deployed database systems to be made more reliable with a minimum of risk, cost, and effort. Furthermore, this paper invites new discussion about whether the complexity of HA is best implemented within the DBMS, or as a service by the infrastructure below it.

Original languageEnglish
Title of host publicationProceedings of the VLDB Endowment
Pages737-748
Number of pages12
Volume4
Edition11
Publication statusPublished - Aug 2011
Externally publishedYes

Fingerprint

Availability
Costs
Industry

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Computer Science(all)

Cite this

Minhas, U. F., Rajagopalan, S., Cully, B., Aboulnaga, A., Salem, K., & Warfield, A. (2011). RemusDB: Transparent high availability for database systems. In Proceedings of the VLDB Endowment (11 ed., Vol. 4, pp. 737-748)

RemusDB : Transparent high availability for database systems. / Minhas, Umar Farooq; Rajagopalan, Shriram; Cully, Brendan; Aboulnaga, Ashraf; Salem, Kenneth; Warfield, Andrew.

Proceedings of the VLDB Endowment. Vol. 4 11. ed. 2011. p. 737-748.

Research output: Chapter in Book/Report/Conference proceedingChapter

Minhas, UF, Rajagopalan, S, Cully, B, Aboulnaga, A, Salem, K & Warfield, A 2011, RemusDB: Transparent high availability for database systems. in Proceedings of the VLDB Endowment. 11 edn, vol. 4, pp. 737-748.
Minhas UF, Rajagopalan S, Cully B, Aboulnaga A, Salem K, Warfield A. RemusDB: Transparent high availability for database systems. In Proceedings of the VLDB Endowment. 11 ed. Vol. 4. 2011. p. 737-748
Minhas, Umar Farooq ; Rajagopalan, Shriram ; Cully, Brendan ; Aboulnaga, Ashraf ; Salem, Kenneth ; Warfield, Andrew. / RemusDB : Transparent high availability for database systems. Proceedings of the VLDB Endowment. Vol. 4 11. ed. 2011. pp. 737-748
@inbook{51b8112e52644a23ab443fd9f075ac6d,
title = "RemusDB: Transparent high availability for database systems",
abstract = "In this paper we present a technique for building a high-availability (HA) database management system (DBMS). The proposed technique can be applied to any DBMS with little or no customization, and with reasonable performance overhead. Our approach is based on Remus, a commodity HA solution implemented in the virtualization layer, that uses asynchronous virtual machine (VM) state replication to provide transparent HA and failover capabilities. We show that while Remus and similar systems can protect a DBMS, database workloads incur a performance overhead of up to 32{\%} as compared to an unprotected DBMS. We identify the sources of this overhead and develop optimizations that mitigate the problems. We present an experimental evaluation using two popular database systems and industry standard benchmarks showing that for certain workloads, our optimized approach provides very fast failover (≤ 3 seconds of downtime) with low performance overhead when compared to an unprotected DBMS. Our approach provides a practical means for existing, deployed database systems to be made more reliable with a minimum of risk, cost, and effort. Furthermore, this paper invites new discussion about whether the complexity of HA is best implemented within the DBMS, or as a service by the infrastructure below it.",
author = "Minhas, {Umar Farooq} and Shriram Rajagopalan and Brendan Cully and Ashraf Aboulnaga and Kenneth Salem and Andrew Warfield",
year = "2011",
month = "8",
language = "English",
volume = "4",
pages = "737--748",
booktitle = "Proceedings of the VLDB Endowment",
edition = "11",

}

TY - CHAP

T1 - RemusDB

T2 - Transparent high availability for database systems

AU - Minhas, Umar Farooq

AU - Rajagopalan, Shriram

AU - Cully, Brendan

AU - Aboulnaga, Ashraf

AU - Salem, Kenneth

AU - Warfield, Andrew

PY - 2011/8

Y1 - 2011/8

N2 - In this paper we present a technique for building a high-availability (HA) database management system (DBMS). The proposed technique can be applied to any DBMS with little or no customization, and with reasonable performance overhead. Our approach is based on Remus, a commodity HA solution implemented in the virtualization layer, that uses asynchronous virtual machine (VM) state replication to provide transparent HA and failover capabilities. We show that while Remus and similar systems can protect a DBMS, database workloads incur a performance overhead of up to 32% as compared to an unprotected DBMS. We identify the sources of this overhead and develop optimizations that mitigate the problems. We present an experimental evaluation using two popular database systems and industry standard benchmarks showing that for certain workloads, our optimized approach provides very fast failover (≤ 3 seconds of downtime) with low performance overhead when compared to an unprotected DBMS. Our approach provides a practical means for existing, deployed database systems to be made more reliable with a minimum of risk, cost, and effort. Furthermore, this paper invites new discussion about whether the complexity of HA is best implemented within the DBMS, or as a service by the infrastructure below it.

AB - In this paper we present a technique for building a high-availability (HA) database management system (DBMS). The proposed technique can be applied to any DBMS with little or no customization, and with reasonable performance overhead. Our approach is based on Remus, a commodity HA solution implemented in the virtualization layer, that uses asynchronous virtual machine (VM) state replication to provide transparent HA and failover capabilities. We show that while Remus and similar systems can protect a DBMS, database workloads incur a performance overhead of up to 32% as compared to an unprotected DBMS. We identify the sources of this overhead and develop optimizations that mitigate the problems. We present an experimental evaluation using two popular database systems and industry standard benchmarks showing that for certain workloads, our optimized approach provides very fast failover (≤ 3 seconds of downtime) with low performance overhead when compared to an unprotected DBMS. Our approach provides a practical means for existing, deployed database systems to be made more reliable with a minimum of risk, cost, and effort. Furthermore, this paper invites new discussion about whether the complexity of HA is best implemented within the DBMS, or as a service by the infrastructure below it.

UR - http://www.scopus.com/inward/record.url?scp=84858761980&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84858761980&partnerID=8YFLogxK

M3 - Chapter

VL - 4

SP - 737

EP - 748

BT - Proceedings of the VLDB Endowment

ER -