{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:12:00Z","timestamp":1763467920520,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,6,29]],"date-time":"2009-06-29T00:00:00Z","timestamp":1246233600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,6,29]]},"DOI":"10.1145\/1559845.1559873","type":"proceedings-article","created":{"date-parts":[[2009,7,8]],"date-time":"2009-07-08T17:34:19Z","timestamp":1247074459000},"page":"245-256","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":43,"title":["Generating example data for dataflow programs"],"prefix":"10.1145","author":[{"given":"Christopher","family":"Olston","sequence":"first","affiliation":[{"name":"Yahoo! Research, Santa Clara, CA, USA"}]},{"given":"Shubham","family":"Chopra","sequence":"additional","affiliation":[{"name":"Yahoo! Research, Bangalore, India"}]},{"given":"Utkarsh","family":"Srivastava","sequence":"additional","affiliation":[{"name":"Yahoo! Research, Santa Clara, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2009,6,29]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-003-0095-z"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/592637.592639"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367896"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247520"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304206"},{"key":"e_1_3_2_1_6_1","first-page":"4","article-title":"A greedy heuristic for the set-covering problem","author":"Chv\u00e1tal V.","year":"1979","unstructured":"V. Chv\u00e1tal . A greedy heuristic for the set-covering problem . Mathematics of Operations Research , 4 , 1979 . V. Chv\u00e1tal. A greedy heuristic for the set-covering problem. Mathematics of Operations Research, 4, 1979.","journal-title":"Mathematics of Operations Research"},{"key":"e_1_3_2_1_7_1","volume-title":"Proc. OSDI","author":"Dean J.","year":"2004","unstructured":"J. Dean and S. Ghemawat . MapReduce: Simplified data processing on large clusters . In Proc. OSDI , 2004 . J. Dean and S. Ghemawat. MapReduce: Simplified data processing on large clusters. In Proc. OSDI, 2004."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/800073.802309"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1272996.1273005"},{"key":"e_1_3_2_1_10_1","first-page":"9","article-title":"Approximation algorithms for combinatorial problems","author":"Johnson D. S.","year":"1974","unstructured":"D. S. Johnson . Approximation algorithms for combinatorial problems . Computer and System Sciences , 9 , 1974 . D. S. Johnson. Approximation algorithms for combinatorial problems. Computer and System Sciences, 9, 1974.","journal-title":"Computer and System Sciences"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.57624"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/6012.15415"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376726"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/509046"},{"key":"e_1_3_2_1_15_1","volume-title":"Proc. VLDB","author":"Stonebraker M.","year":"1993","unstructured":"M. Stonebraker , J. Chen , N. Nathan , C. Paxson , and J. Wu . Tioga: Providing data management support for scientific visualization applications . In Proc. VLDB , 1993 . M. Stonebraker, J. Chen, N. Nathan, C. Paxson, and J. Wu. Tioga: Providing data management support for scientific visualization applications. In Proc. VLDB, 1993."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/645482.653450"}],"event":{"name":"SIGMOD\/PODS '09: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","ACM Association for Computing Machinery"],"location":"Providence Rhode Island USA","acronym":"SIGMOD\/PODS '09"},"container-title":["Proceedings of the 2009 ACM SIGMOD International Conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1559845.1559873","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1559845.1559873","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:18:11Z","timestamp":1750249091000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1559845.1559873"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,29]]},"references-count":16,"alternative-id":["10.1145\/1559845.1559873","10.1145\/1559845"],"URL":"https:\/\/doi.org\/10.1145\/1559845.1559873","relation":{},"subject":[],"published":{"date-parts":[[2009,6,29]]},"assertion":[{"value":"2009-06-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}