{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T02:22:58Z","timestamp":1773886978534,"version":"3.50.1"},"reference-count":33,"publisher":"Association for Computing Machinery (ACM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2016,11]]},"abstract":"<jats:p>Transaction processing database management systems (DBMSs) are critical for today's data-intensive applications because they enable an organization to quickly ingest and query new information. Many of these applications exceed the capabilities of a single server, and thus their database has to be deployed in a distributed DBMS. The key factor affecting such a system's performance is how the database is partitioned. If the database is partitioned incorrectly, the number of distributed transactions can be high. These transactions have to synchronize their operations over the network, which is considerably slower and leads to poor performance. Previous work on elastic database repartitioning has focused on a certain class of applications whose database schema can be represented in a hierarchical tree structure. But many applications cannot be partitioned in this manner, and thus are subject to distributed transactions that impede their performance and scalability.<\/jats:p>\n          <jats:p>In this paper, we present a new on-line partitioning approach, called Clay, that supports both tree-based schemas and more complex \"general\" schemas with arbitrary foreign key relationships. Clay dynamically creates blocks of tuples to migrate among servers during repartitioning, placing no constraints on the schema but taking care to balance load and reduce the amount of data migrated. Clay achieves this goal by including in each block a set of hot tuples and other tuples co-accessed with these hot tuples. To evaluate our approach, we integrate Clay in a distributed, main-memory DBMS and show that it can generate partitioning schemes that enable the system to achieve up to 15\u00d7 better throughput and 99% lower latency than existing approaches.<\/jats:p>","DOI":"10.14778\/3025111.3025125","type":"journal-article","created":{"date-parts":[[2017,1,24]],"date-time":"2017-01-24T15:29:41Z","timestamp":1485271781000},"page":"445-456","source":"Crossref","is-referenced-by-count":80,"title":["Clay"],"prefix":"10.14778","volume":"10","author":[{"given":"Marco","family":"Serafini","sequence":"first","affiliation":[{"name":"Qatar Computing Research Institute - HBKU"}]},{"given":"Rebecca","family":"Taft","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology"}]},{"given":"Aaron J.","family":"Elmore","sequence":"additional","affiliation":[{"name":"University of Chicago"}]},{"given":"Andrew","family":"Pavlo","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}]},{"given":"Ashraf","family":"Aboulnaga","sequence":"additional","affiliation":[{"name":"Qatar Computing Research Institute - HBKU"}]},{"given":"Michael","family":"Stonebraker","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology"}]}],"member":"320","published-online":{"date-parts":[[2016,11]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"739","volume-title":"USENIX Symposium on Operating Systems Design and Implementation","author":"Adya A.","year":"2016","unstructured":"A. Adya , D. Myers , J. Howell , J. Elson , C. Meek , V. Khemani , S. Fulger , P. Gu , L. Bhuvanagiri , J. Hunter , : Auto-sharding for datacenter applications . In USENIX Symposium on Operating Systems Design and Implementation , pages 739 -- 753 , 2016 . A. Adya, D. Myers, J. Howell, J. Elson, C. Meek, V. Khemani, S. Fulger, P. Gu, L. Bhuvanagiri, J. Hunter, et al. Slicer: Auto-sharding for datacenter applications. In USENIX Symposium on Operating Systems Design and Implementation, pages 739--753, 2016."},{"key":"e_1_2_1_2_1","first-page":"223","volume-title":"Conference on Innovative Data Systems Research","author":"Baker J.","year":"2011","unstructured":"J. Baker , C. Bond , J. C. Corbett , J. Furman , A. Khorlin , J. Larson , J.-M. Leon , Y. Li , A. Lloyd , and V. Yushprakh . Megastore: Providing scalable, highly available storage for interactive services . In Conference on Innovative Data Systems Research , pages 223 -- 234 , 2011 . J. Baker, C. Bond, J. C. Corbett, J. Furman, A. Khorlin, J. Larson, J.-M. Leon, Y. Li, A. Lloyd, and V. Yushprakh. Megastore: Providing scalable, highly available storage for interactive services. In Conference on Innovative Data Systems Research, pages 223--234, 2011."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767935"},{"key":"e_1_2_1_4_1","first-page":"10","volume-title":"AAAI Conference on Web and Social Media","author":"Cha M.","year":"2010","unstructured":"M. Cha , H. Haddadi , F. Benevenuto , and P. K. Gummadi . Measuring user influence in twitter: The million follower fallacy . In AAAI Conference on Web and Social Media , pages 10 -- 17 , 2010 . M. Cha, H. Haddadi, F. Benevenuto, and P. K. Gummadi. Measuring user influence in twitter: The million follower fallacy. In AAAI Conference on Web and Social Media, pages 10--17, 2010."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920853"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2445583.2445588"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732240.2732246"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723726"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICAC.2015.42"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536336.2536342"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2523616.2525970"},{"key":"e_1_2_1_12_1","unstructured":"H-Store: A Next Generation OLTP DBMS. http:\/\/hstore.cs.brown.edu.  H-Store: A Next Generation OLTP DBMS. http:\/\/hstore.cs.brown.edu."},{"key":"e_1_2_1_13_1","first-page":"1313405","article-title":"Social networks that matter: Twitter under the microscope","author":"Huberman B. A.","year":"2008","unstructured":"B. A. Huberman , D. M. Romero , and F. Wu . Social networks that matter: Twitter under the microscope . SSRN 1313405 , 2008 . B. A. Huberman, D. M. Romero, and F. Wu. Social networks that matter: Twitter under the microscope. SSRN 1313405, 2008.","journal-title":"SSRN"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33500-6_5"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/1454159.1454211"},{"key":"e_1_2_1_16_1","unstructured":"G. Karypis and V. Kumar. Metis-unstructured graph partitioning and sparse matrix ordering system version 5.0. http:\/\/glaros.dtc.umn.edu\/gkhome\/metis\/metis\/overview.  G. Karypis and V. Kumar. Metis-unstructured graph partitioning and sparse matrix ordering system version 5.0. http:\/\/glaros.dtc.umn.edu\/gkhome\/metis\/metis\/overview."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816694"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113279"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498273"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989444"},{"key":"e_1_2_1_21_1","unstructured":"NuoDB. http:\/\/www.nuodb.com.  NuoDB. http:\/\/www.nuodb.com."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/2021017.2021019"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213844"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816692"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2452376.2452427"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2732979"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/IC2E.2014.97"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735508.2735514"},{"key":"e_1_2_1_29_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_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610532"},{"key":"e_1_2_1_31_1","first-page":"163","volume-title":"USENIX Conference on File and Storage Technologies","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 USENIX Conference on File and Storage Technologies , pages 163 -- 176 , 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 USENIX Conference on File and Storage Technologies, pages 163--176, 2011."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213895"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723718"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3025111.3025125","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:20:31Z","timestamp":1672222831000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3025111.3025125"}},"subtitle":["fine-grained adaptive partitioning for general database schemas"],"short-title":[],"issued":{"date-parts":[[2016,11]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["10.14778\/3025111.3025125"],"URL":"https:\/\/doi.org\/10.14778\/3025111.3025125","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2016,11]]}}}