Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal
  Joins   We study the problem of optimizing subgraph queries using the new worst-case
optimal join plans. Worst-case optimal plans evaluate queries by matching one
query vertex at a time using multiway intersections. The core problem in
optimizing worst-case optimal plans is to pick an ordering of the query
vertices to match. We design a cost-based optimizer that (i) picks efficient
query vertex orderings for worst-case optimal plans; and (ii) generates hybrid
plans that mix traditional binary joins with worst-case optimal style multiway
intersections. Our cost metric combines the cost of binary joins with a new
cost metric called intersection-cost. The plan space of our optimizer contains
plans that are not in the plan spaces based on tree decompositions from prior
work. In addition to our optimizer, we describe an adaptive technique that
changes the orderings of the worst-case optimal sub-plans during query
execution. We demonstrate the effectiveness of the plans our optimizer picks
and adaptive technique through extensive experiments. Our optimizer is
integrated into the Graphflow DBMS.

36
The categories of this paper are: cmp-lg
9
The categories of this paper are: nlin
17
The categories of this paper are: q-fin
3
The categories of this paper are: physics
12
The categories of this paper are: nucl-th
25
The categories of this paper are: patt-sol
21
The categories of this paper are: adap-org
29
The categories of this paper are: funct-an
35
The categories of this paper are: mtrl-th
27
The categories of this paper are: comp-gas
24
The categories of this paper are: dg-ga
34
The categories of this paper are: chem-ph
13
The categories of this paper are: quant-ph
20
The categories of this paper are: acc-phys
5
The categories of this paper are: gr-qc
31
The categories of this paper are: ao-sci