alamb commented on PR #4620: URL: https://github.com/apache/arrow-datafusion/pull/4620#issuecomment-1359147933
> Regarding the join reordering, one thing that we need to take into account is the connectivity of join nodes. I haven't read this PRs code One classic way to represent the joins in a query is with a `JoinGraph` as @mingmwang points out where the nodes represent relations (tables / views / subqueries) and the edges represent predicates between them Join order enumeration / choice is then implemented as a graph traversal using whatever classic (e.g. depth first search and breadth first search ) structures. -- 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: github-unsubscr...@arrow.apache.org For queries about this service, please contact Infrastructure at: us...@infra.apache.org
