{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:33:09Z","timestamp":1759336389790},"reference-count":26,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2014,8]]},"abstract":"<jats:p>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.<\/jats:p>\n          <jats:p>\n            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\n            <jats:italic>affinity<\/jats:italic>\n            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.\n          <\/jats:p>","DOI":"10.14778\/2732977.2732979","type":"journal-article","created":{"date-parts":[[2015,5,12]],"date-time":"2015-05-12T15:37:52Z","timestamp":1431445072000},"page":"1035-1046","source":"Crossref","is-referenced-by-count":39,"title":["Accordion"],"prefix":"10.14778","volume":"7","author":[{"given":"Marco","family":"Serafini","sequence":"first","affiliation":[{"name":"Qatar Computing Research Institute"}]},{"given":"Essam","family":"Mansour","sequence":"additional","affiliation":[{"name":"Qatar Computing Research Institute"}]},{"given":"Ashraf","family":"Aboulnaga","sequence":"additional","affiliation":[{"name":"Qatar Computing Research Institute"}]},{"given":"Kenneth","family":"Salem","sequence":"additional","affiliation":[{"name":"University of Waterloo"}]},{"given":"Taha","family":"Rafiq","sequence":"additional","affiliation":[{"name":"Amazon.com"}]},{"given":"Umar Farooq","family":"Minhas","sequence":"additional","affiliation":[{"name":"IBM Research Almaden"}]}],"member":"320","published-online":{"date-parts":[[2014,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/44498.45063"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2588562"},{"key":"e_1_2_1_3_1","volume-title":"Proc. Conf. on Innovative Data Systems Research (CIDR)","author":"Baker J.","year":"2011","unstructured":"J. Baker , C. Bond , J. Corbett , J. Furman , A. Khorlin , J. Larson , J.-M. L\u00e9on , Y. Li , A. Lloyd , and V. Yushprakh . Megastore: Providing scalable, highly available storage for interactive services . In Proc. Conf. on Innovative Data Systems Research (CIDR) , 2011 . J. Baker, C. Bond, J. Corbett, J. Furman, A. Khorlin, J. Larson, J.-M. L\u00e9on, Y. Li, A. Lloyd, and V. Yushprakh. Megastore: Providing scalable, highly available storage for interactive services. In Proc. Conf. on Innovative Data Systems Research (CIDR), 2011."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807152"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/50202.50213"},{"key":"e_1_2_1_6_1","volume-title":"Proc. Symposium on Operating Systems Design and Implementation (OSDI)","author":"Corbett J. C.","year":"2012","unstructured":"J. C. Corbett , J. Dean , M. Epstein , A. Fikes , C. Frost , J. Furman , S. Ghemawat , A. Gubarev , C. Heiser , P. Hochschild , : Googles globally-distributed database . In Proc. Symposium on Operating Systems Design and Implementation (OSDI) , 2012 . J. C. Corbett, J. Dean, M. Epstein, A. Fikes, C. Frost, J. Furman, S. Ghemawat, A. Gubarev, C. Heiser, P. Hochschild, et al. Spanner: Googles globally-distributed database. In Proc. Symposium on Operating Systems Design and Implementation (OSDI), 2012."},{"key":"e_1_2_1_7_1","volume-title":"Proc. USENIX Annual Technical Conf. (ATC)","author":"Cowling J.","year":"2012","unstructured":"J. Cowling and B. Liskov . Granola: low-overhead distributed transaction coordination . In Proc. USENIX Annual Technical Conf. (ATC) , 2012 . J. Cowling and B. Liskov. Granola: low-overhead distributed transaction coordination. In Proc. USENIX Annual Technical Conf. (ATC), 2012."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920853"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989357"},{"key":"e_1_2_1_10_1","volume-title":"Proc. HotCloud","author":"Das S.","year":"2009","unstructured":"S. Das , D. Agrawal , and A. El Abbadi . ElasTraS: an elastic transactional data store in the cloud . In Proc. HotCloud , 2009 . S. Das, D. Agrawal, and A. El Abbadi. ElasTraS: an elastic transactional data store in the cloud. In Proc. HotCloud, 2009."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/2002974.2002977"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989356"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465308"},{"key":"e_1_2_1_14_1","volume-title":"Proc. Int. Conf. on Very Large Data Bases (VLDB)","author":"Hua K. A.","year":"1990","unstructured":"K. A. Hua and C. Lee . An adaptive data placement scheme for parallel database computer systems . In Proc. Int. Conf. on Very Large Data Bases (VLDB) , 1990 . K. A. Hua and C. Lee. An adaptive data placement scheme for parallel database computer systems. In Proc. Int. Conf. on Very Large Data Bases (VLDB), 1990."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/1454159.1454211"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544906"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007780050033"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDEW.2012.52"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2467800"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213844"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/645911.673623"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465302"},{"key":"e_1_2_1_23_1","volume-title":"Proc. Int. Conf. on Very Large Data Bases (VLDB)","author":"Stonebraker M.","year":"2007","unstructured":"M. Stonebraker , S. Madden , D. J. Abadi , S. Harizopoulos , N. Hachem , and P. Helland . The end of an architectural era:(it's time for a complete rewrite) . In Proc. Int. Conf. on Very Large Data Bases (VLDB) , 2007 . M. Stonebraker, S. Madden, D. J. Abadi, S. Harizopoulos, N. Hachem, and P. Helland. The end of an architectural era:(it's time for a complete rewrite). In Proc. Int. Conf. on Very Large Data Bases (VLDB), 2007."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213838"},{"key":"e_1_2_1_25_1","unstructured":"The TPC-C Benchmark 1992. http:\/\/www.tpc.org\/tpcc\/.  The TPC-C Benchmark 1992. http:\/\/www.tpc.org\/tpcc\/."},{"key":"e_1_2_1_26_1","volume-title":"Proc. of USENIX Conf. on File and Storage Technologies (FAST)","author":"Trushkowsky B.","year":"2011","unstructured":"B. Trushkowsky , P. Bod\u00edk , A. Fox , M. J. Franklin , M. I. Jordan , and D. A. Patterson . The SCADS director: scaling a distributed storage system under stringent performance requirements . In Proc. of USENIX Conf. on File and Storage Technologies (FAST) , 2011 . B. Trushkowsky, P. Bod\u00edk, A. Fox, M. J. Franklin, M. I. Jordan, and D. A. Patterson. The SCADS director: scaling a distributed storage system under stringent performance requirements. In Proc. of USENIX Conf. on File and Storage Technologies (FAST), 2011."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2732977.2732979","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T11:20:03Z","timestamp":1672226403000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2732977.2732979"}},"subtitle":["elastic scalability for database systems supporting distributed transactions"],"short-title":[],"issued":{"date-parts":[[2014,8]]},"references-count":26,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["10.14778\/2732977.2732979"],"URL":"https:\/\/doi.org\/10.14778\/2732977.2732979","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2014,8]]}}}