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