{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:40:57Z","timestamp":1725486057396},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540414810"},{"type":"electronic","value":"9783540445432"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44543-9_3","type":"book-chapter","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T14:23:52Z","timestamp":1181226232000},"page":"31-42","source":"Crossref","is-referenced-by-count":0,"title":["Optimization of Nested SQL Queries by Tableau Equivalence"],"prefix":"10.1007","author":[{"given":"Vasilis","family":"Aggelis","sequence":"first","affiliation":[]},{"given":"Stavros","family":"Cosmadakis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,4,13]]},"reference":[{"unstructured":"S. Abiteboul, R. Hull, V. Vianu. Foundations of databases. Addison-Wesley, 1995.","key":"3_CR1"},{"doi-asserted-by":"crossref","unstructured":"A. Aho, Y. Sagiv, J. Ullman. Efficient optimization of a class of relational expressions. ACM TODS 4(4), 1979.","key":"3_CR2","DOI":"10.1145\/320107.320112"},{"doi-asserted-by":"crossref","unstructured":"A. Aho, Y. Sagiv, J. Ullman. Equivalence of relational expressions. SIAM J. on Computing 8(2), 1979.","key":"3_CR3","DOI":"10.1137\/0208017"},{"doi-asserted-by":"crossref","unstructured":"A. Chandra, P. Merlin. Optimal implementation of conjunctive queries in relational databases. In STOC 1977.","key":"3_CR4","DOI":"10.1145\/800105.803397"},{"doi-asserted-by":"crossref","unstructured":"S. Chaudhuri, M. Vardi. Optimization of real conjunctive queries. In PODS 1993.","key":"3_CR5","DOI":"10.1145\/153850.153856"},{"doi-asserted-by":"crossref","unstructured":"C. Chekuri, A. Rajaraman. Conjunctive query containment revisited. In ICDT 1997.","key":"3_CR6","DOI":"10.1007\/3-540-62222-5_36"},{"doi-asserted-by":"crossref","unstructured":"S. S. Cosmadakis. Database theory and cylindric lattices. In IEEE Conf. on Foundations of Computer Science 1987.","key":"3_CR7","DOI":"10.1109\/SFCS.1987.17"},{"unstructured":"U. Dayal. Of nests and trees: a unified approach to processing queries that contain nested subqueries, aggregates, and quantifiers. In VLDB 1987.","key":"3_CR8"},{"doi-asserted-by":"crossref","unstructured":"P. Dublish, J. Biskup, Y. Sagiv. Optimization of a subclass of conjunctive queries. In ICDT 1990.","key":"3_CR9","DOI":"10.1007\/3-540-53507-1_95"},{"doi-asserted-by":"crossref","unstructured":"R. Fagin. Horn clauses and database dependencies. JACM 29(4), 1982.","key":"3_CR10","DOI":"10.1145\/322344.322347"},{"doi-asserted-by":"crossref","unstructured":"R. Ganski, H. Wong. Optimization of nested SQL queries revisited. In SIGMOD 1987.","key":"3_CR11","DOI":"10.1145\/38713.38723"},{"unstructured":"V. Harinarayan, A. Gupta. Generalized projections: a powerful query-optimization technique. Stanford University CS-TN-94-14, 1994.","key":"3_CR12"},{"doi-asserted-by":"crossref","unstructured":"T. Imielinski, W. Lipski. The relational model of data and cylindrical algebras. JCSS 28(1), 1984.","key":"3_CR13","DOI":"10.1016\/0022-0000(84)90077-1"},{"doi-asserted-by":"crossref","unstructured":"E. Ioannidis, R. Ramakrishnan. Containment of conjunctive queries: beyond relations as sets. ACM TODS 20(3), 1995.","key":"3_CR14","DOI":"10.1145\/211414.211419"},{"doi-asserted-by":"crossref","unstructured":"D. Johnson, A. Klug. Testing containment of conjunctive queries under functional and inclusion dependencies. JCSS 28, 1984.","key":"3_CR15","DOI":"10.1016\/0022-0000(84)90081-3"},{"doi-asserted-by":"crossref","unstructured":"M. Jarke, J. Koch. Query optimization in database systems. ACM Computing Surveys 16(2), 1984.","key":"3_CR16","DOI":"10.1145\/356924.356928"},{"doi-asserted-by":"crossref","unstructured":"W. Kim. On optimizing an SQL-like nested query. ACM TODS 7(3), 1982.","key":"3_CR17","DOI":"10.1145\/319732.319745"},{"doi-asserted-by":"crossref","unstructured":"A. Klug. Equivalence of relational algebra and relational calculus query languages having aggregate functions. JACM 29(3), 1982.","key":"3_CR18","DOI":"10.1145\/322326.322332"},{"unstructured":"A. Levy, I. Mumick, Y. Sagiv. Query optimization by predicate move-around. In VLDB 1994.","key":"3_CR19"},{"doi-asserted-by":"crossref","unstructured":"I. Mumick, S. Finkelstein, H. Pirahesh, R. Ramakrishnan. Magic is relevant. In SIGMOD 1990.","key":"3_CR20","DOI":"10.1145\/93597.98734"},{"doi-asserted-by":"crossref","unstructured":"I. Mumick, S. Finkelstein, H. Pirahesh, R. Ramakrishnan. Magic conditions. In PODS 1990.","key":"3_CR21","DOI":"10.1145\/298514.298584"},{"unstructured":"I. Mumick, H. Pirahesh, R. Ramakrishnan. The magic of duplicates and aggregates. In VLDB 1990.","key":"3_CR22"},{"unstructured":"J. Melton, A. Simon. Understanding the new SQL: a complete guide. Morgan Kaufmann, 1993.","key":"3_CR23"},{"unstructured":"M. Muralikrishna. Improved unnesting algorithms for join aggregate SQL queries. In VLDB 1992.","key":"3_CR24"},{"doi-asserted-by":"crossref","unstructured":"W. Nutt, Y. Sagiv, S. Shurin. Deciding equivalences among aggregate queries. In PODS 1998.","key":"3_CR25","DOI":"10.1145\/275487.275512"},{"doi-asserted-by":"crossref","unstructured":"H. Pirahesh, J. Hellerstein, W. Hasan. Extensible\/rule based query rewrite optimization in Starburst. In SIGMOD 1992.","key":"3_CR26","DOI":"10.1145\/130283.130294"},{"doi-asserted-by":"crossref","unstructured":"J. Rao, K. A. Ross. Reusing invariants: a new strategy for correlated queries. In SIGMOD 1998.","key":"3_CR27","DOI":"10.1145\/276304.276309"},{"doi-asserted-by":"crossref","unstructured":"P. Selinger, M. Astrahan, D. Chamberlin, R. Lorie, T. Price. Access path selection in a relational database management system. In SIGMOD 1979.","key":"3_CR28","DOI":"10.1145\/582095.582099"},{"doi-asserted-by":"crossref","unstructured":"P. Seshadri et al. Cost based optimization for magic: algebra and implementation. In SIGMOD 1996.","key":"3_CR29","DOI":"10.1145\/233269.233360"},{"doi-asserted-by":"crossref","unstructured":"P. Seshadri, H. Pirahesh, T. Y. C. Leung. Complex Query Decorrelation. In ICDE 1996.","key":"3_CR30","DOI":"10.1109\/ICDE.1996.492194"},{"unstructured":"D. Srivastava, K. Ross, P. Stuckey, S. Sudarshan. Foundations of Aggregation Constraints. In PPCP 1994.","key":"3_CR31"},{"unstructured":"J. D. Ullman. Database and Knowledge-Base Systems, Vols I and II. Computer Science Press, 1989.","key":"3_CR32"},{"unstructured":"W. Yan, P. Larson. Performing Group-By before Join. In ICDE 1994.","key":"3_CR33"},{"doi-asserted-by":"crossref","unstructured":"M. Yannakakis, C. Papadimitriou. Algebraic dependencies. JCSS 25(2), 1982.","key":"3_CR34","DOI":"10.1016\/0022-0000(82)90008-3"}],"container-title":["Lecture Notes in Computer Science","Research Issues in Structured and Semistructured Database Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44543-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T16:26:36Z","timestamp":1556468796000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44543-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540414810","9783540445432"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/3-540-44543-9_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}