Dandandan commented on issue #451: URL: https://github.com/apache/arrow-datafusion/issues/451#issuecomment-851634623
I didn't hear of this benchmark before, thanks for referencing it! Sounds really cool/useful. I believe for graph processing you'll need (mostly) support for recursive CTEs, which is I guess quite a bit more work than CTEs themselves (which currently just references the query / logical plan) + union all (which just returns all the partitions of the plans). Do you happen to have some reference material on recursive CTEs? I think it would be very valuable to plan / add support for graph processing 👍 -- 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. For queries about this service, please contact Infrastructure at: [email protected]
