In the greedy query planner, compute only O(n²)
trees instead of O(n³)
#4428
Job | Run time |
---|---|
35m 9s | |
35m 9s |
O(n²)
trees instead of O(n³)
#4428
Job | Run time |
---|---|
35m 9s | |
35m 9s |