silundong commented on PR #4267: URL: https://github.com/apache/calcite/pull/4267#issuecomment-2768351776
> The concern is not infinite loops, but large increases. For example, converting a boolean formula to CNF form can produce expressions that are exponential in the size of the original expression. Even a quadratic increase can be very large: if the original formula has 1000 terms, the result can have 1 million. I have seen discussions about very large formulas that can arise in SQL programs. Thanks for your explanation. So it should count and check the upper bound every time it gets a new redundant predicate, right? -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: [email protected] For queries about this service, please contact Infrastructure at: [email protected]
