Hacker News new | ask | show | jobs
by minimaxir 479 days ago
That would get around memory limitations but I still think that would be slow.
1 comments

You'd be surprised. As long as your query is using Polars natives and not a UDF (which drops it down to Python), you may get good results.
A (simple) benchmark would be great to figure out where the practical limits of such an approach are. Runtime is expected to grow with O(n*2) which will get painful at some point.