{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T15:53:23Z","timestamp":1762271603745},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540622222"},{"type":"electronic","value":"9783540496823"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-62222-5_36","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:36:53Z","timestamp":1330277813000},"page":"56-70","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":41,"title":["Conjunctive query containment revisited"],"prefix":"10.1007","author":[{"given":"Chandra","family":"Chekuri","sequence":"first","affiliation":[]},{"given":"Anand","family":"Rajaraman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"issue":"4","key":"4_CR1","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1145\/320107.320112","volume":"4","author":"A.V. Aho","year":"1979","unstructured":"A.V. Aho, Y. Sagiv, and J.D. Ullman. Efficient optimization of a class of relational expressions. ACM Transactions on Database Systems, 4(4):435\u2013454, December 1979.","journal-title":"ACM Transactions on Database Systems"},{"issue":"2","key":"4_CR2","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1137\/0208017","volume":"8","author":"A.V. Aho","year":"1979","unstructured":"A.V. Aho, Y. Sagiv, and J.D. Ullman. Equivalence of relational expressions. SIAM Journal on Computing, 8(2):218\u2013246, May 1979.","journal-title":"SIAM Journal on Computing"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"H.L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. In Proceedings of the 25th ACM Symposium on the Theory of Computing, pages 226\u2013234, 1993.","DOI":"10.1145\/167088.167161"},{"key":"4_CR4","unstructured":"S. Chaudhuri, R. Krishnamurthy, S. Potamianos, and K. Shim. Optimizing queries with materialized views. In Proceedings of the Eleventh International Conference on Data Engineering, pages 190\u2013200, 1995."},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"A.K. Chandra and P.M. Merlin. Optimal implementation of conjunctive queries in relational databases. In Proceedings of the Ninth ACM Symposium on Theory of Computing, pages 77\u201390, 1977.","DOI":"10.1145\/800105.803397"},{"key":"4_CR6","volume-title":"Technical report","author":"M.H. Graham","year":"1979","unstructured":"M.H. Graham. On the universal relation. Technical report, University of Toronto, Ontario, Canada, 1979."},{"issue":"4","key":"4_CR7","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1137\/0212042","volume":"12","author":"D.S. Johnson","year":"1983","unstructured":"D.S. Johnson and A. Klug. Optimizing conjunctive queries that contain untyped variables. SIAM Journal on Computing, 12(4):616\u2013640, November 1983.","journal-title":"SIAM Journal on Computing"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"S. Khanna and R. Motwani. Towards a syntactic characterization of PTAS. In Proceedings of the 28th ACM Symposium on the Theory of Computing, 1996.","DOI":"10.1145\/237814.237979"},{"key":"4_CR9","unstructured":"A.Y. Levy, A.O. Mendelzon, Y. Sagiv, and D. Srivastava. Answering queries using views. In Proceedings of the Fourteenth ACM Symposium on Principles of Database Systems, pages 95\u2013104, 1995."},{"key":"4_CR10","unstructured":"A.Y. Levy, A. Rajaraman, and J.J. Ordille. Querying heterogeneous information sources using source descriptions. In Proceedings of the 22nd International Conference on Very Large Data Bases, 1996."},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"A.Y. Levy, A. Rajaraman, and J.D. Ullman. Answering queries using limited external query processors. In Proceedings of the Fifteenth ACM Symposium on Principles of Database Systems, pages 227\u2013237, 1996.","DOI":"10.1145\/237661.237716"},{"key":"4_CR12","unstructured":"P.A. Larson and H.Z. Yang. Computing queries from derived relations. In Proceedings of the Eleventh International Conference on Very Large Data Bases, pages 259\u2013269, 1985."},{"key":"4_CR13","unstructured":"X. Qian. Query folding. In Proceedings of the Twelfth International Conference on Data Engineering, 1996."},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"A. Rajaraman, Y. Sagiv, and J.D. Ullman. Answering queries using templates with binding patterns. In Proceedings of the Fourteenth ACM Symposium on Principles of Database Systems, pages 105\u2013112, 1995.","DOI":"10.1145\/212433.220199"},{"issue":"3","key":"4_CR15","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"R.E. Tarjan","year":"1984","unstructured":"R.E. Tarjan and M. Yannakakis. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM Journal on Computing, 13(3):566\u2013579, 1984.","journal-title":"SIAM Journal on Computing"},{"key":"4_CR16","volume-title":"Volume II: The New Technologies","author":"J.D. Ullman","year":"1989","unstructured":"J.D. Ullman. Principles of Database and Knowledge-Base Systems, Volume II: The New Technologies. Computer Science Press, Rockville, MD, 1989."},{"key":"4_CR17","unstructured":"M. Yannakakis. Algorithms for acyclic database schemes. In Proceedings of the Seventh International Conference on Very Large Data Bases, pages 82\u201394, 1981."},{"key":"4_CR18","unstructured":"H.Z. Yang and P.A. Larson. Query transformation for PSJ-queries. In Proceedings of the Thirteenth International Conference on Very Large Data Bases, pages 245\u2013254, 1987."},{"key":"4_CR19","unstructured":"C.T. Yu and M.Z. Ozsoyoglu. An algorithm for tree-query membership of a distributed query. In Proceedings of IEEE COMPSAC, pages 306\u2013312, 1979."}],"container-title":["Lecture Notes in Computer Science","Database Theory \u2014 ICDT '97"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62222-5_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T18:32:40Z","timestamp":1578508360000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62222-5_36"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540622222","9783540496823"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-62222-5_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"3 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}