Bigdata SQL: Bushy Trees

In the case of bushy trees, the join occurs on the results of two other joins, rather than on one table being scanned. It is very useful for snowflake schemas. These trees contain
subtrees that can reduce the size of the intermediate data. The other advantage of a bushy tree is that the joins can be done in parallel, which could yield better performance,
depending on the infrastructure and I/O patterns