| binaryPlan(PatternDescriptor, PatternDescriptor) |  | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| logicalBinary(PatternDescriptor, PatternDescriptor) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| physicalBinary(PatternDescriptor, PatternDescriptor) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| binaryPlan() | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| logicalBinary() | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| physicalBinary() | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| logicalPlan() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| logicalSetOperation() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| logicalUnion() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| logicalExcept() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| logicalIntersect() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| physicalUnion() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| physicalExcept() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| physicalIntersect() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| unaryPlan(PatternDescriptor) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| logicalUnary(PatternDescriptor) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| logicalSetOperation(PatternDescriptor[]) | | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| logicalUnion(PatternDescriptor[]) | | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| logicalExcept(PatternDescriptor[]) | | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| logicalIntersect(PatternDescriptor[]) | | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| physicalUnary(PatternDescriptor) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| aggregate(PatternDescriptor) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| physicalUnion(PatternDescriptor[]) | | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| physicalExcept(PatternDescriptor[]) | | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| physicalIntersect(PatternDescriptor[]) | | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| unaryPlan() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| logicalUnary() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| physicalUnary() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| aggregate() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| leafPlan() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| logicalLeaf() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| logicalRelation() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| physicalLeaf() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| physicalRelation() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| inlineTable() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| oneRowRelation() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$physicalIntersect$6(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$physicalExcept$5(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$physicalUnion$4(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$logicalIntersect$3(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$logicalExcept$2(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$logicalUnion$1(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$logicalSetOperation$0(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |