Bergmann, RicoHertzschuch, AxelHartmann, ClaudioHabich, DirkLehner, WolfgangKönig-Ries, BirgittaScherzinger, StefanieLehner, WolfgangVossen, Gottfried2023-02-232023-02-232023978-3-88579-725-8https://dl.gi.de/handle/20.500.12116/40318A variety of query optimization papers have shown the disastrous effect of poor cardinality estimates on the overall run time for arbitrary select-project-join (SPJ) queries.Especially, underestimating join cardinalities for multi-joins can lead to catastrophic join orderings. A promising solution to overcome this problem is query optimization based on upper bounds for the join cardinalities. In this domain, our proposed UES concept is presently the most efficient technique featuring a simple, yet effective upper bound for an arbitrary number of joins. To foster research in that direction, we introduce PostBOUND, our generalized framework making upper bound SPJ query optimization a first class citizen in PostgreSQL.PostBOUND provides abstractions to calculate arbitrary upper bounds, to model joins required by an SPJ query and to iteratively construct an optimized join order.To highlight the extensibility of PostBOUND and to show the research potential, we additionally present two tighter upper bound UES variants using top-k statistics in this paper.In our evaluation, we show the efficiency and applicability of PostBOUND on different workloads as well as using different PostgreSQL versions. Additionally, we evaluate both presented tighter upper bound variant ideas.enSPJ queriesjoin orderjoin cardinalitiesupper boundgeneralizationText/Conference Paper10.18420/BTW2023-14