On Wed, Oct 23, 2024 at 11:51 AM Andrei Lepikhov <lepi...@gmail.com> wrote: > Parse tree may be implemented with multiple execution plans. Even > clauses can be transformed during optimisation (Remember OR -> ANY). > Also, the cardinality of a middle-tree join depends on the inner and > outer subtrees. Because of that, having a hash on RelOptInfo's relids > and restrictions + hashes of child RelOptInfos and carrying it through > all other stages up to the end of execution is the most stable approach > I know.
I'm not saying there's a better way to do it today. I'm saying I think there SHOULD be a better way to do it. -- Robert Haas EDB: http://www.enterprisedb.com
