{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:20:44Z","timestamp":1743081644720,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319228488"},{"type":"electronic","value":"9783319228495"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-22849-5_25","type":"book-chapter","created":{"date-parts":[[2015,8,10]],"date-time":"2015-08-10T12:07:51Z","timestamp":1439208471000},"page":"367-383","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["SAM: A Sorting Approach for Optimizing Multijoin Queries"],"prefix":"10.1007","author":[{"given":"Yong","family":"Zeng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amy Nan","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lu","family":"Xia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris Xing","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y. C.","family":"Tay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,11]]},"reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-642-41924-9_18","volume-title":"Conceptual Modeling","author":"Z Bao","year":"2013","unstructured":"Bao, Z., Tay, Y.C., Zhou, J.: sonSchema: a conceptual schema for social networks. In: Ng, W., Storey, V.C., Trujillo, J.C. (eds.) ER 2013. LNCS, vol. 8217, pp. 197\u2013211. Springer, Heidelberg (2013)"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"DeHaan, D., Tompa, F.W.: Optimal top-down join enumeration. In: Proceedings of the SIGMOD, pp. 785\u2013796 (2007)","DOI":"10.1145\/1247480.1247567"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1007\/BFb0054528","volume-title":"Database and Expert Systems Applications","author":"L Fegaras","year":"1998","unstructured":"Fegaras, L.: A new heuristic for optimizing large queries. In: Quirchmayr, G., Bench-Capon, T.J.M., Schweighofer, E. (eds.) DEXA 1998. LNCS, vol. 1460, pp. 726\u2013735. Springer, Heidelberg (1998)"},{"issue":"3","key":"25_CR4","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1145\/1270.1498","volume":"9","author":"T Ibaraki","year":"1984","unstructured":"Ibaraki, T., Kameda, T.: On the optimal nesting order for computing n-relational joins. ACM Trans. Database Syst. 9(3), 482\u2013502 (1984)","journal-title":"ACM Trans. Database Syst."},{"issue":"1","key":"25_CR5","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/352958.352982","volume":"25","author":"D Kossmann","year":"2000","unstructured":"Kossmann, D., Stocker, K.: Iterative dynamic programming: a new class of query optimization algorithms. ACM Trans. Database Syst. 25(1), 43\u201382 (2000)","journal-title":"ACM Trans. Database Syst."},{"issue":"2","key":"25_CR6","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1109\/69.917567","volume":"13","author":"C Lee","year":"2001","unstructured":"Lee, C., Shih, C.-S., Chen, Y.-H.: Optimizing large join queries using a graph-based approach. IEEE Trans. Knowl. Data Eng. 13(2), 298\u2013315 (2001)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"25_CR7","unstructured":"Moerkotte, G., Neumann, T.: Analysis of two existing and one new dynamic programming algorithm for the generation of optimal bushy join trees without cross products. In: Proceedings of the VLDB, pp. 930\u2013941 (2006)"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Moerkotte, G., Neumann, T.: Dynamic programming strikes back. In: Proceedings of the SIGMOD, pp. 539\u2013552 (2008)","DOI":"10.1145\/1376616.1376672"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Neumann, T.: Query simplification: graceful degradation for join-order optimization. In: Proceedings of the SIGMOD, pp. 403\u2013414 (2009)","DOI":"10.1145\/1559845.1559889"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Ngo, H.Q., Porat, E., R\u00e9, C., Rudra, A.: Worst-case optimal join algorithms: [extended abstract]. In: Proceedings of the PODS, pp. 37\u201348 (2012)","DOI":"10.1145\/2213556.2213565"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1007\/11827405_73","volume-title":"Database and Expert Systems Applications","author":"GM Sacco","year":"2006","unstructured":"Sacco, G.M.: Truly adaptive optimization: the basic ideas. In: Bressan, S., K\u00fcng, J., Wagner, R. (eds.) DEXA 2006. LNCS, vol. 4080, pp. 751\u2013760. Springer, Heidelberg (2006)"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Selinger, P.G., Astrahan, M.M., Chamberlin, D.D., et al.: Access path selection in a relational database management system. In: Proceedings of the SIGMOD, pp. 23\u201334 (1979)","DOI":"10.1145\/582095.582099"},{"issue":"3","key":"25_CR13","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s007780050040","volume":"6","author":"M Steinbrunn","year":"1997","unstructured":"Steinbrunn, M., Moerkotte, G., Kemper, A.: Heuristic and randomized optimization for the join ordering problem. VLDB J. 6(3), 191\u2013208 (1997)","journal-title":"VLDB J."},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Swami, A., Gupta, A.: Optimization of large join queries. In: Proceedings of the SIGMOD, pp. 8\u201317 (1988)","DOI":"10.1145\/971701.50203"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Vance, B., Maier, D.: Rapid bushy join-order optimization with cartesian products. In: Proceedings of the SIGMOD, pp. 35\u201346 (1996)","DOI":"10.1145\/235968.233317"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-22849-5_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T14:23:58Z","timestamp":1675866238000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-22849-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319228488","9783319228495"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-22849-5_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"11 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}