# Optimizing E-Graphs pattern matcher: a complicated problem

**URL:** https://discourse.julialang.org/t/optimizing-e-graphs-pattern-matcher-a-complicated-problem/58914
**Category:** Performance
**Created:** [April 9, 2021, 11:13am UTC](https://discourse.julialang.org/t/optimizing-e-graphs-pattern-matcher-a-complicated-problem/58914 "2021-04-09T11:13:44Z")
**Posts on this page:** 1
**Page:** 1

<div class="post-metadata">

### Author: ![0x0f0f0f](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/0x0f0f0f/32/20806_2.png) [@0x0f0f0f](https://discourse.julialang.org/u/0x0f0f0f)
#### Post date: [April 9, 2021, 11:13am UTC](https://discourse.julialang.org/t/optimizing-e-graphs-pattern-matcher-a-complicated-problem/58914/1 "2021-04-09T11:13:44Z")

</div>

With Metatheory.jl, I have a big performance problem when pattern matching against egraphs, a fairly complex algorithm and data structure  
[https://github.com/0x0f0f0f/Metatheory.jl/issues/6](https://github.com/0x0f0f0f/Metatheory.jl/issues/6)

If anyone is skilled enough or willing to attack this problem. Please let me know. It’s certainly a valid contribution for the upcoming paper about Metatheory.jl, and I’m eager to invite anyone who helps me solve this issue as a coauthor. I may also think about placing a bounty for this performance problem.  
I’m eager to provide any kind explanation. Please ping me.