Accordion

Elastic scalability for database systems supporting distributed transactions

Marco Serafini, Essam Mansour, Ashraf Aboulnaga, Kenneth Salem, Taha Rafiq, Umar Farooq Minhas

Research output: Chapter in Book/Report/Conference proceedingChapter

19 Citations (Scopus)

Abstract

Providing the ability to elastically use more or fewer servers on demand (scale out and scale in) as the load varies is essential for database management systems (DBMSes) deployed on today's distributed computing platforms, such as the cloud. This requires solving the problem of dynamic (online) data placement, which has so far been addressed only for workloads where all transactions are local to one sever. In DBMSes where ACID transactions can access more than one partition, distributed transactions represent a major performance bottleneck. Scaling out and spreading data across a larger number of servers does not necessarily result in a linear increase in the overall system throughput, because transactions that used to access only one server may become distributed. In this paper we present Accordion, a dynamic data placement system for partition-based DBMSes that support ACID transactions (local or distributed). It does so by explicitly considering the affinity between partitions, which indicates the frequency in which they are accessed together by the same transactions. Accordion estimates the capacity of a server by explicitly considering the impact of distributed transactions and affinity on the maximum throughput of the server. It then integrates this estimation in a mixed-integer linear program to explore the space of possible configurations and decide whether to scale out. We implemented Accordion and evaluated it using H-Store, a shared-nothing in-memory DBMS. Our results using the TPC-C and YCSB benchmarks show that Accordion achieves benefits compared to alternative heuristics of up to an order of magnitude reduction in the number of servers used and in the amount of data migrated.

Original languageEnglish
Title of host publicationProceedings of the VLDB Endowment
PublisherAssociation for Computing Machinery
Pages1035-1046
Number of pages12
Volume7
Edition12
Publication statusPublished - 2014

Fingerprint

Distributed database systems
Scalability
Servers
Throughput
Distributed computer systems
Data storage equipment

ASJC Scopus subject areas

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

Cite this

Serafini, M., Mansour, E., Aboulnaga, A., Salem, K., Rafiq, T., & Minhas, U. F. (2014). Accordion: Elastic scalability for database systems supporting distributed transactions. In Proceedings of the VLDB Endowment (12 ed., Vol. 7, pp. 1035-1046). Association for Computing Machinery.

Accordion : Elastic scalability for database systems supporting distributed transactions. / Serafini, Marco; Mansour, Essam; Aboulnaga, Ashraf; Salem, Kenneth; Rafiq, Taha; Minhas, Umar Farooq.

Proceedings of the VLDB Endowment. Vol. 7 12. ed. Association for Computing Machinery, 2014. p. 1035-1046.

Research output: Chapter in Book/Report/Conference proceedingChapter

Serafini, M, Mansour, E, Aboulnaga, A, Salem, K, Rafiq, T & Minhas, UF 2014, Accordion: Elastic scalability for database systems supporting distributed transactions. in Proceedings of the VLDB Endowment. 12 edn, vol. 7, Association for Computing Machinery, pp. 1035-1046.
Serafini M, Mansour E, Aboulnaga A, Salem K, Rafiq T, Minhas UF. Accordion: Elastic scalability for database systems supporting distributed transactions. In Proceedings of the VLDB Endowment. 12 ed. Vol. 7. Association for Computing Machinery. 2014. p. 1035-1046
Serafini, Marco ; Mansour, Essam ; Aboulnaga, Ashraf ; Salem, Kenneth ; Rafiq, Taha ; Minhas, Umar Farooq. / Accordion : Elastic scalability for database systems supporting distributed transactions. Proceedings of the VLDB Endowment. Vol. 7 12. ed. Association for Computing Machinery, 2014. pp. 1035-1046
@inbook{712117db3d1d4a53997e8f7f261076c2,
title = "Accordion: Elastic scalability for database systems supporting distributed transactions",
abstract = "Providing the ability to elastically use more or fewer servers on demand (scale out and scale in) as the load varies is essential for database management systems (DBMSes) deployed on today's distributed computing platforms, such as the cloud. This requires solving the problem of dynamic (online) data placement, which has so far been addressed only for workloads where all transactions are local to one sever. In DBMSes where ACID transactions can access more than one partition, distributed transactions represent a major performance bottleneck. Scaling out and spreading data across a larger number of servers does not necessarily result in a linear increase in the overall system throughput, because transactions that used to access only one server may become distributed. In this paper we present Accordion, a dynamic data placement system for partition-based DBMSes that support ACID transactions (local or distributed). It does so by explicitly considering the affinity between partitions, which indicates the frequency in which they are accessed together by the same transactions. Accordion estimates the capacity of a server by explicitly considering the impact of distributed transactions and affinity on the maximum throughput of the server. It then integrates this estimation in a mixed-integer linear program to explore the space of possible configurations and decide whether to scale out. We implemented Accordion and evaluated it using H-Store, a shared-nothing in-memory DBMS. Our results using the TPC-C and YCSB benchmarks show that Accordion achieves benefits compared to alternative heuristics of up to an order of magnitude reduction in the number of servers used and in the amount of data migrated.",
author = "Marco Serafini and Essam Mansour and Ashraf Aboulnaga and Kenneth Salem and Taha Rafiq and Minhas, {Umar Farooq}",
year = "2014",
language = "English",
volume = "7",
pages = "1035--1046",
booktitle = "Proceedings of the VLDB Endowment",
publisher = "Association for Computing Machinery",
edition = "12",

}

