{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:51:49Z","timestamp":1725558709388},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540242888"},{"type":"electronic","value":"9783540305705"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30570-5_13","type":"book-chapter","created":{"date-parts":[[2010,7,4]],"date-time":"2010-07-04T14:38:07Z","timestamp":1278254287000},"page":"189-203","source":"Crossref","is-referenced-by-count":2,"title":["Algorithms for the Database Layout Problem"],"prefix":"10.1007","author":[{"given":"Gagan","family":"Aggarwal","sequence":"first","affiliation":[]},{"given":"Tom\u00e1s","family":"Feder","sequence":"additional","affiliation":[]},{"given":"Rajeev","family":"Motwani","sequence":"additional","affiliation":[]},{"given":"Rina","family":"Panigrahy","sequence":"additional","affiliation":[]},{"given":"An","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","unstructured":"Agrawal, S., Chaudhuri, S., Das, A., Narasayya, V.: Automating Layout of Relational Databases. In: Proceedings of 19th International Conference on Data Engineering, pp. 607\u2013618 (2003)"},{"key":"13_CR2","unstructured":"The AutoAdmin Project, \n                    \n                      research.microsoft.com\/dmx\/AutoAdmin"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Copeland, G., Alexander, W., Boughter, E., Keller, T.: Data Placement in Bubba. In: Proceedings of SIGMOD Conference, pp. 99\u2013108 (1988)","DOI":"10.1145\/50202.50213"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Dewan, H., Hernandez, M., Mok, K., Stolfo, S.: Predictive Dynamic Load Balancing of Parallel Hash-Joins Over Heterogeneous Processors in the Presence of Data Skew. In: Proceedings of PDIS, pp. 40\u201349 (1994)","DOI":"10.1109\/PDIS.1994.331734"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Garg, N., Vazirani, V.V., Yannakakis, M.: Multiway cuts in directed and node weighted graphs. In: Proceedings of 21st International Colloquium on Automata, Languages and Programming, pp. 487\u2013498 (1994)","DOI":"10.1007\/3-540-58201-0_92"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Kann, V., Khanna, S., Lagergren, J., Panconesi, A.: On the Hardness of Approximating Max k-Cut and its dual. Chicago Journal of Theoretical Computer Science (1997)","DOI":"10.4086\/cjtcs.1997.002"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Lee, M., Kitsuregawa, M., Ooi, B., Tan, K., Mondal, A.: Towards Self-Tuning Data Placement in Parallel Database Systems. In: Proceedings of SIGMOD Conference, pp. 225\u2013236 (2000)","DOI":"10.1145\/342009.335416"},{"key":"13_CR8","unstructured":"Lee, L., Scheuermann, P., Vingralek, R.: File Assignment in Parallel I\/O Systems with Minimum Variance and Service Time. IEEE Transactions on Computers (1998)"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Petrank, E.: The Hardness Of Approximation: Gap Location. In: Israel Symposium on Theory of Computing Systems, pp. 275\u2013284 (1993)","DOI":"10.1109\/ISTCS.1993.253461"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/s007780050053","volume":"7","author":"P. Scheuermann","year":"1998","unstructured":"Scheuermann, P., Weikum, G., Zabback, P.: Data Partitioning and Load Balancing in Parallel Disk Systems. The VLDB Journal\u00a07, 48\u201366 (1998)","journal-title":"The VLDB Journal"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1023\/A:1008609030195","volume":"6","author":"R. Vingralek","year":"1998","unstructured":"Vingralek, R., Breitbart, Y., Weikum, G.: SNOWBALL: Scalable Storage on Networks of Workstations with Balanced Load. Distributed and Parallel Databases\u00a06, 117\u2013158 (1998)","journal-title":"Distributed and Parallel Databases"}],"container-title":["Lecture Notes in Computer Science","Database Theory - ICDT 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30570-5_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:30:44Z","timestamp":1619998244000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30570-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540242888","9783540305705"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30570-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}