{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:43:46Z","timestamp":1743072226049,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":15,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387355443"},{"type":"electronic","value":"9780387399409"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-0-387-39940-9_1269","type":"book-chapter","created":{"date-parts":[[2009,9,16]],"date-time":"2009-09-16T08:08:45Z","timestamp":1253088525000},"page":"2249-2253","source":"Crossref","is-referenced-by-count":2,"title":["Query Containment"],"prefix":"10.1007","author":[{"given":"Rada","family":"Chirkova","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"1269_CR1_1269","unstructured":"Abiteboul S., Hull R., and Vianu V. Foundations of Databases. Addison-Wesley, 1995."},{"issue":"1\u20132","key":"1269_CR2_1269","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/j.tcs.2006.08.020","volume":"368","author":"F.N. Afrati","year":"2006","unstructured":"Afrati F.N., Li C., and Mitra P. Rewriting queries using views in the presence of arithmetic comparisons. Theor. Comput. Sci., 368(1\u20132):88\u2013123, 2006.","journal-title":"Theor. Comput. Sci."},{"key":"1269_CR3_1269","doi-asserted-by":"crossref","unstructured":"Chandra A.K. and Merlin P.M. Optimal implementation of conjunctive queries in relational data bases. In Proc. 9th Annual ACM Symp. on Theory of Computing, 1977, pp. 77\u201390.","DOI":"10.1145\/800105.803397"},{"issue":"4","key":"1269_CR4_1269","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1007\/s007780100054","volume":"10","author":"A.Y. Halevy","year":"2001","unstructured":"Halevy A.Y. Answering queries using views: A survey. VLDB J., 10(4):270\u2013294, 2001.","journal-title":"VLDB J."},{"key":"1269_CR5_1269","doi-asserted-by":"crossref","unstructured":"Jayram T.S., Kolaitis P.G., and Vee E. The containment problem for REAL conjunctive queries with inequalities. In Proc. 25th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, 2006, pp. 80\u201389.","DOI":"10.1145\/1142351.1142363"},{"key":"1269_CR6_1269","doi-asserted-by":"crossref","unstructured":"Kanellakis P.C. Elements of Relational Database Theory. In Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B). Elsevier and the MIT Press, 1990, pp. 1073\u20131156.","DOI":"10.1016\/B978-0-444-88074-1.50022-6"},{"key":"1269_CR7_1269","doi-asserted-by":"crossref","unstructured":"Kimelfeld B. and Sagiv Y. Revisiting Redundancy and Minimization in an XPath Fragment. In Advances in Database Technology, Proc. 11th Int. Conf. on Extending Database Technology, 2008, pp. 61\u201372.","DOI":"10.1145\/1353343.1353355"},{"issue":"1","key":"1269_CR8_1269","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1145\/42267.42273","volume":"35","author":"A.C. Klug","year":"1988","unstructured":"Klug A.C. On conjunctive queries containing inequalities. J. ACM, 35(1):146\u2013160, 1988.","journal-title":"J. ACM"},{"issue":"2","key":"1269_CR9_1269","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1006\/jcss.2000.1713","volume":"61","author":"P.G. Kolaitis","year":"2000","unstructured":"Kolaitis P.G. and Vardi M.Y. Conjunctive-Query Containment and Constraint Satisfaction. J. Comput. Syst. Sci., 61(2):302\u2013332, 2000.","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"1269_CR10_1269","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/962446.962448","volume":"51","author":"G. Miklau","year":"2004","unstructured":"Miklau G. and Suciu D. Containment and equivalence for a fragment of XPath. J. ACM, 51(1):2\u201345, 2004.","journal-title":"J. ACM"},{"key":"1269_CR11_1269","unstructured":"Saraiya Y. Subtree elimination algorithms in deductive databases. Ph.D. thesis, Stanford University, 1991."},{"key":"1269_CR12_1269","unstructured":"Ullman J.D. CS345 lecture notes. \n                  http:\/\/infolab.stanford.edu\/\u223cullman\/cs345-notes.html\n                  \n                ."},{"key":"1269_CR13_1269","unstructured":"Ullman J.D. Principles of Database and Knowledge-Base Systems, Volume II. Computer Science press, 1989."},{"key":"1269_CR14_1269","unstructured":"Ullman J.D. The database approach to knowledge representation. In Proc. 13th National Conf. on Artificial Intelligence and 8th Innovative Applications of AI Conf., Volume 2, 1996, pp. 1346\u20131348."},{"issue":"2","key":"1269_CR15_1269","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0304-3975(99)00219-4","volume":"239","author":"J.D. Ullman","year":"2000","unstructured":"Ullman J.D. Information integration using logical views. Theor. Comput. Sci., 239(2):189\u2013210, 2000.","journal-title":"Theor. Comput. Sci."}],"container-title":["Encyclopedia of Database Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-39940-9_1269","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T04:15:14Z","timestamp":1590984914000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-39940-9_1269"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9780387355443","9780387399409"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-39940-9_1269","relation":{},"subject":[],"published":{"date-parts":[[2009]]}}}