{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:55:16Z","timestamp":1725566116735},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642159176"},{"type":"electronic","value":"9783642159183"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15918-3_23","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T12:39:24Z","timestamp":1284554364000},"page":"239-243","source":"Crossref","is-referenced-by-count":4,"title":["On the Termination of the Chase Algorithm"],"prefix":"10.1007","author":[{"given":"Michael","family":"Meier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"23_CR1","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1145\/1121995.1122010","volume":"35","author":"A. Deutsch","year":"2006","unstructured":"Deutsch, A., Popa, L., Tannen, V.: Query Reformulation with Constraints. SIGMOD Record\u00a035(1), 65\u201373 (2006)","journal-title":"SIGMOD Record"},{"key":"23_CR2","unstructured":"Baget, J.-F., Lecl\u00e8re, M., Mugnier, M.-L., Salvat, \u00ca.: Extending decidable cases for rules with existential variables. In: IJCAI, pp. 677\u2013682 (2009)"},{"issue":"4","key":"23_CR3","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1145\/1634.1636","volume":"31","author":"C. Beeri","year":"1984","unstructured":"Beeri, C., Vardi, M.Y.: A Proof Procedure for Data Dependencies. J. ACM\u00a031(4), 718\u2013741 (1984)","journal-title":"J. ACM"},{"key":"23_CR4","unstructured":"Cal\u00ec, A., Gottlob, G., Kifer, M.: Taming the Infinite Chase: Query Answering under Expressive Relational Constraints. In: KR (2008)"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Maier, D., Mendelzon, A., Sagiv, Y.: Testing Implications of Data Dependencies. In: SIGMOD, pp. 152\u2013152 (1979)","DOI":"10.1145\/582095.582119"},{"issue":"3","key":"23_CR6","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.tcs.2006.11.008","volume":"371","author":"A. Deutsch","year":"2007","unstructured":"Deutsch, A., Lud\u00e4scher, B., Nash, A.: Rewriting Queries Using Views with Access Patterns under Integrity Constraints. Theor. Comput. Sci.\u00a0371(3), 200\u2013226 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Deutsch, A., Nash, A., Remmel, J.: The Chase Revisited. In: PODS, pp. 149\u2013158 (2008)","DOI":"10.1145\/1376916.1376938"},{"issue":"1","key":"23_CR8","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.tcs.2004.10.033","volume":"336","author":"R. Fagin","year":"2005","unstructured":"Fagin, R., Kolaitis, P., Miller, R., Popa, L.: Data Exchange: Semantics and Query Answering. Theor. Comput. Sci.\u00a0336(1), 89\u2013124 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"23_CR9","doi-asserted-by":"publisher","first-page":"1454","DOI":"10.1145\/1189769.1189778","volume":"31","author":"A. Fuxman","year":"2006","unstructured":"Fuxman, A., Kolaitis, P., Miller, R., Tan, W.-C.: Peer Data Exchange. TODS\u00a031(4), 1454\u20131498 (2006)","journal-title":"TODS"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Greco, S., Spezzano, F.: Chase Termination: A Constraints Rewriting Approach. To appear in PVLDB (2010)","DOI":"10.14778\/1920841.1920858"},{"issue":"4","key":"23_CR11","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/s007780100054","volume":"10","author":"A. Halevy","year":"2001","unstructured":"Halevy, A.: Answering Queries Using Views: A Survey. VLDB Journal\u00a010(4), 270\u2013294 (2001)","journal-title":"VLDB Journal"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Johnson, D., Klug, A.: Testing Containment of Conjunctive Queries Under Functional and Inclusion Dependencies. In: PODS, pp. 164\u2013169 (1982)","DOI":"10.1145\/588111.588138"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Marnette, B.: Generalized Schema-Mappings: From Termination to Tractability. In: PODS, pp. 13\u201322 (2009)","DOI":"10.1145\/1559795.1559799"},{"key":"23_CR14","unstructured":"Meier, M., Schmidt, M., Lausen, G.: On Chase Termination Beyond Stratification (2009), http:\/\/arxiv.org\/abs\/0906.4228"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Meier, M., Schmidt, M., Lausen, G.: On Chase Termination Beyond Stratification. PVLDB\u00a02(1) (2009)","DOI":"10.14778\/1687627.1687737"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Meier, M., Schmidt, M., Wei, F., Lausen, G.: Semantic Query Optimization in the Presence of Types. In: PODS (2010)","DOI":"10.1145\/1807085.1807102"}],"container-title":["Lecture Notes in Computer Science","Web Reasoning and Rule Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15918-3_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:42:37Z","timestamp":1606185757000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15918-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642159176","9783642159183"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15918-3_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}