{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T04:36:50Z","timestamp":1776746210766,"version":"3.51.2"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032052803","type":"print"},{"value":"9783032052810","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,18]],"date-time":"2025-09-18T00:00:00Z","timestamp":1758153600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,18]],"date-time":"2025-09-18T00:00:00Z","timestamp":1758153600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-05281-0_2","type":"book-chapter","created":{"date-parts":[[2025,9,18]],"date-time":"2025-09-18T12:48:48Z","timestamp":1758199728000},"page":"11-27","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Independence Rules: Analysis of\u00a0Nine Simple Cardinality Estimators and\u00a0Their Impact on\u00a0Plan Quality"],"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,9,18]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Alway, K., Nica, A.: Constructing join histograms from histograms with q-error guarantees. In: Proc. of the ACM SIGMOD Conf. on Management of Data, pp. 2245\u20132246 (2016)","DOI":"10.1145\/2882903.2914828"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Narasayya, V., Ramamurthy, R.: Exact cardinality query optimization for optimizer testing. In: Proc. Int. Conf. on Very Large Data Bases (VLDB), pp. 994\u20131005 (2009)","DOI":"10.14778\/1687627.1687739"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Cormode, G., Garofalakis, M., Haas, P., Jermaine, C.: Synopses for Massive Data: Samples, Histograms, Wavelets, Sketches. NOW Press (2012)","DOI":"10.1561\/9781601985170"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Datta, A., Tsan, B., Izenov, Y., Rusu, F.: Simpli-squared: optimizing without cardinality estimates. In: SiMoD \u201924: Proceedings of the 2nd Workshop on Simplicity in Management of Data, pp. 1\u201310 (2024)","DOI":"10.1145\/3663351.3663879"},{"key":"2_CR5","unstructured":"Dell\u2019Aquila, C., Lefons, E., Tangorra, F.: Estimation of database unique values. WEAS Trans. Inf. Sci. Appl. 1(1), 280\u2013285 (2004)"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Fegaras, L.: A new heuristic for optimizing large queries. In: Quirchmayr, G., Schweighofer, E., Bench-Capon, T.J.M. (eds.) DEXA 1998. LNCS, vol. 1460, pp. 726\u2013735. Springer, Heidelberg (1998).","DOI":"10.1007\/BFb0054528"},{"key":"2_CR7","unstructured":"Flachs, D., M\u00fcller, M., Moerkotte, G.: The 3D hash join: building on non-unique join attributes. In: Proc. Conference on Innovative Data Systems Research (CIDR) (2022)"},{"key":"2_CR8","unstructured":"Flachs, D., Moerkotte, G.: On the performance of query optimization without cost functions and very simple cardinality estimation. In: DBKDA 2025, The Seventeenth International Conference on Advances in Databases, Knowledge, and Data Applications, pp. 58\u201364 (2025)"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Gelder, A.V.: Multiple join size estimation by virtual domains. In: Proc. ACM SIGMOD\/SIGACT Conf. on Princ. of Database Syst. (PODS), pp. 180\u2013189 (1993)","DOI":"10.1145\/153850.153872"},{"issue":"2","key":"2_CR10","doi-asserted-by":"publisher","first-page":"1517","DOI":"10.14778\/1920841.1921027","volume":"3","author":"J Haritsa","year":"2010","unstructured":"Haritsa, J.: The Picasso database query optimizer visualizer. Proc. VLDB Endowment (PVLDB) 3(2), 1517\u20131520 (2010)","journal-title":"Proc. VLDB Endowment (PVLDB)"},{"key":"2_CR11","unstructured":"Hertzschuch, A., Hartmann, C., Habich, D., Lehner, W.: Simplicity done right for join ordering. In: Proc. Conference on Innovative Data Systems Research (CIDR) (2021)"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Ioannidis, Y.E., Christodoulakis, S.: On the propagation of errors in the size of join results. In: Proc. of the ACM SIGMOD Conf. on Management of Data, pp. 268\u2013277 (1991)","DOI":"10.1145\/115790.115835"},{"issue":"4","key":"2_CR13","doi-asserted-by":"publisher","first-page":"1102","DOI":"10.1145\/1114244.1114251","volume":"30","author":"R Kaushik","year":"2005","unstructured":"Kaushik, R., Naughton, J., Ramakrishnan, R.: Synopses for query optimization: a space-complexity perspective. ACM Trans. Database Syst. 30(4), 1102\u20131127 (2005)","journal-title":"ACM Trans. Database Syst."},{"issue":"13","key":"2_CR14","doi-asserted-by":"publisher","first-page":"2085","DOI":"10.14778\/3151106.3151112","volume":"10","author":"M Kiefer","year":"2017","unstructured":"Kiefer, M., Heimel, M., Bre\u00df, S., Markl, V.: Estimating join selectivities using bandwidth-optimized kernel density models. Proc. VLDB Endowment (PVLDB) 10(13), 2085\u20132096 (2017)","journal-title":"Proc. VLDB Endowment (PVLDB)"},{"issue":"1","key":"2_CR15","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/24820.24822","volume":"16","author":"A Kumar","year":"1987","unstructured":"Kumar, A., Stonebraker, M.: The effect of join selectivities on optimal nesting order. SIGMOD Rec. 16(1), 28\u201341 (1987)","journal-title":"SIGMOD Rec."},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Leis, V., Gubichev, A., Mirchev, A., Boncz, P., Kemper, A., Neumann, T.: How good are query optimizers, really? Proc. VLDB Endowment (PVLDB) 9(3) (2015)","DOI":"10.14778\/2850583.2850594"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/s00778-017-0480-7","volume":"27","author":"V Leis","year":"2018","unstructured":"Leis, V., et al.: Query optimization through the looking glass, and what we found running the join order benchmark. VLDB J. 27, 643\u2013668 (2018)","journal-title":"VLDB J."},{"issue":"9","key":"2_CR18","first-page":"8","volume":"30","author":"G Lohman","year":"1988","unstructured":"Lohman, G.: Heuristic method for joining relational database tables. IBM Tech. Discl. Bull. 30(9), 8\u201310 (1988)","journal-title":"IBM Tech. Discl. Bull."},{"issue":"11","key":"2_CR19","doi-asserted-by":"publisher","first-page":"1705","DOI":"10.14778\/3342263.3342644","volume":"12","author":"R Marcus","year":"2019","unstructured":"Marcus, R., et al.: Neo: a learned query optimizer. Proc. VLDB Endow. 12(11), 1705\u20131718 (2019)","journal-title":"Proc. VLDB Endow."},{"key":"2_CR20","unstructured":"Moerkotte, G., Neumann, T.: Analysis of two existing and one new dynamic programming algorithm for the generation of optimal bushy trees without cross products. In: Proc. Int. Conf. on Very Large Data Bases (VLDB), pp. 930\u2013941 (2006)"},{"issue":"1","key":"2_CR21","doi-asserted-by":"publisher","first-page":"982","DOI":"10.14778\/1687627.1687738","volume":"2","author":"G Moerkotte","year":"2009","unstructured":"Moerkotte, G., Neumann, T., Steidl, G.: Preventing bad plans by bounding the impact of cardinality estimation errors. Proc. VLDB Endowment (PVLDB) 2(1), 982\u2013993 (2009)","journal-title":"Proc. VLDB Endowment (PVLDB)"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"M\u00fcller, M., Flachs, D., Moerkotte, G.: Memory-efficient key\/foreign-key join size estimation via multiplicity and intersection size. In: Proc. IEEE Conference on Data Engineering, pp. 984\u2013995 (2021)","DOI":"10.1109\/ICDE51399.2021.00090"},{"issue":"3","key":"2_CR23","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0306-4379(93)90037-2","volume":"18","author":"J Mullin","year":"1993","unstructured":"Mullin, J.: Estimating the size of a relational join. Inf. Syst. 18(3), 189\u2013196 (1993)","journal-title":"Inf. Syst."},{"key":"2_CR24","unstructured":"Reddy, N., Haritsa, J.: Analyzing plan diagrams of database query optimizers. In: Proc. Int. Conf. on Very Large Data Bases (VLDB), pp. 1228\u20131240 (2005)"},{"issue":"3","key":"2_CR25","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1145\/1386118.1386121","volume":"33","author":"F Rusu","year":"2008","unstructured":"Rusu, F., Dobra, A.: Sketches for size of join estimation. ACM Trans. Database Syst. 33(3), 15 (2008)","journal-title":"ACM Trans. Database Syst."},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Selinger, P., Astrahan, M., Chamberlin, D., Lorie, R., Price, T.: Access path selection in a relational database management system. In: Proc. of the ACM SIGMOD Conf. on Management of Data, pp. 23\u201334 (1979)","DOI":"10.1145\/582095.582099"},{"key":"2_CR27","unstructured":"Shekita, E., Tan, K.L., Young, H.: Multi-join optimization for symmetric multiprocessors. In: Proc. Int. Conf. on Very Large Data Bases (VLDB), pp. 479\u2013492 (1993)"},{"issue":"3","key":"2_CR28","doi-asserted-by":"publisher","first-page":"307","DOI":"10.14778\/3368289.3368296","volume":"13","author":"J Sun","year":"2019","unstructured":"Sun, J., Li, G.: An end-to-end learning-based cost estimator. Proc. VLDB Endow. 13(3), 307\u2013319 (2019)","journal-title":"Proc. VLDB Endow."},{"key":"2_CR29","unstructured":"Sun, L.: Papers for database systems powered by artificial intelligence (machine learning for database). https:\/\/github.com\/LumingSun\/ML4DB-paper-list. Accessed Nov 2024"},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"Swami, A., Schiefer, K.B.: On the estimation of join result sizes. In: Jarke, M., Bubenko, J., Jeffery, K. (eds.) EDBT 1994. LNCS, vol. 779, pp. 287\u2013300. Springer, Heidelberg (1994).","DOI":"10.1007\/3-540-57818-8_58"},{"key":"2_CR31","unstructured":"Tan, W., et al.: Query predicate selectivity using machine learning in DB2. In: CASCON \u201921: Proc. 31st Annual Int. Conf. on Computer Science and Software Engineering (2021)"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Trummer, I.: Exact cardinality query optimization with bounded execution cost. In: Proc. of the ACM SIGMOD Conf. on Management of Data (2019)","DOI":"10.1145\/3299869.3300087"},{"key":"2_CR33","doi-asserted-by":"crossref","unstructured":"Wu, W., Chi, Y., Zhu, S., Tatemura, J., Hacig\u00fcm\u00fcs, H., Naughton, J.: Predicting query execution time: Are optimizer cost models really unusable? In: Proc. IEEE Conference on Data Engineering, pp. 1081\u20131092 (2013)","DOI":"10.1109\/ICDE.2013.6544899"},{"key":"2_CR34","doi-asserted-by":"crossref","unstructured":"Zhou, X., Chai, C., Li, G., Sun, J.: Database meets artificial intelligence: a survey. IEEE Trans. Knowl. Data Eng. 34(3), 1096\u20131116 (2022)","DOI":"10.1109\/TKDE.2020.2994641"}],"updated-by":[{"DOI":"10.1007\/978-3-032-05281-0_20","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2025,9,18]],"date-time":"2025-09-18T00:00:00Z","timestamp":1758153600000}}],"container-title":["Lecture Notes in Computer Science","Advances in Databases and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-05281-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T03:43:21Z","timestamp":1776743001000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-05281-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,18]]},"ISBN":["9783032052803","9783032052810"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-05281-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,18]]},"assertion":[{"value":"18 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"18 September 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":"ADBIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Advances in Databases and Information Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tampere","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Finland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adbis2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adbis2025.github.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}