{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:35:14Z","timestamp":1750307714989,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,3,23]],"date-time":"2009-03-23T00:00:00Z","timestamp":1237766400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["IIS-0534389IIS-0534389"],"award-info":[{"award-number":["IIS-0534389IIS-0534389"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,3,23]]},"DOI":"10.1145\/1514894.1514907","type":"proceedings-article","created":{"date-parts":[[2009,4,6]],"date-time":"2009-04-06T16:34:53Z","timestamp":1239035693000},"page":"98-110","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Optimal splitters for database partitioning with size bounds"],"prefix":"10.1145","author":[{"given":"Kenneth A.","family":"Ross","sequence":"first","affiliation":[{"name":"Columbia University, New York, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Cieslewicz","sequence":"additional","affiliation":[{"name":"Columbia University, New York, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,3,23]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"COMAD","author":"Agrawal R.","year":"1995","unstructured":"R. Agrawal and A. Swami . A one-pass space-efficient algorithm for finding quantiles . In COMAD , 1995 . R. Agrawal and A. Swami. A one-pass space-efficient algorithm for finding quantiles. In COMAD, 1995."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/275487.275492"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/382009.383693"},{"key":"e_1_3_2_1_4_1","first-page":"27","volume-title":"VLDB","author":"DeWitt D. J.","year":"1992","unstructured":"D. J. DeWitt , J. F. Naughton , D. A. Schneider , and S. Seshadri . Practical skew handling in parallel joins . In VLDB , pages 27 -- 40 , 1992 . D. J. DeWitt, J. F. Naughton, D. A. Schneider, and S. Seshadri. Practical skew handling in parallel joins. In VLDB, pages 27--40, 1992."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/HOTCHIPS.2006.7477876"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/280277.280279"},{"key":"e_1_3_2_1_7_1","first-page":"481","volume-title":"VLDB","author":"Ghandeharizadeh S.","year":"1990","unstructured":"S. Ghandeharizadeh and D. J. DeWitt . Hybrid-range partitioning strategy: A new declustering strategy for multiprocessor database machines . In VLDB , pages 481 -- 492 , 1990 . S. Ghandeharizadeh and D. J. DeWitt. Hybrid-range partitioning strategy: A new declustering strategy for multiprocessor database machines. In VLDB, pages 481--492, 1990."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/191839.191886"},{"key":"e_1_3_2_1_9_1","first-page":"92","volume-title":"Applied Computing","author":"Gurajada A. P.","year":"1991","unstructured":"A. P. Gurajada and J. Srivastava . Equidepth partitioning of a data set based on finding its medians . In Applied Computing , pages 92 -- 101 , 1991 . A. P. Gurajada and J. Srivastava. Equidepth partitioning of a data set based on finding its medians. In Applied Computing, pages 92--101, 1991."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/645480.655440"},{"key":"e_1_3_2_1_11_1","first-page":"525","volume-title":"VLDB","author":"Hua K. A.","year":"1991","unstructured":"K. A. Hua and C. Lee . Handling data skew in multiprocessor database computers using partition tuning . In VLDB , pages 525 -- 535 , 1991 . K. A. Hua and C. Lee. Handling data skew in multiprocessor database computers using partition tuning. In VLDB, pages 525--535, 1991."},{"key":"e_1_3_2_1_12_1","first-page":"627","volume-title":"Proc. of Symposium on Parallel Algorithms and Architectures","author":"Huang J.","year":"1983","unstructured":"J. Huang and Y. Chow . Parallel sorting and data partitioning by sampling . In Proc. of Symposium on Parallel Algorithms and Architectures , pages 627 -- 631 , 1983 . J. Huang and Y. Chow. Parallel sorting and data partitioning by sampling. In Proc. of Symposium on Parallel Algorithms and Architectures, pages 627--631, 1983."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1315451.1315455"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223841"},{"key":"e_1_3_2_1_15_1","first-page":"174","volume-title":"VLDB","author":"Ioannidis Y. E.","year":"1999","unstructured":"Y. E. Ioannidis and V. Poosala . Histogram-based approximation of set-valued query-answers . In VLDB , pages 174 -- 185 , 1999 . Y. E. Ioannidis and V. Poosala. Histogram-based approximation of set-valued query-answers. In VLDB, pages 174--185, 1999."},{"key":"e_1_3_2_1_16_1","first-page":"135","volume-title":"VLDB","author":"Iyer B. R.","year":"1989","unstructured":"B. R. Iyer Percentile finding algorithm for multiple sorted runs . In VLDB , pages 135 -- 144 , 1989 . B. R. Iyer et al. Percentile finding algorithm for multiple sorted runs. In VLDB, pages 135--144, 1989."},{"key":"e_1_3_2_1_17_1","first-page":"275","volume-title":"VLDB","author":"Jagadish H. V.","year":"1998","unstructured":"H. V. Jagadish , N. Koudas , S. Muthukrishnan , V. Poosala , K. C. Sevcik , and T. Suel . Optimal histograms with quality guarantees . In VLDB , pages 275 -- 286 , 1998 . H. V. Jagadish, N. Koudas, S. Muthukrishnan, V. Poosala, K. C. Sevcik, and T. Suel. Optimal histograms with quality guarantees. In VLDB, pages 275--286, 1998."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/646251.685987"},{"key":"e_1_3_2_1_19_1","first-page":"210","volume-title":"VLDB","author":"Kitsuregawa M.","year":"1990","unstructured":"M. Kitsuregawa and Y. Ogawa . Bucket spreading parallel hash: A new, robust, parallel hash join method for data skew in the super database computer (sdc) . In VLDB , pages 210 -- 221 , 1990 . M. Kitsuregawa and Y. Ogawa. Bucket spreading parallel hash: A new, robust, parallel hash join method for data skew in the super database computer (sdc). In VLDB, pages 210--221, 1990."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276342"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700382108"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-024X(199708)27:8%3C983::AID-SPE117%3E3.0.CO;2-#"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/645503.656259"},{"key":"e_1_3_2_1_24_1","first-page":"448","volume-title":"VLDB","author":"Poosala V.","year":"1996","unstructured":"V. Poosala and Y. E. Ioannidis . Estimation of query-result distribution and its application in parallel-join load balancing . In VLDB , pages 448 -- 459 , 1996 . V. Poosala and Y. E. Ioannidis. Estimation of query-result distribution and its application in parallel-join load balancing. In VLDB, pages 448--459, 1996."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/233269.233342"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30140-0_69"},{"key":"e_1_3_2_1_27_1","first-page":"553","volume-title":"VLDB","author":"Stonebraker M.","year":"2005","unstructured":"M. Stonebraker , D. J. Abadi , A. Batkin , X. Chen , M. Cherniack , M. Ferreira , E. Lau , A. Lin , S. Madden , E. J. O'Neil , P. E. O'Neil , A. Rasin , N. Tran , and S. B. Zdonik . C-store: A column-oriented DBMS . In VLDB , pages 553 -- 564 , 2005 . M. Stonebraker, D. J. Abadi, A. Batkin, X. Chen, M. Cherniack, M. Ferreira, E. Lau, A. Lin, S. Madden, E. J. O'Neil, P. E. O'Neil, A. Rasin, N. Tran, and S. B. Zdonik. C-store: A column-oriented DBMS. In VLDB, pages 553--564, 2005."}],"event":{"name":"EDBT\/ICDT '09: EDBT\/ICDT '09 joint conference","acronym":"EDBT\/ICDT '09","location":"St. Petersburg Russia"},"container-title":["Proceedings of the 12th International Conference on Database Theory"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1514894.1514907","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1514894.1514907","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:30:20Z","timestamp":1750253420000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1514894.1514907"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3,23]]},"references-count":27,"alternative-id":["10.1145\/1514894.1514907","10.1145\/1514894"],"URL":"https:\/\/doi.org\/10.1145\/1514894.1514907","relation":{},"subject":[],"published":{"date-parts":[[2009,3,23]]},"assertion":[{"value":"2009-03-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}