Question: Show that, with n relations, there are (2(n 1))! / (n1)! Different join orders. If you wish, you can derive the formula for the
Show that, with n relations, there are (2(n ā 1))! / (nā1)! Different join orders. If you wish, you can derive the formula for the number of complete binary trees with n nodes from the formula for the number of binary trees with n nodes. The number of binary trees with n nodes is 1/n+1 (2n n); this number is known as the Catalan number, and its derivation can be found in any standard textbook on data structures or algorithms.
Step by Step Solution
3.34 Rating (160 Votes )
There are 3 Steps involved in it
Each join order is a complete binary tree every nonleaf node has exactly two child... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
16-CS-DB (310).docx
120 KBs Word File
