An execution plan is composed of primitive operations. Examples of primitive operations are: reading a table completely, using
an index, performing a nested loop or a hash join. All primitive operations have an output: their result set. Some, like the nested
loop, have one input. Other, like the hash join, has two inputs. Each input should be connected to the output of another primitive
operation. That’s why an execution plan can be sketched as a tree: information flows from leaves to the root.
Submitted questions and answers are subject to review and editing, and may or may not be selected for posting, at the sole discretion of w3Sniff.
Get Started
Comments
Leave a Comment