{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:08:42Z","timestamp":1750306122153,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"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\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1250880, 0903629, IIS-1054913"],"award-info":[{"award-number":["IIS-1250880, 0903629, IIS-1054913"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000879","name":"Alfred P. Sloan Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000879","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.3058732","type":"proceedings-article","created":{"date-parts":[[2017,5,10]],"date-time":"2017-05-10T18:09:00Z","timestamp":1494439740000},"page":"1607-1610","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Foofah"],"prefix":"10.1145","author":[{"given":"Zhongjun","family":"Jin","sequence":"first","affiliation":[{"name":"University of Michigan, Ann Arbor, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael R.","family":"Anderson","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Cafarella","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H. V.","family":"Jagadish","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"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\/2813885.2737952"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2835776.2835778"},{"key":"e_1_3_2_1_4_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 . WH Freeman and Company , New York , 1979 . M. R. Gary and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. WH Freeman and Company, New York, 1979."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993316.1993536"},{"key":"e_1_3_2_1_6_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_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064034"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1978942.1979444"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2666356.2594333"},{"key":"e_1_3_2_1_10_1","first-page":"17","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_11_1","volume-title":"VLDB","author":"Raman V.","year":"2001","unstructured":"V. Raman and J. M. Hellerstein . Potter's Wheel: An interactive data cleaning system . In VLDB , 2001 . V. Raman and J. M. Hellerstein. Potter's Wheel: An interactive data cleaning system. In VLDB, 2001."},{"key":"e_1_3_2_1_12_1","author":"Sanfeliu A.","year":"1983","unstructured":"A. Sanfeliu and K.-S. Fu . A distance measure between attributed relational graphs for pattern recognition. IEEE Trans. on Systems, Man, and Cybernetics, (3):353--362 , 1983 . A. Sanfeliu and K.-S. Fu. A distance measure between attributed relational graphs for pattern recognition. IEEE Trans. on Systems, Man, and Cybernetics, (3):353--362, 1983.","journal-title":"Trans. on Systems, Man, and Cybernetics, (3):353--362"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212356"},{"key":"e_1_3_2_1_14_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 . 1993 . I. H. Witten and D. Mo. TELS: Learning text editing tasks from examples. In Watch what I do, pages 183--203. 1993."}],"event":{"name":"SIGMOD\/PODS'17: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Chicago Illinois USA","acronym":"SIGMOD\/PODS'17"},"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.3058732","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3035918.3058732","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3035918.3058732","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:36:49Z","timestamp":1750217809000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3035918.3058732"}},"subtitle":["A Programming-By-Example System for Synthesizing Data Transformation Programs"],"short-title":[],"issued":{"date-parts":[[2017,5,9]]},"references-count":14,"alternative-id":["10.1145\/3035918.3058732","10.1145\/3035918"],"URL":"https:\/\/doi.org\/10.1145\/3035918.3058732","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"}}]}}