Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Relational E-Matching   We present a new approach to e-matching based on relational join; in
particular, we apply recent database query execution techniques to guarantee
worst-case optimal run time. Compared to the conventional backtracking approach
that always searches the e-graph "top down", our new relational e-matching
approach can better exploit pattern structure by searching the e-graph
according to an optimized query plan. We also establish the first data
complexity result for e-matching, bounding run time as a function of the
e-graph size and output size. We prototyped and evaluated our technique in the
state-of-the-art egg e-graph framework. Compared to a conventional baseline,
relational e-matching is simpler to implement and orders of magnitude faster in
practice.

9
The categories of this paper are: nlin
12
The categories of this paper are: nucl-th
21
The categories of this paper are: adap-org
34
The categories of this paper are: chem-ph
14
The categories of this paper are: math-ph
29
The categories of this paper are: funct-an
25
The categories of this paper are: patt-sol
11
The categories of this paper are: hep-lat
6
The categories of this paper are: astro-ph
36
The categories of this paper are: cmp-lg
30
The categories of this paper are: q-alg
0
The categories of this paper are: hep-ph
4
The categories of this paper are: cond-mat
26
The categories of this paper are: bayes-an
33
The categories of this paper are: plasm-ph
35
The categories of this paper are: mtrl-th