Hi all: Depedent join performance is a huge challenge in processing
multi-source joins. Instead of reading all of source A and all of source B, and
joining them on A.x = B.x, we want to read all of A then build a set of A.x
that are passed as a criteria when querying B. In cases where A is small and B
is large, this can drastically reduce the data retrived from B,thus greatly
speeding the overall query. I saw the similar idea implemented in Apache
Teiid, is there a similar rule to do so in Calcite? We want to implement this,
but still havn't thought clearly, any suggestions ?
thanks!shanyao
