Skip to content
Back to pull request #1722

In the greedy query planner, compute only O(n²) trees instead of O(n³) #6506

Sign in to view logs

In the greedy query planner, compute only O(n²) trees instead of O(n³)

In the greedy query planner, compute only O(n²) trees instead of O(n³) #6506

Run time

Learn about OS pricing on GitHub Actions
Job Run time
build (gcc, 11, -Wall -Wextra -Werror , Release, true)
45m 32s
build (gcc, 12, -Wall -Wextra -Werror , Release, true)
49m 21s
build (gcc, 13, -Wall -Wextra -Werror , Release, true)
44m 43s
build (clang, 16, -Wall -Wextra -Werror , Release, true)
48m 51s
build (clang, 17, -Wall -Wextra -Werror , Release, true)
50m 40s
build (clang, 18, -Wall -Wextra -Werror , Release, true)
48m 35s
build (gcc, 11, -DUSE_CPP_17_BACKPORTS=ON, Release)
37m 50s
build (clang, 16, RelWithDebInfo, false, -fsanitize=address -fno-omit-frame-pointer)
1h 14m 29s
build (clang, 16, RelWithDebInfo, false, -fsanitize=undefined)
1h 2m 47s
build (clang, 17, Debug, false, -D_NO_TIMING_TESTS=ON, -fsanitize=thread -O1 -g)
1h 6m 10s
8h 48m 58s