{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:39:43Z","timestamp":1725475183640},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540692690"},{"type":"electronic","value":"9783540692706"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11965893_27","type":"book-chapter","created":{"date-parts":[[2006,12,7]],"date-time":"2006-12-07T07:52:22Z","timestamp":1165477942000},"page":"389-403","source":"Crossref","is-referenced-by-count":12,"title":["Containment of Conjunctive Queries over Databases with Null Values"],"prefix":"10.1007","author":[{"given":"Carles","family":"Farr\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Werner","family":"Nutt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ernest","family":"Teniente","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toni","family":"Urp\u00ed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"Calvanese, D., Giacomo, G.D., Lenzerini, M., Vardi, M.Y.: Containment of conjunctive regular path queries with inverse. In: Proc. 7th KR, pp. 176\u2013185 (2000)"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-36285-1_1","volume-title":"Database Theory - ICDT 2003","author":"D. Calvanese","year":"2002","unstructured":"Calvanese, D., Giacomo, G.D., Vardi, M.Y.: Decidable containment of recursive queries. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol.\u00a02572, pp. 1\u201318. Springer, Heidelberg (2002)"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Chandra, A., Merlin, P.: Optimal implementation of conjunctive queries in relational databases. In: Proc. 9th STOC (1977)","DOI":"10.1145\/800105.803397"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Vardi, M.: Optimization of real conjunctive queries. In: Proc. 12th PODS (1993)","DOI":"10.1145\/153850.153856"},{"key":"27_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-47922-8","volume-title":"Database Theory - ICDT 2003","author":"S. Cohen","year":"2002","unstructured":"Cohen, S., Nutt, W., Sagiv, Y.: Containment of aggregate queries. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol.\u00a02572, Springer, Heidelberg (2002)"},{"key":"27_CR6","unstructured":"Fernandez, M., Florescu, D., Levy, A., Suciu, D.: Verifying integrity constraints on web-sites. In: Proc. 16th IJCAI, pp. 614\u2013619 (1999)"},{"key":"27_CR7","volume-title":"Database Systems: The Complete Book","author":"H. Garcia-Molina","year":"2002","unstructured":"Garcia-Molina, H., Ullman, J., Widom, J.: Database Systems: The Complete Book. Pearson Education International, London (2002)"},{"issue":"1","key":"27_CR8","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1145\/42267.42273","volume":"35","author":"A. Klug","year":"1988","unstructured":"Klug, A.: On conjunctive queries containing inequalities. J. ACM\u00a035(1), 146\u2013160 (1988)","journal-title":"J. ACM"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Kolaitis, P., Martin, D., Thakur, M.: On the complexity of the containment problem for conjunctive queries with built-in predicates. In: Proc. 17th PODS, pp. 197\u2013204 (1998)","DOI":"10.1145\/275487.275510"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Levy, A., Mendelzon, A., Sagiv, Y., Srivastava, D.: Answering queries using views. In: Proc. 14th PODS, pp. 95\u2013104 (1995)","DOI":"10.1145\/212433.220198"},{"key":"27_CR11","unstructured":"Levy, A., Sagiv, Y.: Queries independent of updates. In: Proc. 19th VLDB, pp. 171\u2013181 (1993)"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Miklau, G., Suciu, D.: Containment and equivalence for an XPath fragment. In: Proc. 21st PODS, pp. 65\u201376 (2002)","DOI":"10.1145\/543613.543623"},{"key":"27_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/3-540-49257-7_4","volume-title":"Database Theory - ICDT\u201999","author":"L. Popa","year":"1998","unstructured":"Popa, L., Tannen, V.: An equational chase for path-conjunctive queries, constraints, and views. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 39\u201357. Springer, Heidelberg (1998)"},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0166-218X(92)90032-6","volume":"40","author":"Y. Sagiv","year":"1992","unstructured":"Sagiv, Y., Saraiya, Y.: Minimizing restricted-fanout queries. Discrete Applied Mathematics\u00a040, 245\u2013264 (1992)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"27_CR15","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1145\/322217.322221","volume":"27","author":"Y. Sagiv","year":"1981","unstructured":"Sagiv, Y., Yannakakis, M.: Equivalence among relational expressions with the union and difference operators. J. ACM\u00a027(4), 633\u2013655 (1981)","journal-title":"J. ACM"},{"issue":"3","key":"27_CR16","first-page":"231","volume":"15","author":"O. Shmueli","year":"1993","unstructured":"Shmueli, O.: Equivalence of datalog programs is undecidable. Theoretical Computer Science\u00a015(3), 231\u2013242 (1993)","journal-title":"Theoretical Computer Science"},{"key":"27_CR17","series-title":"Lecture Notes in Computer Science","first-page":"19","volume-title":"Database Theory - ICDT \u201997","author":"J. Ullman","year":"1996","unstructured":"Ullman, J.: Information integration using logical views. In: Afrati, F.N., Kolaitis, P.G. (eds.) ICDT 1997. LNCS, vol.\u00a01186, pp. 19\u201340. Springer, Heidelberg (1996)"},{"issue":"1","key":"27_CR18","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1006\/jcss.1997.1455","volume":"54","author":"R. Meyden van der","year":"1997","unstructured":"van der Meyden, R.: The complexity of querying indefinite data about linearly ordered domains. J. Computer and System Sciences\u00a054(1), 113\u2013135 (1997)","journal-title":"J. Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Database Theory \u2013 ICDT 2007"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11965893_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:23:26Z","timestamp":1619508206000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11965893_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540692690","9783540692706"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11965893_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}