Hi,
> Actually, as the 7.1 code currently stands, a query that uses explicit
> JOIN operators like yours does will always be implemented in exactly
> the given join order, with no searching. I haven't quite decided if
> that's a bug or a feature ...
Do you mean a "linear binary tree" like this is executed?
/\ /\ f /\ e /\ d /\ ca b
Or can we have some variations on the graph (with the samepreorder run: a,b,c,d,e,f) like this:
/\ / \ / /\ /\ d /\ a /\ e f b c
We could give hints on the joins with brackets this way:((a,(b,c)),(d,(e,f)))
I'm not sure which version of standards allows to bracket joins,but I know sybase accepts the above form.
How difficult it looks to hack the parser to accept this form, and pass the meaning to the planner?
Attila
