| CARVIEW |
Select Language
HTTP/2 301
server: GitHub.com
content-type: text/html
location: https://remy.wang/papers/
x-github-request-id: 8121:2D64E0:9F51EC:B3012B:6953B817
accept-ranges: bytes
age: 0
date: Tue, 30 Dec 2025 11:31:35 GMT
via: 1.1 varnish
x-served-by: cache-bom-vanm7210060-BOM
x-cache: MISS
x-cache-hits: 0
x-timer: S1767094296.610770,VS0,VE199
vary: Accept-Encoding
x-fastly-request-id: efc0020db1ac937b8f1a2dd723807cd902519e35
content-length: 162
HTTP/2 200
server: GitHub.com
content-type: text/html; charset=utf-8
last-modified: Wed, 01 Oct 2025 05:36:44 GMT
access-control-allow-origin: *
etag: W/"68dcbdec-25b7"
expires: Tue, 30 Dec 2025 11:41:35 GMT
cache-control: max-age=600
content-encoding: gzip
x-proxy-cache: MISS
x-github-request-id: 6A46:3FD64F:A07529:B42896:6953B817
accept-ranges: bytes
age: 0
date: Tue, 30 Dec 2025 11:31:36 GMT
via: 1.1 varnish
x-served-by: cache-bom-vanm7210060-BOM
x-cache: MISS
x-cache-hits: 0
x-timer: S1767094296.823875,VS0,VE207
vary: Accept-Encoding
x-fastly-request-id: 6af132f58ef4ffb4f31b8adb2b45175c6c4065f3
content-length: 3037
Papers
Papers
[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.
[3]
Wang, Y.R. 2023. Relational programming.
University of Washington, USA.
[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.
[5]
Khamis, M.A. et al. 2022. Convergence of datalog
over (pre-) semirings. PODS ’22: International
conference on management of data, philadelphia, PA, USA, june 12 - 17,
2022 (2022), 105–117.
[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.
[7]
Wang, Y.R. et al. 2022. Optimizing recursive
queries with progam synthesis. SIGMOD ’22:
International conference on management of data, philadelphia, PA, USA,
june 12 - 17, 2022 (2022), 79–93.
[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.
[11]
Yang, Y. et al. 2021. Equality
saturation for tensor graph superoptimization. Proceedings of
the fourth conference on machine learning and systems, MLSys 2021,
virtual, april 5-9, 2021 (2021).
[12]
Wang, Y.R. et al. 2020. SPORES:
Sum-product optimization via relational equality saturation for large
scale linear algebra. Proc. VLDB Endow. 13, 11
(2020), 1919–1932.
[13]
Wang, Y.R. et al. 2016. Autobahn: Using genetic
algorithms to infer strictness annotations. Proceedings of the
9th international symposium on haskell, haskell 2016, nara, japan,
september 22-23, 2016 (2016), 114–126.