From O(n²) to O(log n) I want to share a blog post about how we rewrote our canonical chain selection algorithm Correlated SQL subqueries → Recursive CTEs Read entire post: Batches: 10 O(n²): 100 operations O(log n): 4 operations Speedup: 25x Free alpha, PostgreSQL tips, chain security & performance
12,62K