Open zhouqingqing opened 4 years ago
we have some expensive assertions and inefficient methods (say subgraph).
Recent publication using Monte Carlo search: https://ssc.io/publication/alphajoin-join-order-selection-a-la-alpha-go-vldb-phd/
another thing we can do to improve memo performance is to move implementation rules associated with logic node or at least don't enlist them before exploration is done.
we have some expensive assertions and inefficient methods (say subgraph).
Recent publication using Monte Carlo search: https://ssc.io/publication/alphajoin-join-order-selection-a-la-alpha-go-vldb-phd/