{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:42:18Z","timestamp":1750308138018,"version":"3.41.0"},"reference-count":17,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2006,3,1]],"date-time":"2006-03-01T00:00:00Z","timestamp":1141171200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMOD Rec."],"published-print":{"date-parts":[[2006,3]]},"abstract":"<jats:p>\n            Consider an XML view defined over a relational database, and a user query specified over this view. This user XML query is typically processed using the following steps: (a) our translator maps the XML query to one or more SQL queries, (b) the relational engine translates an SQL query to a relational algebra plan, (c) the relational engine executes the algebra plan and returns SQL results, and (d) our translator translates the SQL results back to XML. However, a straightforward approach produces a relational algebra plan after step (b) that is\n            <jats:italic>inefficient<\/jats:italic>\n            and has redundant joins. In this paper, we report on our preliminary observations with respect to how joins in such a relational algebra plan can be minimized. Our approach works on the relational algebra plan and optimizes it using novel rewrite rules that consider pairs of joins in the plan and determine whether one of them is redundant and hence can be removed. Our study shows that algebraic techniques achieve effective join minimization, and such techniques are useful and can be integrated into mainstream SQL engines.\n          <\/jats:p>","DOI":"10.1145\/1121995.1121999","type":"journal-article","created":{"date-parts":[[2006,5,8]],"date-time":"2006-05-08T22:51:53Z","timestamp":1147128713000},"page":"20-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Join minimization in XML-to-SQL translation"],"prefix":"10.1145","volume":"35","author":[{"given":"Murali","family":"Mani","sequence":"first","affiliation":[{"name":"WPI"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Song","family":"Wang","sequence":"additional","affiliation":[{"name":"WPI"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Dougherty","sequence":"additional","affiliation":[{"name":"WPI"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elke A.","family":"Rundensteiner","sequence":"additional","affiliation":[{"name":"WPI"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,3]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/320107.320112"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/800105.803397"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/153850.153856"},{"key":"e_1_2_1_4_1","volume-title":"VLDB","author":"Deutsch A.","year":"1999","unstructured":"A. Deutsch , L. Popa , and V. Tannen . \" Physical Data Independence, Constraints and Optimization with Universal Plans \". In VLDB , Edinburgh, Scotland , Sep. 1999 . A. Deutsch, L. Popa, and V. Tannen. \"Physical Data Independence, Constraints and Optimization with Universal Plans\". In VLDB, Edinburgh, Scotland, Sep. 1999."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/582410.582413"},{"issue":"4","key":"e_1_2_1_6_1","first-page":"4","article-title":"Query Optimization in the IBM DB2 Family","volume":"16","author":"Gassner P.","year":"1993","unstructured":"P. Gassner , G. M. Lohman , K. B. Schiefer , and Y. Wang . \" Query Optimization in the IBM DB2 Family \". IEEE Data Eng. Bulletin , 16 ( 4 ): 4 -- 18 , 1993 . P. Gassner, G. M. Lohman, K. B. Schiefer, and Y. Wang. \"Query Optimization in the IBM DB2 Family\". IEEE Data Eng. Bulletin, 16(4):4--18, 1993.","journal-title":"IEEE Data Eng. Bulletin"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/211414.211419"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/588111.588138"},{"key":"e_1_2_1_9_1","volume-title":"VLDB","author":"Krishnamurthy R.","year":"2004","unstructured":"R. Krishnamurthy , R. Kaushik , and J. F. Naughton . \" Efficient XML-to-SQL Query Translation: Where to Add the Intelligence \". In VLDB , Toronto, Canada , Sep. 2004 . R. Krishnamurthy, R. Kaushik, and J. F. Naughton. \"Efficient XML-to-SQL Query Translation: Where to Add the Intelligence\". In VLDB, Toronto, Canada, Sep. 2004."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/584792.584840"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/130283.130294"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/645482.653436"},{"key":"e_1_2_1_13_1","volume-title":"IEEE ICDE","author":"Seshadri P.","year":"1996","unstructured":"P. Seshadri , H. Pirahesh , and T. Y. C. Leung . \"Complex Query Decorrelation\". In IEEE ICDE , New Orleans , LA , Feb. 1996 . P. Seshadri, H. Pirahesh, and T. Y. C. Leung. \"Complex Query Decorrelation\". In IEEE ICDE, New Orleans, LA, Feb. 1996."},{"key":"e_1_2_1_14_1","volume-title":"VLDB","author":"Shanmughasundaram J.","year":"2001","unstructured":"J. Shanmughasundaram , J. Kiernan , E. Shekita , C. Fan , and J. Funderburk . \" Querying XML Views of Relational Data \". In VLDB , Roma, Italy , Sep. 2001 . J. Shanmughasundaram, J. Kiernan, E. Shekita, C. Fan, and J. Funderburk. \"Querying XML Views of Relational Data\". In VLDB, Roma, Italy, Sep. 2001."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/38713.38736"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/603867.603874"},{"key":"e_1_2_1_17_1","unstructured":"W3C. XQuery Working Group. http:\/\/www.w3c.org\/XML\/Query.html.  W3C. XQuery Working Group. http:\/\/www.w3c.org\/XML\/Query.html."}],"container-title":["ACM SIGMOD Record"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1121995.1121999","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1121995.1121999","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:36Z","timestamp":1750262916000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1121995.1121999"}},"subtitle":["an algebraic approach"],"short-title":[],"issued":{"date-parts":[[2006,3]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,3]]}},"alternative-id":["10.1145\/1121995.1121999"],"URL":"https:\/\/doi.org\/10.1145\/1121995.1121999","relation":{},"ISSN":["0163-5808"],"issn-type":[{"type":"print","value":"0163-5808"}],"subject":[],"published":{"date-parts":[[2006,3]]},"assertion":[{"value":"2006-03-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}