{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T05:56:21Z","timestamp":1790747781197,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,6,13]]},"DOI":"10.1145\/1065167.1065187","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T04:31:47Z","timestamp":1123043507000},"page":"148-159","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":31,"title":["Computing cores for data exchange"],"prefix":"10.1145","author":[{"given":"Georg","family":"Gottlob","sequence":"first","affiliation":[{"name":"Vienna University of Technology"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2005,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/551350"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/577958"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/0208017"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/320107.320112"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055558.1055592"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/123587.123592"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1634.1636"},{"key":"e_1_3_2_1_8_1","first-page":"1","volume":"28","author":"Casanova M. A.","year":"1984","unstructured":"M. A. Casanova , R. Fagin , and C. H. Papadimitriou . Inclusion Dependencies and Their Interaction with Functional Dependencies. JCSS 28 : 1 , 1984 . M. A. Casanova, R. Fagin, and C. H. Papadimitriou. Inclusion Dependencies and Their Interaction with Functional Dependencies. JCSS 28:1, 1984.","journal-title":"Inclusion Dependencies and Their Interaction with Functional Dependencies. JCSS"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/800105.803397"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00220-0"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2464827"},{"key":"e_1_3_2_1_12_1","volume-title":"D. S. Bridges et al.","author":"Downey R. G.","unstructured":"R. G. Downey and M. R. Fellows and U. Tailor . The parameterized Complexity of Relational Database Queries and an Improved Characterization of W{1} . In D. S. Bridges et al. , editors, Combinatorics, Complexity , and Logic -- Proc. DMTCS '96. R. G. Downey and M. R. Fellows and U. Tailor. The parameterized Complexity of Relational Database Queries and an Improved Characterization of W{1}. In D. S. Bridges et al., editors, Combinatorics, Complexity, and Logic -- Proc. DMTCS'96."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/645505.656440"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/773153.773163"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/602220.602222"},{"key":"e_1_3_2_1_16_1","unstructured":"G. Gottlob. Computing Cores for Data Exchange: New Algorithms and Practical Solutions. Extended version of the present paper. Currently available at: www.dbai.tuwien.ac.at\/staff\/gottlob\/extcore.pdf  G. Gottlob. Computing Cores for Data Exchange: New Algorithms and Practical Solutions. Extended version of the present paper. Currently available at: www.dbai.tuwien.ac.at\/staff\/gottlob\/extcore.pdf"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214118"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1809"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/382780.382783"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00030-8"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(00)00078-3"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701396807"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055558.1055573"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/637411.637428"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116832"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065167.1065176"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2000.1713"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00095-2"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00394-7"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/212433.220198"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/140553"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/320107.320115"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/645926.671677"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/1287369.1287421"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1626"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/645481.655581"},{"key":"e_1_3_2_1_37_1","first-page":"309","volume":"7","author":"Robertson N.","year":"1986","unstructured":"N. Robertson and P. D. Seymour . Graph Minors II. Algorithmic Aspects of Tree-Width. J. Algorithms , 7 : 309 -- 322 , 1986 . N. Robertson and P. D. Seymour. Graph Minors II. Algorithmic Aspects of Tree-Width. J. Algorithms, 7:309--322, 1986.","journal-title":"Graph Minors II. Algorithmic Aspects of Tree-Width. J. Algorithms"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055558.1055587"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/42790"},{"key":"e_1_3_2_1_40_1","first-page":"82","article-title":"Algorithms for Acyclic Database Schemes","author":"Yannakakis M.","year":"1981","unstructured":"M. Yannakakis . Algorithms for Acyclic Database Schemes . VLDB 1981 , pp. 82 -- 94 . M. Yannakakis. Algorithms for Acyclic Database Schemes. VLDB 1981, pp. 82--94.","journal-title":"VLDB"}],"event":{"name":"SIGMOD\/PODS05: International Conference on Management of Data and Symposium on Principles Database and Systems","location":"Baltimore Maryland","acronym":"SIGMOD\/PODS05","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGAI ACM Special Interest Group on Artificial Intelligence","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1065167.1065187","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T14:14:44Z","timestamp":1703168084000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1065167.1065187"}},"subtitle":["new algorithms and practical solutions"],"short-title":[],"issued":{"date-parts":[[2005,6,13]]},"references-count":40,"alternative-id":["10.1145\/1065167.1065187","10.1145\/1065167"],"URL":"https:\/\/doi.org\/10.1145\/1065167.1065187","relation":{},"subject":[],"published":{"date-parts":[[2005,6,13]]},"assertion":[{"value":"2005-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}