{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T23:31:23Z","timestamp":1767137483900,"version":"build-2238731810"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031834714","type":"print"},{"value":"9783031834721","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-83472-1_16","type":"book-chapter","created":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T12:14:20Z","timestamp":1742040860000},"page":"235-250","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Made to\u00a0Measure: Towards Approximability of\u00a0Query Evaluation Engines"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-7827-5467","authenticated-orcid":false,"given":"Daniel","family":"Flachs","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0007-2729-938X","authenticated-orcid":false,"given":"Guido","family":"Moerkotte","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,16]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","unstructured":"Bausch, D., Petrov, I., Buchmann, A.: On the performance of database query processing algorithms on flash solid state disks. In: Proceedings of the 22nd International Workshop on Database and Expert Systems Applications (DEXA), pp. 139\u2013144 (2011). https:\/\/doi.org\/10.1109\/DEXA.2011.60","DOI":"10.1109\/DEXA.2011.60"},{"key":"16_CR2","doi-asserted-by":"publisher","unstructured":"Bausch, D., Petrov, I., Buchmann, A.: Making cost-based query optimization asymmetry-aware. In: Proceedings of the 8th International Workshop on Data Management on New Hardware (DaMoN), pp. 24\u201332 (2012). https:\/\/doi.org\/10.1145\/2236584.2236588","DOI":"10.1145\/2236584.2236588"},{"key":"16_CR3","doi-asserted-by":"publisher","unstructured":"Chaudhuri, S.: An overview of query optimization in relational systems. In: Proceedings of the 17th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), pp. 34\u201343 (1998). https:\/\/doi.org\/10.1145\/275487.275492","DOI":"10.1145\/275487.275492"},{"key":"16_CR4","doi-asserted-by":"publisher","unstructured":"Cheng, J., et al.: An efficient hybrid join algorithm: a DB2 prototype. In: Proceedings of the 7th International Conference on Data Engineering (ICDE), pp. 171\u2013180 (1991). https:\/\/doi.org\/10.1109\/ICDE.1991.131464","DOI":"10.1109\/ICDE.1991.131464"},{"key":"16_CR5","unstructured":"Flachs, D., M\u00fcller, M., Moerkotte, G.: The 3D hash join: building on non-unique join attributes. In: Proceedings of the 12th Conference on Innovative Data Systems Research (CIDR) (2022). https:\/\/www.cidrdb.org\/cidr2022\/papers\/p18-flachs.pdf"},{"issue":"3","key":"16_CR6","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/S007780050043","volume":"6","author":"L Haas","year":"1997","unstructured":"Haas, L., Carey, M., Livny, M., Shukla, A.: Seeking the truth about ad hoc join costs. VLDB J. 6(3), 241\u2013256 (1997). https:\/\/doi.org\/10.1007\/S007780050043","journal-title":"VLDB J."},{"issue":"1","key":"16_CR7","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/S007780050016","volume":"5","author":"E Harris","year":"1996","unstructured":"Harris, E., Ramamohanarao, K.: Join algorithm costs revisited. VLDB J. 5(1), 64\u201384 (1996). https:\/\/doi.org\/10.1007\/S007780050016","journal-title":"VLDB J."},{"key":"16_CR8","doi-asserted-by":"publisher","unstructured":"Hilprecht, B., Binnig, C.: Zero-shot cost models for out-of-the-box learned cost prediction. Proc. VLDB Endowment 15(11), 2361\u20132374 (2022). https:\/\/doi.org\/10.14778\/3551793.3551799","DOI":"10.14778\/3551793.3551799"},{"key":"16_CR9","unstructured":"Intel Corporation: Intel 64 and IA-32 Architectures Software Developer Manual, vol. 3B, June 2024. https:\/\/www.intel.com\/content\/www\/us\/en\/developer\/articles\/technical\/intel-sdm.html"},{"key":"16_CR10","doi-asserted-by":"publisher","unstructured":"Ioannidis, Y., Christodoulakis, S.: On the propagation of errors in the size of join results. In: Proceedings of the 1991 ACM SIGMOD International Conference on Management of Data (SIGMOD), pp. 268\u2013277 (1991). https:\/\/doi.org\/10.1145\/115790.115835","DOI":"10.1145\/115790.115835"},{"key":"16_CR11","doi-asserted-by":"publisher","unstructured":"Kastrati, F., Moerkotte, G.: Optimization of conjunctive predicates for main memory column stores. Proc. VLDB Endowment 9(12), 1125\u20131136 (2016). https:\/\/doi.org\/10.14778\/2994509.2994529","DOI":"10.14778\/2994509.2994529"},{"key":"16_CR12","doi-asserted-by":"publisher","unstructured":"Kocberber, O., Falsafi, B., Grot, B.: Asynchronous memory access chaining. Proc. VLDB Endowment 9(4), 252\u2013263 (2015). https:\/\/doi.org\/10.14778\/2856318.2856321","DOI":"10.14778\/2856318.2856321"},{"key":"16_CR13","doi-asserted-by":"publisher","unstructured":"Liu, F., Blanas, S.: Forecasting the cost of processing multi-join queries via hashing for main-memory databases. In: Proceedings of the 6th ACM Symposium on Cloud Computing (SoCC), pp. 153\u2013166 (2015). https:\/\/doi.org\/10.1145\/2806777.2806944","DOI":"10.1145\/2806777.2806944"},{"key":"16_CR14","doi-asserted-by":"publisher","unstructured":"Manegold, S., Boncz, P., Kersten, M.: Generic database cost models for hierarchical memory systems. In: Proceedings of the 28th International Conference on Very Large Databases (VLDB), pp. 191\u2013202 (2002). https:\/\/doi.org\/10.1016\/B978-155860869-6\/50025-1","DOI":"10.1016\/B978-155860869-6\/50025-1"},{"issue":"4","key":"16_CR15","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1109\/TKDE.2002.1019210","volume":"14","author":"S Manegold","year":"2002","unstructured":"Manegold, S., Boncz, P., Kersten, M.: Optimizing main-memory join on modern hardware. IEEE Trans. Knowl. Data Eng. 14(4), 709\u2013730 (2002). https:\/\/doi.org\/10.1109\/TKDE.2002.1019210","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"16_CR16","doi-asserted-by":"publisher","unstructured":"Marcus, R., Papaemmanouil, O.: Plan-structured deep neural network models for query performance prediction. Proc. VLDB Endowment 12(11), 1733\u20131746 (2019). https:\/\/doi.org\/10.14778\/3342263.3342646","DOI":"10.14778\/3342263.3342646"},{"key":"16_CR17","unstructured":"Moerkotte, G.: Building Query Compilers. Technical Report, University of Mannheim (2023). https:\/\/pi3.informatik.uni-mannheim.de\/~moer\/querycompiler.pdf"},{"key":"16_CR18","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 32nd International Conference on Very Large Data Bases (VLDB), pp. 930\u2013941 (2006). https:\/\/dl.acm.org\/citation.cfm?id=1164207"},{"key":"16_CR19","doi-asserted-by":"publisher","unstructured":"Moerkotte, G., Neumann, T., Steidl, G.: Preventing bad plans by bounding the impact of cardinality estimation errors. Proc. VLDB Endowment 2(1), 982\u2013993 (2009). https:\/\/doi.org\/10.14778\/1687627.1687738","DOI":"10.14778\/1687627.1687738"},{"key":"16_CR20","unstructured":"Mosek ApS: Mosek (2023). https:\/\/www.mosek.com\/"},{"key":"16_CR21","doi-asserted-by":"publisher","unstructured":"Nam, Y.M., Han, D., Kim, M.S.: SPRINTER: a fast n-ary join query processing method for complex OLAP queries. In: Proceedings of the ACM International Conference on Management of Data (SIGMOD), pp. 2055\u20132070 (2020). https:\/\/doi.org\/10.1145\/3318464.3380565","DOI":"10.1145\/3318464.3380565"},{"key":"16_CR22","unstructured":"Ono, K., Lohman, G.: Measuring the complexity of join enumeration in query optimization. In: Proceedings of the 16th International Conference on Very Large Databases (VLDB), pp. 314\u2013325 (1990). https:\/\/www.vldb.org\/conf\/1990\/P314.PDF"},{"key":"16_CR23","doi-asserted-by":"publisher","unstructured":"Papon, T., Athanassoulis, M.: A parametric I\/O model for modern storage disks. In: Proceedings of the 17th International Workshop on Data Management on New Hardware (DaMoN) (2021). https:\/\/doi.org\/10.1145\/3465998.3466003","DOI":"10.1145\/3465998.3466003"},{"issue":"3","key":"16_CR24","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1016\/J.JAT.2009.08.009","volume":"162","author":"S Setzer","year":"2010","unstructured":"Setzer, S., Steidl, G., Teuber, T., Moerkotte, G.: Approximation related to quotient functionals. J. Approx. Theory 162(3), 545\u2013558 (2010). https:\/\/doi.org\/10.1016\/J.JAT.2009.08.009","journal-title":"J. Approx. Theory"},{"issue":"3","key":"16_CR25","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1145\/6314.6315","volume":"11","author":"LD Shapiro","year":"1986","unstructured":"Shapiro, L.D.: Join processing in database systems with large main memories. ACM Trans. Database Syst. 11(3), 239\u2013264 (1986). https:\/\/doi.org\/10.1145\/6314.6315","journal-title":"ACM Trans. Database Syst."},{"key":"16_CR26","unstructured":"Shatdal, A., Kant, C., Naughton, J.F.: Cache conscious algorithms for relational query processing. Technical Report, University of Wisconsin-Madison Department of Computer Sciences (1994). https:\/\/minds.wisconsin.edu\/bitstream\/handle\/1793\/59896\/TR1234.pdf?sequence=1"},{"key":"16_CR27","doi-asserted-by":"publisher","unstructured":"Siddiqui, T., Jindal, A., Qiao, S., Patel, H., Le, W.: Cost models for big data query processing: learning, retrofitting, and our findings. In: Proceedings of the ACM International Conference on Management of Data (SIGMOD), pp. 99\u2013113 (2020). https:\/\/doi.org\/10.1145\/3318464.3380584","DOI":"10.1145\/3318464.3380584"},{"key":"16_CR28","doi-asserted-by":"publisher","unstructured":"Sun, J.\u00a0Li, G.: An end-to-end learning-based cost estimator. Proc. VLDB Endowment 13(3), 307\u2013319 (2019). https:\/\/doi.org\/10.14778\/3368289.3368296","DOI":"10.14778\/3368289.3368296"},{"issue":"3 &4","key":"16_CR29","first-page":"459","volume":"10","author":"T Tanaka","year":"2017","unstructured":"Tanaka, T., Ishikawa, H.: Measurement-based cost estimation method for multi-table join operation in an in-memory database. Int. J. Adv. Softw. 10(3 &4), 459\u2013476 (2017)","journal-title":"Int. J. Adv. Softw."},{"key":"16_CR30","doi-asserted-by":"publisher","unstructured":"Tanaka, T., Ishikawa, H.: Measurement-based cost calculation method focusing on CPU architecture for database query optimization. In: Proceedings of the 11th International Conference on Management of Digital EcoSystems (MEDES), pp. 56\u201365 (2020). https:\/\/doi.org\/10.1145\/3297662.3365823","DOI":"10.1145\/3297662.3365823"},{"key":"16_CR31","doi-asserted-by":"publisher","unstructured":"Wu, W., Chi, Y., Zhu, S., Tatemura, J., Hacig\u00fcm\u00fcs, H., Naughton, J.F.: Predicting query execution time: are optimizer cost models really unusable? In: Proceedings of the 29th IEEE International Conference on Data Engineering (ICDE), pp. 1081\u20131092 (2013). https:\/\/doi.org\/10.1109\/ICDE.2013.6544899","DOI":"10.1109\/ICDE.2013.6544899"},{"key":"16_CR32","doi-asserted-by":"publisher","unstructured":"Zhu, Q., Larson, P.A.: Building regression cost models for multidatabase systems. In: Proceedings of the 4th International Conference on Parallel and Distributed Information Systems (ICPADS), pp. 220\u2013231 (1996). https:\/\/doi.org\/10.1109\/PDIS.1996.568684","DOI":"10.1109\/PDIS.1996.568684"}],"updated-by":[{"DOI":"10.1007\/978-3-031-83472-1_27","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2025,3,16]],"date-time":"2025-03-16T00:00:00Z","timestamp":1742083200000}}],"container-title":["Lecture Notes in Computer Science","Database Engineered Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-83472-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T17:58:08Z","timestamp":1754675888000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-83472-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031834714","9783031834721"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-83472-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"16 March 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"16 March 2025","order":2,"name":"change_date","label":"Change Date","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Correction","order":3,"name":"change_type","label":"Change Type","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"A correction has been published.","order":4,"name":"change_details","label":"Change Details","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IDEAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Database Engineered Applications Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bayonne","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ideas-12024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conferences.sigappfr.org\/ideas2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}