{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T02:50:57Z","timestamp":1774320657437,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,5,27]],"date-time":"2018-05-27T00:00:00Z","timestamp":1527379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF IIS","award":["1253196."],"award-info":[{"award-number":["1253196."]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,5,27]]},"DOI":"10.1145\/3183713.3196935","type":"proceedings-article","created":{"date-parts":[[2018,5,25]],"date-time":"2018-05-25T12:39:28Z","timestamp":1527251968000},"page":"1253-1267","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["NashDB"],"prefix":"10.1145","author":[{"given":"Ryan","family":"Marcus","sequence":"first","affiliation":[{"name":"Brandeis University, Waltham, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olga","family":"Papaemmanouil","sequence":"additional","affiliation":[{"name":"Brandeis University, Waltham, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sofiya","family":"Semenova","sequence":"additional","affiliation":[{"name":"Brandeis University, Waltham, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Solomon","family":"Garber","sequence":"additional","affiliation":[{"name":"Brandeis University, Waltham, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,5,27]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Amazon EBS https:\/\/aws.amazon.com\/ebs\/.  Amazon EBS https:\/\/aws.amazon.com\/ebs\/."},{"key":"e_1_3_2_1_2_1","unstructured":"Amazon Web Services http:\/\/aws.amazon.com\/.  Amazon Web Services http:\/\/aws.amazon.com\/."},{"key":"e_1_3_2_1_3_1","unstructured":"Google Cloud Platform https:\/\/cloud.google.com\/.  Google Cloud Platform https:\/\/cloud.google.com\/."},{"key":"e_1_3_2_1_4_1","unstructured":"JGraphT http:\/\/jgrapht.org\/.  JGraphT http:\/\/jgrapht.org\/."},{"key":"e_1_3_2_1_5_1","unstructured":"Microsoft Azure Services http:\/\/www.microsoft.com\/azure\/.  Microsoft Azure Services http:\/\/www.microsoft.com\/azure\/."},{"key":"e_1_3_2_1_6_1","unstructured":"PostgreSQL database http:\/\/www.postgresql.org\/.  PostgreSQL database http:\/\/www.postgresql.org\/."},{"key":"e_1_3_2_1_7_1","unstructured":"The TPC-H benchmark http:\/\/www.tpc.org\/tpch\/.  The TPC-H benchmark http:\/\/www.tpc.org\/tpch\/."},{"key":"e_1_3_2_1_8_1","volume-title":"Soviet Mathematics '62","author":"Adelson-Velsky G.","unstructured":"Adelson-Velsky , G. , An algorithm for the organization of information . Soviet Mathematics '62 . Adelson-Velsky, G., et al. An algorithm for the organization of information. Soviet Mathematics '62."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486159.2486195"},{"key":"e_1_3_2_1_10_1","unstructured":"Breiman L. etal Classification and Regression Trees.  Breiman L. et al. Classification and Regression Trees."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/2002938.2002942"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920853"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2445583.2445588"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"e_1_3_2_1_15_1","volume-title":"A New Approach to Rectangle Intersections. Journal of Computer Math '83","author":"Edelsbrunner H.","unstructured":"Edelsbrunner , H. A New Approach to Rectangle Intersections. Journal of Computer Math '83 . Edelsbrunner, H. A New Approach to Rectangle Intersections. Journal of Computer Math '83."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723726"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.04.037"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1656274.1656278"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10619-010-7068-1"},{"key":"e_1_3_2_1_20_1","volume-title":"Optimal Histograms with Quality Guarantees. VLDB '98","author":"Jagadish H.","unstructured":"Jagadish , H. , Optimal Histograms with Quality Guarantees. VLDB '98 . Jagadish, H., et al. Optimal Histograms with Quality Guarantees. VLDB '98."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2391229.2391239"},{"key":"e_1_3_2_1_22_1","unstructured":"Konno H. etal Best piecewise constant approximation of a function of single variable.  Konno H. et al. Best piecewise constant approximation of a function of single variable."},{"key":"e_1_3_2_1_23_1","volume-title":"NRLQ '55","author":"Kuhn H. W.","unstructured":"Kuhn , H. W. The Hungarian method for the assignment problem . NRLQ '55 . Kuhn, H. W. The Hungarian method for the assignment problem. NRLQ '55."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-014-0362-1"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/2367502.2367518"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/CLOUD.2012.21"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2670979.2670988"},{"key":"e_1_3_2_1_28_1","volume-title":"Big Data '17","author":"Lolos K.","unstructured":"Lolos , K. , Elastic management of cloud applications using adaptive reinforcement learning . In Big Data '17 . Lolos, K., et al. Elastic management of cloud applications using adaptive reinforcement learning. In Big Data '17."},{"key":"e_1_3_2_1_29_1","volume-title":"Information Systems '17","author":"Mahlknecht G.","unstructured":"Mahlknecht , G. , A scalable dynamic programming scheme for the computation of optimal k -segments for ordered data . Information Systems '17 . Mahlknecht, G., et al. A scalable dynamic programming scheme for the computation of optimal k -segments for ordered data. Information Systems '17."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/2977797.2977804"},{"key":"e_1_3_2_1_31_1","volume-title":"ICDE '04","author":"McWherter D.","unstructured":"McWherter , D. , Priority mechanisms for OLTP and transactional Web applications . In ICDE '04 . McWherter, D., et al. Priority mechanisms for OLTP and transactional Web applications. In ICDE '04."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.963420"},{"key":"e_1_3_2_1_33_1","volume-title":"PNAS '50","author":"Nash J. F.","unstructured":"Nash , J. F. Equilibrium points in n-person games . PNAS '50 . Nash, J. F. Equilibrium points in n-person games. PNAS '50."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2899402"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522716"},{"key":"e_1_3_2_1_36_1","volume-title":"Scikit-learn: Machine Learning in Python. JMLR '11","author":"Pedregosa F.","unstructured":"Pedregosa , F. , Scikit-learn: Machine Learning in Python. JMLR '11 . Pedregosa, F., et al. Scikit-learn: Machine Learning in Python. JMLR '11."},{"key":"e_1_3_2_1_37_1","volume-title":"ICDEW '10","author":"Rogers J.","unstructured":"Rogers , J. , A generic auto-provisioning framework for cloud databases . In ICDEW '10 . Rogers, J., et al. A generic auto-provisioning framework for cloud databases. In ICDEW '10."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2732979"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/3025111.3025125"},{"key":"e_1_3_2_1_40_1","volume":"0","author":"Shachnai H.","unstructured":"Shachnai , H. , Polynomial time approximation schemes for class- constrained packing problems. J. of Scheduling ' 0 1. Shachnai, H., et al. Polynomial time approximation schemes for class- constrained packing problems. J. of Scheduling '01.","journal-title":"J. of Scheduling '"},{"key":"e_1_3_2_1_41_1","volume-title":"ICDE '96","author":"Sidell J.","unstructured":"Sidell , J. , Data replication in Mariposa . In ICDE '96 . Sidell, J., et al. Data replication in Mariposa. In ICDE '96."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735508.2735514"},{"key":"e_1_3_2_1_43_1","volume-title":"Networks '71","author":"Tomizawa N.","unstructured":"Tomizawa , N. On some techniques useful for solution of transportation network problems . Networks '71 . Tomizawa, N. On some techniques useful for solution of transportation network problems. Networks '71."},{"key":"e_1_3_2_1_44_1","volume-title":"Technometrics '62","author":"Welford B.","unstructured":"Welford , B. Note on a Method for Calculating Corrected Sums of Squares and Products . Technometrics '62 . Welford, B. Note on a Method for Calculating Corrected Sums of Squares and Products. Technometrics '62."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.01.001"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767928"}],"event":{"name":"SIGMOD\/PODS '18: International Conference on Management of Data","location":"Houston TX USA","acronym":"SIGMOD\/PODS '18","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2018 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3183713.3196935","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3183713.3196935","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:28Z","timestamp":1750208908000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3183713.3196935"}},"subtitle":["An End-to-End Economic Method for Elastic Database Fragmentation, Replication, and Provisioning"],"short-title":[],"issued":{"date-parts":[[2018,5,27]]},"references-count":46,"alternative-id":["10.1145\/3183713.3196935","10.1145\/3183713"],"URL":"https:\/\/doi.org\/10.1145\/3183713.3196935","relation":{},"subject":[],"published":{"date-parts":[[2018,5,27]]},"assertion":[{"value":"2018-05-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}