Egg (and the e-graph theory behind it) has recently been put into use in some databases (e.g. cube[1]) and compilers (e.g. cranelift[2]). It lends itself well to the use-case of optimizing query planers and compilers, as it at the core avoids the optimization pass ordering problem (where an earlier optimization pass may destroy information that could be useful for a later one).
[0]: https://github.com/egraphs-good/egg
[1]: https://github.com/cube-js/cube
[2]: https://github.com/bytecodealliance/rfcs/blob/main/accepted/...