When searching all the possible paths of executing a query, the optimizer
finds and saves the cheapest paths for the top level rel. I'd like to check
out all the paths the optimizer has ever considered, which I believe, are
stored in the pathlist of the top level rel. But I do not have an idea of
Zhan Li zhanl...@gmail.com writes:
When searching all the possible paths of executing a query, the optimizer
finds and saves the cheapest paths for the top level rel. I'd like to check
out all the paths the optimizer has ever considered, which I believe, are
stored in the pathlist of the top
Thank you for your reply Tom. Then a) what are exactly stored in the
pathlist of top level rel? Paths worth considering? b) I have been
struggling to come up with a way to print the Path struct. If I can print a
path the way like A hash join (B nested loop join C), that would be
great. You
Zhan Li zhanl...@gmail.com writes:
Thank you for your reply Tom. Then a) what are exactly stored in the
pathlist of top level rel? Paths worth considering? b) I have been
struggling to come up with a way to print the Path struct. If I can print a
path the way like A hash join (B nested loop