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