TY - CHAP

T1 - Accordion

T2 - Elastic scalability for database systems supporting distributed transactions

AU - Serafini, Marco

AU - Mansour, Essam

AU - Aboulnaga, Ashraf

AU - Salem, Kenneth

AU - Rafiq, Taha

AU - Minhas, Umar Farooq

PY - 2014

Y1 - 2014

N2 - Providing the ability to elastically use more or fewer servers on demand (scale out and scale in) as the load varies is essential for database management systems (DBMSes) deployed on today's distributed computing platforms, such as the cloud. This requires solving the problem of dynamic (online) data placement, which has so far been addressed only for workloads where all transactions are local to one sever. In DBMSes where ACID transactions can access more than one partition, distributed transactions represent a major performance bottleneck. Scaling out and spreading data across a larger number of servers does not necessarily result in a linear increase in the overall system throughput, because transactions that used to access only one server may become distributed. In this paper we present Accordion, a dynamic data placement system for partition-based DBMSes that support ACID transactions (local or distributed). It does so by explicitly considering the affinity between partitions, which indicates the frequency in which they are accessed together by the same transactions. Accordion estimates the capacity of a server by explicitly considering the impact of distributed transactions and affinity on the maximum throughput of the server. It then integrates this estimation in a mixed-integer linear program to explore the space of possible configurations and decide whether to scale out. We implemented Accordion and evaluated it using H-Store, a shared-nothing in-memory DBMS. Our results using the TPC-C and YCSB benchmarks show that Accordion achieves benefits compared to alternative heuristics of up to an order of magnitude reduction in the number of servers used and in the amount of data migrated.

AB - Providing the ability to elastically use more or fewer servers on demand (scale out and scale in) as the load varies is essential for database management systems (DBMSes) deployed on today's distributed computing platforms, such as the cloud. This requires solving the problem of dynamic (online) data placement, which has so far been addressed only for workloads where all transactions are local to one sever. In DBMSes where ACID transactions can access more than one partition, distributed transactions represent a major performance bottleneck. Scaling out and spreading data across a larger number of servers does not necessarily result in a linear increase in the overall system throughput, because transactions that used to access only one server may become distributed. In this paper we present Accordion, a dynamic data placement system for partition-based DBMSes that support ACID transactions (local or distributed). It does so by explicitly considering the affinity between partitions, which indicates the frequency in which they are accessed together by the same transactions. Accordion estimates the capacity of a server by explicitly considering the impact of distributed transactions and affinity on the maximum throughput of the server. It then integrates this estimation in a mixed-integer linear program to explore the space of possible configurations and decide whether to scale out. We implemented Accordion and evaluated it using H-Store, a shared-nothing in-memory DBMS. Our results using the TPC-C and YCSB benchmarks show that Accordion achieves benefits compared to alternative heuristics of up to an order of magnitude reduction in the number of servers used and in the amount of data migrated.

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

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

M3 - Chapter

VL - 7

SP - 1035

EP - 1046

BT - Proceedings of the VLDB Endowment

PB - Association for Computing Machinery

ER -