[1]
Wang, Y.R. et al. 2024. From binary join to
free join.
SIGMOD Rec. 53, 1 (2024), 25–31.
DOI:https://doi.org/
10.1145/3665252.3665259.
[2]
Wang, Y.R. et al. 2023. Free join: Unifying
worst-case optimal and traditional joins.
Proc. ACM
Manag. Data. 1, 2 (2023), 150:1–150:23. DOI:https://doi.org/
10.1145/3589295.
[4]
Zhang, Y. et al. 2023. Better together:
Unifying datalog and equality saturation.
Proc. ACM
Program. Lang. 7,
PLDI (2023), 468–492.
DOI:https://doi.org/
10.1145/3591239.
[6]
Khamis, M.A. et al. 2022. Datalog in
wonderland.
SIGMOD Rec. 51, 2 (2022), 6–17.
DOI:https://doi.org/
10.1145/3552490.3552492.
[8]
Zhang, Y. et al. 2022. Relational e-matching.
Proc. ACM Program. Lang. 6,
POPL
(2022), 1–22. DOI:https://doi.org/
10.1145/3498696.
[9]
Nandi, C. et al. 2021. Rewrite rule inference
using equality saturation.
Proc. ACM Program.
Lang. 5,
OOPSLA (2021), 1–28. DOI:https://doi.org/
10.1145/3485496.
[10]
Willsey, M. et al. 2021. Egg: Fast and
extensible equality saturation.
Proc. ACM Program.
Lang. 5,
POPL (2021), 1–29. DOI:https://doi.org/
10.1145/3434304.