{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T14:16:17Z","timestamp":1725804977637},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319115078"},{"type":"electronic","value":"9783319115085"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11508-5_5","type":"book-chapter","created":{"date-parts":[[2014,9,8]],"date-time":"2014-09-08T12:26:24Z","timestamp":1410179184000},"page":"51-65","source":"Crossref","is-referenced-by-count":1,"title":["Tractable vs. Intractable Cases of Query Answering under Matching Dependencies"],"prefix":"10.1007","author":[{"given":"Leopoldo","family":"Bertossi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaffer","family":"Gardezi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley (1995)"},{"key":"5_CR2","unstructured":"Bahmani, Z., Bertossi, L., Kolahi, S., Lakshmanan, L.: Declarative entity resolution via matching dependencies and answer set programs. In: Proc. KR 2012 (2012)"},{"issue":"1","key":"5_CR3","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s00778-008-0098-x","volume":"18","author":"O. Benjelloun","year":"2009","unstructured":"Benjelloun, O., Garcia-Molina, H., Menestrina, D., Su, Q., Euijong Whang, S., Widom, J.: Swoosh: A generic approach to entity resolution. VLDB Journal\u00a018(1), 255\u2013276 (2009)","journal-title":"VLDB Journal"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Bertossi, L.: Database Repairing and Consistent Query Answering. Morgan & Claypool, Synthesis Lectures on Data Management (2011)","DOI":"10.2200\/S00379ED1V01Y201108DTM020"},{"issue":"3","key":"5_CR5","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/s00224-012-9402-7","volume":"52","author":"L. Bertossi","year":"2013","unstructured":"Bertossi, L., Kolahi, S., Lakshmanan, L.: Data cleaning and query answering with matching dependencies and matching functions. Theory of Computing Systems\u00a052(3), 441\u2013482 (2013)","journal-title":"Theory of Computing Systems"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Bertossi, L., Gardezi, J.: Tractable vs. Intractable Cases of Matching Dependencies for Query Answering under Entity Resolution. Corr ArXiv: 1309.1884 (2013)","DOI":"10.1007\/978-3-319-11508-5_5"},{"issue":"1","key":"5_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1456650.1456651","volume":"41","author":"J. Bleiholder","year":"2008","unstructured":"Bleiholder, J., Naumann, F.: Data fusion. ACM Computing Surveys\u00a041(1), 1\u201341 (2008)","journal-title":"ACM Computing Surveys"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Cali, A., Lembo, D., Rosati, R.: On the decidability and complexity of query answering over inconsistent and incomplete databases. In: Proc. PODS 2003, pp. 260\u2013271 (2003)","DOI":"10.1145\/773153.773179"},{"issue":"1","key":"5_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TKDE.2007.250581","volume":"19","author":"A. Elmagarmid","year":"2007","unstructured":"Elmagarmid, A., Ipeirotis, P., Verykios, V.: Duplicate record detection: A survey. IEEE Trans. Knowledge and Data Eng.\u00a019(1), 1\u201316 (2007)","journal-title":"IEEE Trans. Knowledge and Data Eng."},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Fan, W.: Dependencies revisited for improving data quality. In: Proc. PODS 2008 (2008)","DOI":"10.1145\/1376916.1376940"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Fan, W., Jia, X., Li, J., Ma, S.: Reasoning about record matching rules. In: Proc. VLDB 2009 (2009)","DOI":"10.14778\/1687627.1687674"},{"issue":"3","key":"5_CR12","first-page":"278","volume":"6","author":"J. Gardezi","year":"2012","unstructured":"Gardezi, J., Bertossi, L., Kiringa, I.: Matching dependencies: semantics, query answering and integrity constraints. Frontiers of Computer Science\u00a06(3), 278\u2013292 (2012)","journal-title":"Frontiers of Computer Science"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-642-32925-8_10","volume-title":"Datalog in Academia and Industry","author":"J. Gardezi","year":"2012","unstructured":"Gardezi, J., Bertossi, L.: Query rewriting using datalog for duplicate resolution. In: Barcel\u00f3, P., Pichler, R. (eds.) Datalog 2.0 2012. LNCS, vol.\u00a07494, pp. 86\u201398. Springer, Heidelberg (2012)"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-642-33362-0_14","volume-title":"Scalable Uncertainty Management","author":"J. Gardezi","year":"2012","unstructured":"Gardezi, J., Bertossi, L.: Tractable cases of clean query answering under entity resolution via matching dependencies. In: H\u00fcllermeier, E., Link, S., Fober, T., Seeger, B. (eds.) SUM 2012. LNCS, vol.\u00a07520, pp. 180\u2013193. Springer, Heidelberg (2012)"},{"issue":"3","key":"5_CR15","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.ipl.2011.10.018","volume":"112","author":"P. Kolaitis","year":"2012","unstructured":"Kolaitis, P., Pema, E.: A dichotomy in the complexity of consistent query answering for queries with two atoms. Information Processesing Letters\u00a0112(3), 77\u201385 (2012)","journal-title":"Information Processesing Letters"},{"key":"5_CR16","unstructured":"Koutris, P., Suciu, D.: A dichotomy on the complexity of consistent query answering for atoms with simple keys. In: Proc. ICDT 2014, pp. 165\u2013176 (2014)"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"ten Cate, B., Fontaine, G., Kolaitis, P.: On the data complexity of consistent query answering. In: Proc. ICDT 2012, pp. 22\u201333 (2012)","DOI":"10.1145\/2274576.2274580"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-319-04939-7_2","volume-title":"Foundations of Information and Knowledge Systems","author":"J. Wijsen","year":"2014","unstructured":"Wijsen, J.: A survey of the data complexity of consistent query answering under key constraints. In: Beierle, C., Meghini, C. (eds.) FoIKS 2014. LNCS, vol.\u00a08367, pp. 62\u201378. Springer, Heidelberg (2014)"}],"container-title":["Lecture Notes in Computer Science","Scalable Uncertainty Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11508-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T20:13:18Z","timestamp":1558987998000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11508-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319115078","9783319115085"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11508-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}