{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:13:22Z","timestamp":1771697602398,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,5,9]],"date-time":"2017-05-09T00:00:00Z","timestamp":1494288000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000879","name":"Alfred P. Sloan Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000879","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1250880, IIS-1054913, IGERT grant 0903629"],"award-info":[{"award-number":["IIS-1250880, IIS-1054913, IGERT grant 0903629"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,5,9]]},"DOI":"10.1145\/3035918.3064034","type":"proceedings-article","created":{"date-parts":[[2017,5,10]],"date-time":"2017-05-10T18:09:00Z","timestamp":1494439740000},"page":"683-698","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":87,"title":["Foofah"],"prefix":"10.1145","author":[{"given":"Zhongjun","family":"Jin","sequence":"first","affiliation":[{"name":"University of Michigan, Ann Arbor, MI, USA"}]},{"given":"Michael R.","family":"Anderson","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, MI, USA"}]},{"given":"Michael","family":"Cafarella","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, MI, USA"}]},{"given":"H. V.","family":"Jagadish","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, MI, USA"}]}],"member":"320","published-online":{"date-parts":[[2017,5,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498319"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043652.2043656"},{"key":"e_1_3_2_1_3_1","volume-title":"IJCAI","author":"Banko M.","year":"2007","unstructured":"M. Banko , M. J. Cafarella , S. Soderland , M. Broadhead , and O. Etzioni . Open information extraction for the web . In IJCAI , 2007 . M. Banko, M. J. Cafarella, S. Soderland, M. Broadhead, and O. Etzioni. Open information extraction for the web. In IJCAI, 2007."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2737924.2737952"},{"key":"e_1_3_2_1_5_1","first-page":"245","volume-title":"Swyn: A visual representation for regular expressions. Your Wish is My Command: Programming by Example","author":"Blackwell A.","year":"2001","unstructured":"A. Blackwell . Swyn: A visual representation for regular expressions. Your Wish is My Command: Programming by Example , pages 245 -- 270 , 2001 . A. Blackwell. Swyn: A visual representation for regular expressions. Your Wish is My Command: Programming by Example, pages 245--270, 2001."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453916"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2509908.2509909"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536274.2536276"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2835776.2835778"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462180"},{"key":"e_1_3_2_1_11_1","volume-title":"Computers and intractability: A guide to the theory of np-completeness","author":"Gary M. R.","year":"1979","unstructured":"M. R. Gary and D. S. Johnson . Computers and intractability: A guide to the theory of np-completeness , 1979 . M. R. Gary and D. S. Johnson. Computers and intractability: A guide to the theory of np-completeness, 1979."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926423"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2240236.2240260"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993506"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2047196.2047205"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993536"},{"issue":"2","key":"e_1_3_2_1_18_1","first-page":"100","article-title":"A formal basis for the heuristic determination of minimum cost paths. Systems Science and Cybernetics","volume":"4","author":"Hart P. E.","year":"1968","unstructured":"P. E. Hart , N. J. Nilsson , and B. Raphael . A formal basis for the heuristic determination of minimum cost paths. Systems Science and Cybernetics , IEEE Transactions on , 4 ( 2 ): 100 -- 107 , 1968 . P. E. Hart, N. J. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. Systems Science and Cybernetics, IEEE Transactions on, 4(2):100--107, 1968.","journal-title":"IEEE Transactions on"},{"key":"e_1_3_2_1_19_1","unstructured":"D. Huynh and S. Mazzocchi. OpenRefine. http:\/\/openrefine.org 2012.  D. Huynh and S. Mazzocchi. OpenRefine. http:\/\/openrefine.org 2012."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139515"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806799.1806833"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1978942.1979444"},{"key":"e_1_3_2_1_23_1","volume-title":"ICML","author":"Lau T. A.","year":"2000","unstructured":"T. A. Lau , P. M. Domingos , and D. S. Weld . Version space algebra and its application to programming by demonstration . In ICML , 2000 . T. A. Lau, P. M. Domingos, and D. S. Weld. Version space algebra and its application to programming by demonstration. In ICML, 2000."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594291.2594333"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2737924.2738002"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735461.2735468"},{"key":"e_1_3_2_1_27_1","volume-title":"Morgan Kaufmann","author":"Lieberman H.","year":"2001","unstructured":"H. Lieberman . Your wish is my command: Programming by example . Morgan Kaufmann , 2001 . H. Lieberman. Your wish is my command: Programming by example. Morgan Kaufmann, 2001."},{"key":"e_1_3_2_1_28_1","first-page":"17","article-title":"For big-data scientists, janitor work is key hurdle to insights","author":"Lohr S.","year":"2014","unstructured":"S. Lohr . For big-data scientists, janitor work is key hurdle to insights . The New York Times , 17 , 2014 . S. Lohr. For big-data scientists, janitor work is key hurdle to insights. The New York Times, 17, 2014.","journal-title":"The New York Times"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065010.1065018"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/36206.36194"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/1543687"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872362.2872387"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/894083"},{"key":"e_1_3_2_1_34_1","first-page":"381","volume-title":"VLDB","volume":"1","author":"Raman V.","year":"2001","unstructured":"V. Raman and J. M. Hellerstein . Potter's Wheel: An interactive data cleaning system . In VLDB , volume 1 , pages 381 -- 390 , 2001 . V. Raman and J. M. Hellerstein. Potter's Wheel: An interactive data cleaning system. In VLDB, volume 1, pages 381--390, 2001."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2509136.2509544"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/2977797.2977807"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212356"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21690-4_23"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2025113.2025153"},{"key":"e_1_3_2_1_40_1","volume-title":"ProQuest","author":"Solar-Lezama A.","year":"2008","unstructured":"A. Solar-Lezama . Program synthesis by sketching . ProQuest , 2008 . A. Solar-Lezama. Program synthesis by sketching. ProQuest, 2008."},{"key":"e_1_3_2_1_41_1","volume-title":"CIDR","author":"Stonebraker M.","year":"2013","unstructured":"M. Stonebraker , D. Bruckner , I. F. Ilyas , G. Beskales , M. Cherniack , S. B. Zdonik , A. Pagan , and S. Xu . Data curation at scale: The Data Tamer system . In CIDR , 2013 . M. Stonebraker, D. Bruckner, I. F. Ilyas, G. Beskales, M. Cherniack, S. B. Zdonik, A. Pagan, and S. Xu. Data curation at scale: The Data Tamer system. In CIDR, 2013."},{"key":"e_1_3_2_1_42_1","first-page":"183","volume-title":"Watch what I do","author":"Witten I. H.","year":"1993","unstructured":"I. H. Witten and D. Mo . Tels: Learning text editing tasks from examples . In Watch what I do , pages 183 -- 203 . MIT Press , 1993 . I. H. Witten and D. Mo. Tels: Learning text editing tasks from examples. In Watch what I do, pages 183--203. MIT Press, 1993."},{"key":"e_1_3_2_1_43_1","volume-title":"IJCAI","author":"Wu B.","year":"2015","unstructured":"B. Wu and C. A. Knoblock . An iterative approach to synthesize data transformation programs . In IJCAI , 2015 . B. Wu and C. A. Knoblock. An iterative approach to synthesize data transformation programs. In IJCAI, 2015."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2331801.2331809"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2557500.2557523"}],"event":{"name":"SIGMOD\/PODS'17: International Conference on Management of Data","location":"Chicago Illinois USA","acronym":"SIGMOD\/PODS'17","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2017 ACM International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3035918.3064034","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3035918.3064034","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3035918.3064034","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:36:41Z","timestamp":1750217801000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3035918.3064034"}},"subtitle":["Transforming Data By Example"],"short-title":[],"issued":{"date-parts":[[2017,5,9]]},"references-count":44,"alternative-id":["10.1145\/3035918.3064034","10.1145\/3035918"],"URL":"https:\/\/doi.org\/10.1145\/3035918.3064034","relation":{},"subject":[],"published":{"date-parts":[[2017,5,9]]},"assertion":[{"value":"2017-05-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}