{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:49:41Z","timestamp":1773481781886,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,9,20]],"date-time":"2021-09-20T00:00:00Z","timestamp":1632096000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,9,20]],"date-time":"2021-09-20T00:00:00Z","timestamp":1632096000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-0639106"],"award-info":[{"award-number":["IIS-0639106"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-0415101"],"award-info":[{"award-number":["IIS-0415101"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["NRF-2018R1C1B6006409"],"award-info":[{"award-number":["NRF-2018R1C1B6006409"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["NRF-2018R1A6A1A03025109"],"award-info":[{"award-number":["NRF-2018R1A6A1A03025109"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010418","name":"Institute for Information and Communications Technology Promotion","doi-asserted-by":"publisher","award":["2016-0-00145"],"award-info":[{"award-number":["2016-0-00145"]}],"id":[{"id":"10.13039\/501100010418","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s00778-021-00689-y","type":"journal-article","created":{"date-parts":[[2021,9,20]],"date-time":"2021-09-20T11:03:24Z","timestamp":1632135804000},"page":"181-200","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Have query optimizers hit the wall?"],"prefix":"10.1007","volume":"31","author":[{"given":"Richard T.","family":"Snodgrass","sequence":"first","affiliation":[]},{"given":"Sabah","family":"Currim","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3124-2566","authenticated-orcid":false,"given":"Young-Kyoon","family":"Suh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,20]]},"reference":[{"key":"689_CR1","unstructured":"Albutiu, M.-C.: Scalable analytical query processing. PhD thesis, Technical University of Munich (2013)"},{"issue":"1","key":"689_CR2","first-page":"1064","volume":"5","author":"M-C Albutiu","year":"2012","unstructured":"Albutiu, M.-C., Kemper, A., Neumann, T.: Massively parallel sort-merge joins in main memory multi-core database systems. PVLDB 5(1), 1064\u20131075 (2012)","journal-title":"PVLDB"},{"key":"689_CR3","doi-asserted-by":"crossref","unstructured":"Babcock, B., Chaudhuri, S.: Towards a robust query optimizer: a principled and practical approach. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 119\u2013130. ACM, New York, NY, USA (2005)","DOI":"10.1145\/1066157.1066172"},{"key":"689_CR4","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"R Bayer","year":"1972","unstructured":"Bayer, R., McCreight, E.: Organization and maintenance of large ordered indexes. Acta Inf. 1, 173\u2013189 (1972)","journal-title":"Acta Inf."},{"key":"689_CR5","doi-asserted-by":"crossref","unstructured":"Borovica-Gajic, R., Idreos, S., Ailamaki, A., Zukowski, M., Fraser, C.: Smooth scan: statistics-oblivious access paths. In: 2015 IEEE 31st International Conference on Data Engineering, pp. 315\u2013326 (2015)","DOI":"10.1109\/ICDE.2015.7113294"},{"key":"689_CR6","unstructured":"Bratbergsengen, K.: Hashing methods and relational algebra operations. In: Proceedings of the Very Large Database Conference, pp. 323\u2013333 (1984)"},{"key":"689_CR7","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S.: An overview of query optimization in relational systems. In: Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 34\u201343. ACM, New York, NY, USA (1998)","DOI":"10.1145\/275487.275492"},{"key":"689_CR8","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D Comer","year":"1979","unstructured":"Comer, D.: The ubiquitous B-Tree. ACM Comput. Surv. 11, 121\u2013137 (1979)","journal-title":"ACM Comput. Surv."},{"issue":"1","key":"689_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2996454","volume":"42","author":"S Currim","year":"2016","unstructured":"Currim, S., Snodgrass, R.T., Suh, Y.-K., Zhang, R.: DBMS metrology: measuring query time. ACM Trans. Database Syst. 42(1), 1\u201342 (2016)","journal-title":"ACM Trans. Database Syst."},{"issue":"2","key":"689_CR10","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/152610.152611","volume":"25","author":"G Graefe","year":"1993","unstructured":"Graefe, G.: Query evaluation techniques for large databases. ACM Comput. Surv. 25(2), 73\u2013169 (1993)","journal-title":"ACM Comput. Surv."},{"issue":"1","key":"689_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00450-011-0186-9","volume":"27","author":"G Graefe","year":"2012","unstructured":"Graefe, G.: New algorithms for join and grouping operations. Comput. Sci. Res. Dev. 27(1), 3\u201327 (2012)","journal-title":"Comput. Sci. Res. Dev."},{"key":"689_CR12","doi-asserted-by":"crossref","unstructured":"Guo, R.B. , Daudjee, K.: Research challenges in deep reinforcement learning-based join query optimization. In: Proceedings of the Third International Workshop on Exploiting Artificial Intelligence Techniques for Data Management, aiDM\u2019 20. Association for Computing Machinery, New York, NY, USA (2020)","DOI":"10.1145\/3401071.3401657"},{"key":"689_CR13","unstructured":"Harish, D., Darera, P.N., Haritsa, J.R.: On the production of anorexic plan diagrams. In: Proceedings of the 33rd International Conference on Very Large Data Bases, pp. 1081\u20131092. VLDB Endowment (2007)"},{"issue":"1\u20132","key":"689_CR14","doi-asserted-by":"publisher","first-page":"1517","DOI":"10.14778\/1920841.1921027","volume":"3","author":"JR Haritsa","year":"2010","unstructured":"Haritsa, J.R.: The Picasso database query optimizer visualizer. Proc. VLDB Endow. 3(1\u20132), 1517\u20131520 (2010)","journal-title":"Proc. VLDB Endow."},{"key":"689_CR15","doi-asserted-by":"crossref","unstructured":"Ibaraki, T., Kameda, T.: On the optimal nesting order for computing n-relatinal joins. ACM Trans. Database Syst. 9(3), 482\u2013502 (1984)","DOI":"10.1145\/1270.1498"},{"key":"689_CR16","unstructured":"ISO: ISO SQL:2008 international standard. ISO, International Organization for Standardization, Geneva, Switzerland (2008)"},{"key":"689_CR17","doi-asserted-by":"crossref","unstructured":"Kabra N, DeWitt DJ (1998) Efficient mid-query reoptimization of sub-optimal query execution plans. In: Proceedings of the 1998 ACM SIGMOD international conference on management of data, pp 106\u2013117","DOI":"10.1145\/276305.276315"},{"issue":"3","key":"689_CR18","doi-asserted-by":"publisher","first-page":"204","DOI":"10.14778\/2850583.2850594","volume":"9","author":"V Leis","year":"2015","unstructured":"Leis, V., Gubichev, A., Mirchev, A., Boncz, P., Kemper, A., Neumann, T.: How good are query optimizers, really? Proc. VLDB Endow. 9(3), 204\u2013215 (2015)","journal-title":"Proc. VLDB Endow."},{"key":"689_CR19","unstructured":"Lohman G (2014) Is query optimization a \u201csolved\u201d problem? http:\/\/wp.sigmod.org\/?p=1075"},{"key":"689_CR20","doi-asserted-by":"publisher","first-page":"1705","DOI":"10.14778\/3342263.3342644","volume":"12","author":"R Marcus","year":"2019","unstructured":"Marcus, R., Negi, P., Mao, M., Zhang, C., Alizadeh, M., Kraska, T., Papaemmanouil, O., Tatbul, N.: Neo: a learned query optimizer. Proc. VLDB Endow. 12, 1705\u20131718 (2019)","journal-title":"Proc. VLDB Endow."},{"key":"689_CR21","volume-title":"Advanced SQL: 1999","author":"J Melton","year":"2003","unstructured":"Melton, J.: Advanced SQL: 1999. Morgan Kaufmann, Burlington (2003)"},{"key":"689_CR22","doi-asserted-by":"crossref","unstructured":"M\u00fcller, I., Sanders, P., Lacurie, A., Lehner, W., F\u00e4rber, F.: Cache-efficient aggregation: hashing is sorting. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 1123\u20131136 (2015)","DOI":"10.1145\/2723372.2747644"},{"issue":"3","key":"689_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3180143","volume":"65","author":"HQ Ngo","year":"2018","unstructured":"Ngo, H.Q., Porat, E., R\u00e9, C., Rudra, A.: Worst-case optimal join algorithms. J. ACM 65(3), 1\u201340 (2018)","journal-title":"J. ACM"},{"key":"689_CR24","unstructured":"Reddy, N., Haritsa, J.R.: Analyzing plan diagrams of database query optimizers. In: Proceedings of the 31st International Conference on Very Large Data Bases, pp. 1228\u20131239. VLDB Endowment (2005)"},{"key":"689_CR25","doi-asserted-by":"crossref","unstructured":"Suh, Y., Snodgrass, R.T., Zhang, R.: AZDBLab: a laboratory information system for large-scale empirical DBMS studies. PVLDB 7(13), 1641\u20131644 (2014)","DOI":"10.14778\/2733004.2733050"},{"issue":"2","key":"689_CR26","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/565117.565127","volume":"31","author":"M Winslett","year":"2002","unstructured":"Winslett, M.: David DeWitt speaks out. SIGMOD Rec. 31(2), 50\u201362 (2002)","journal-title":"SIGMOD Rec."}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-021-00689-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-021-00689-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-021-00689-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,28]],"date-time":"2022-01-28T11:08:00Z","timestamp":1643368080000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-021-00689-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,20]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["689"],"URL":"https:\/\/doi.org\/10.1007\/s00778-021-00689-y","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,20]]},"assertion":[{"value":"30 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 May 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 July 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 September 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}