{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T16:01:57Z","timestamp":1774281717784,"version":"3.50.1"},"reference-count":24,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,5,1]],"date-time":"2000-05-01T00:00:00Z","timestamp":957139200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4825,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,5]]},"DOI":"10.1016\/s0304-3975(99)00220-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:42:30Z","timestamp":1027651350000},"page":"211-229","source":"Crossref","is-referenced-by-count":115,"title":["Conjunctive query containment revisited"],"prefix":"10.1016","volume":"239","author":[{"given":"Chandra","family":"Chekuri","sequence":"first","affiliation":[]},{"given":"Anand","family":"Rajaraman","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0304-3975(99)00220-0_BIB1","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1145\/320107.320112","article-title":"Efficient optimization of a class of relational expressions","volume":"4","author":"Aho","year":"1979","journal-title":"ACM Trans. Database Systems"},{"issue":"2","key":"10.1016\/S0304-3975(99)00220-0_BIB2","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1137\/0208017","article-title":"Equivalence of relational expressions","volume":"8","author":"Aho","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(99)00220-0_BIB3","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0608024","article-title":"Complexity of finding embeddings in a k-tree","volume":"8","author":"Arnborg","year":"1987","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"1","key":"10.1016\/S0304-3975(99)00220-0_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01185403","article-title":"Optimization of a subclass of conjunctive queries","volume":"32","author":"Biskup","year":"1995","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(99)00220-0_BIB5","doi-asserted-by":"crossref","unstructured":"H.L. Bodlaender, A linear time algorithm for finding tree-decompositions of small treewidth, Proc. 25th ACM Symp. on the Theory of Computing, 1993, pp. 226\u2013234.","DOI":"10.1145\/167088.167161"},{"issue":"2","key":"10.1016\/S0304-3975(99)00220-0_BIB6","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1006\/jagm.1995.1009","article-title":"Approximating treewidth, pathwidth, frontsize, and shortest elimination tree","volume":"18","author":"Bodlaender","year":"1995","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(99)00220-0_BIB7","doi-asserted-by":"crossref","unstructured":"A.K. Chandra, P.M. Merlin, Optimal implementation of conjunctive queries in relational databases, Proc. 9th ACM Symp. on Theory of Computing, 1977, pp. 77\u201390.","DOI":"10.1145\/800105.803397"},{"key":"10.1016\/S0304-3975(99)00220-0_BIB8","doi-asserted-by":"crossref","unstructured":"S. Chaudhuri, R. Krishnamurthy, S. Potamianos, K. Shim, Optimizing queries with materialized views, Proc. 11th Internat. Conf. on Data Engineering, 1995, pp. 190\u2013200.","DOI":"10.1109\/ICDE.1995.380392"},{"key":"10.1016\/S0304-3975(99)00220-0_BIB9","doi-asserted-by":"crossref","unstructured":"U. Feige, J. Kilian, Zero knowledge and the chromatic number, Proc. 11th Ann. IEEE Conf. on Computational Complexity, 1996, pp. 278\u2013287.","DOI":"10.1109\/CCC.1996.507690"},{"key":"10.1016\/S0304-3975(99)00220-0_BIB10","series-title":"On the universal relation, Technical Report","author":"Graham","year":"1979"},{"key":"10.1016\/S0304-3975(99)00220-0_BIB11","doi-asserted-by":"crossref","unstructured":"J. Hastad, Clique is hard to approximate to within n1\u2212\u03b5, Proc. 37th Ann. Symp. on Foundations of Computer Science, 1996, pp. 627\u2013636.","DOI":"10.1109\/SFCS.1996.548522"},{"issue":"4","key":"10.1016\/S0304-3975(99)00220-0_BIB12","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1137\/0212042","article-title":"Optimizing conjunctive queries that contain untyped variables","volume":"12","author":"Johnson","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(99)00220-0_BIB13","doi-asserted-by":"crossref","unstructured":"S. Khanna, R. Motwani, Towards a syntactic characterization of PTAS, Proc. 28th ACM Symp. on the Theory of Computing, 1996.","DOI":"10.1145\/237814.237979"},{"key":"10.1016\/S0304-3975(99)00220-0_BIB14","unstructured":"P.A. Larson, H.Z. Yang, Computing queries from derived relations, Proc. 11th Internat. Conf. on Very Large Data Bases, 1985, pp. 259\u2013269."},{"key":"10.1016\/S0304-3975(99)00220-0_BIB15","unstructured":"A.Y. Levy, A.O. Mendelzon, Y. Sagiv, D. Srivastava, Answering queries using views, Proc. 14th ACM Symp. on Principles of Database Systems, 1995, pp. 95\u2013104."},{"key":"10.1016\/S0304-3975(99)00220-0_BIB16","unstructured":"A.Y. Levy, A. Rajaraman, J.J. Ordille, Querying heterogeneous information sources using source descriptions, Proc. 22nd Internat. Conf. on Very Large Data Bases, 1996."},{"key":"10.1016\/S0304-3975(99)00220-0_BIB17","doi-asserted-by":"crossref","unstructured":"A.Y. Levy, A. Rajaraman, J.D. Ullman, Answering queries using limited external query processors, Proc. 15th ACM Symp. on Principles of Database Systems, 1996, pp. 227\u2013237.","DOI":"10.1145\/237661.237716"},{"key":"10.1016\/S0304-3975(99)00220-0_BIB18","unstructured":"X. Qian, Query folding, Proc. 12th Internat. Conf. on Data Engineering, 1996."},{"key":"10.1016\/S0304-3975(99)00220-0_BIB19","doi-asserted-by":"crossref","unstructured":"A. Rajaraman, Y. Sagiv, J.D. Ullman, Answering queries using templates with binding patterns, Proc. 14th ACM Symp. on Principles of Database Systems, 1995, pp. 105\u2013112.","DOI":"10.1145\/212433.220199"},{"issue":"3","key":"10.1016\/S0304-3975(99)00220-0_BIB20","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1137\/0213035","article-title":"Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs","volume":"13","author":"Tarjan","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(99)00220-0_BIB21","unstructured":"J.D. Ullman, Principles of Database and Knowledge-Base Systems, Vol. II: The New Technologies, Computer Science Press, Rockville, MD, 1989."},{"key":"10.1016\/S0304-3975(99)00220-0_BIB22","unstructured":"H.Z. Yang, P.A. Larson, Query transformation for PSJ-queries, Proc. 13th Internat. Conf. on Very Large Data Bases, 1987, pp. 245\u2013254."},{"key":"10.1016\/S0304-3975(99)00220-0_BIB23","unstructured":"M. Yannakakis, Algorithms for acyclic database schemes, Proc. 7th Internat. Conf. on Very Large Data Bases, 1981, pp. 82\u201394."},{"key":"10.1016\/S0304-3975(99)00220-0_BIB24","doi-asserted-by":"crossref","unstructured":"C.T. Yu, M.Z. Ozsoyoglu, An algorithm for tree-query membership of a distributed query, Proc. IEEE COMPSAC (1979) pp. 306\u2013312.","DOI":"10.1109\/CMPSAC.1979.762509"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002200?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002200?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T16:44:12Z","timestamp":1733503452000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599002200"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,5]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,5]]}},"alternative-id":["S0304397599002200"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00220-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,5]]}}}