![]() |
![]() |
Oracle SQL Explain Plan | 24 April 2007 19:05:07 GMT+00:00 | ![]() |
![]() |
![]() |
![]() |
![]() |
|
![]() |
![]() |
![]() |
![]() |
Version: Oracle 9.2.0.6.0 | |
Database: DB001.CO | |
Schema: APLSYS | |
Date: 24-Apr-07 00:00:00 |
|
COST ALL ROWS (optimizer: CHOOSE) |
1,008,374 |
Step # | Step Name |
---|
75 | ![]() | INSERT STATEMENT |
74 | ![]() ![]() | UNION-ALL |
49 | ![]() ![]() ![]() | SORT [UNIQUE] |
48 | ![]() ![]() ![]() ![]() | UNION-ALL |
27 | ![]() ![]() ![]() ![]() ![]() | SORT [GROUP BY] |
26 | ![]() ![]() ![]() ![]() ![]() ![]() | FILTER |
24 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HSASYS.COM_CLIENT_ADDRESS TABLE ACCESS [BY INDEX ROWID] |
23 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | NESTED LOOPS |
21 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | NESTED LOOPS |
18 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | NESTED LOOPS |
15 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | NESTED LOOPS |
12 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | NESTED LOOPS |
9 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HASH JOIN |
7 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | . VIEW |
6 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | SORT [UNIQUE] |
5 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HSASYS.COM_TRANS_INT_HDR TABLE ACCESS [BY INDEX ROWID] |
4 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | NESTED LOOPS |
2 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HSASYS.COM_MODULE_INTM TABLE ACCESS [BY INDEX ROWID] |
1 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HSASYS.IND_MDL_INT INDEX [RANGE SCAN] |
3 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HSASYS.IND_CTIH_VOUPASS_IND INDEX [RANGE SCAN] |
8 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HSASYS.FIN_VOU_HDR TABLE ACCESS [FULL] |
11 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HSASYS.FIN_VOU_PMT_DTL TABLE ACCESS [BY INDEX ROWID] |
10 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HSASYS.XPKFIN_VOU_PMT_DTL INDEX [UNIQUE SCAN] |
14 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HSASYS.FIN_VOU_CSHBNK TABLE ACCESS [BY INDEX ROWID] |
13 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HSASYS.XPKFIN_VOU_CSHBNK INDEX [RANGE SCAN] |
17 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HSASYS.COM_POLICY_M TABLE ACCESS [BY INDEX ROWID] |
16 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HSASYS.XPKCOM_POLICY_M INDEX [UNIQUE SCAN] |
20 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HSASYS.COM_CLIENT_M TABLE ACCESS [BY INDEX ROWID] |
19 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HSASYS.XPKCOM_CLIENT_M INDEX [UNIQUE SCAN] |
22 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HSASYS.COM_CLTADDR_CLTPRIME INDEX [RANGE SCAN] |
25 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HSASYS.XPKCLM_OVERRIDE_PYMNTS INDEX [FULL SCAN] |
47 | ![]() ![]() ![]() ![]() ![]() | SORT [GROUP BY] |
46 | ![]() ![]() ![]() ![]() ![]() ![]() | NESTED LOOPS |
43 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() | NESTED LOOPS |
40 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | NESTED LOOPS |
38 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HASH JOIN |
36 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HASH JOIN |
34 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | . VIEW |
33 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | SORT [UNIQUE] |
32 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HSASYS.COM_TRANS_INT_HDR TABLE ACCESS [BY INDEX ROWID] |
31 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | NESTED LOOPS |
29 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HSASYS.COM_MODULE_INTM TABLE ACCESS [BY INDEX ROWID] |
28 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HSASYS.IND_MDL_INT INDEX [RANGE SCAN] |
30 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HSASYS.IND_CTIH_VOUPASS_IND INDEX [RANGE SCAN] |
35 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HSASYS.FIN_VOU_HDR TABLE ACCESS [FULL] |
37 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HSASYS.CLM_OVERRIDE_PYMNTS TABLE ACCESS [FULL] |
39 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HSASYS.XPKFIN_VOU_PMT_DTL INDEX [UNIQUE SCAN] |
42 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HSASYS.FIN_VOU_CSHBNK TABLE ACCESS [BY INDEX ROWID] |
41 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HSASYS.XPKFIN_VOU_CSHBNK INDEX [RANGE SCAN] |
45 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HSASYS.COM_POLICY_M TABLE ACCESS [BY INDEX ROWID] |
44 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HSASYS.XPKCOM_POLICY_M INDEX [UNIQUE SCAN] |
73 | ![]() ![]() ![]() | SORT [GROUP BY] |
72 | ![]() ![]() ![]() ![]() | HSASYS.FIN_VOU_CSHBNK TABLE ACCESS [BY INDEX ROWID] |
71 | ![]() ![]() ![]() ![]() ![]() | NESTED LOOPS |
69 | ![]() ![]() ![]() ![]() ![]() ![]() | NESTED LOOPS |
66 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HASH JOIN [SEMI] |
59 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HSASYS.FIN_VOU_HDR TABLE ACCESS [BY INDEX ROWID] |
58 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | NESTED LOOPS |
56 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HASH JOIN |
50 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HSASYS.PK_GROUP_ACCOUNT_M INDEX [FAST FULL SCAN] |
55 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HASH JOIN |
51 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HSASYS.INDX_COM_GROUP_M INDEX [FAST FULL SCAN] |
54 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HASH JOIN |
52 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HSASYS.COM_CLIENT_ADDRESS TABLE ACCESS [FULL] |
53 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HSASYS.COM_CLIENT_M TABLE ACCESS [FULL] |
57 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HSASYS.INDX_FVHDR_NBASEDOCTY_NBR INDEX [RANGE SCAN] |
65 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | . VIEW |
64 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HSASYS.COM_TRANS_INT_HDR TABLE ACCESS [BY INDEX ROWID] |
63 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | NESTED LOOPS |
61 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HSASYS.COM_MODULE_INTM TABLE ACCESS [BY INDEX ROWID] |
60 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HSASYS.IND_MDL_INT INDEX [RANGE SCAN] |
62 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HSASYS.IND_CTIH_VOUPASS_IND INDEX [RANGE SCAN] |
68 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HSASYS.FIN_VOU_PMT_DTL TABLE ACCESS [BY INDEX ROWID] |
67 | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | HSASYS.XPKFIN_VOU_PMT_DTL INDEX [UNIQUE SCAN] |
70 | ![]() ![]() ![]() ![]() ![]() ![]() | HSASYS.XPKFIN_VOU_CSHBNK INDEX [RANGE SCAN] |
Step # | Description | Est. Cost | Est. Rows Returned | Est. KBytes Returned |
---|
1 | This plan step retrieves one or more ROWIDs in ascending order by scanning the B*-tree index IND_MDL_INT. | 59 | 3,890 | -- |
2 | This plan step retrieves rows from table COM_MODULE_INTM through ROWID(s) returned by an index. | 125 | 3,890 | 49.385 |
3 | This plan step retrieves one or more ROWIDs in ascending order by scanning the B*-tree index IND_CTIH_VOUPASS_IND. | 3 | 1 | -- |
4 | This plan step joins two sets of rows by iterating over the driving, or outer, row set (the first child of the join) and, for each row, carrying out the steps of the inner row set (the second child). Corresponding pairs of rows are tested against the join condition specified in the query's WHERE clause. | 9,480 | 3,890 | 155.752 |
5 | This plan step retrieves rows from table COM_TRANS_INT_HDR through ROWID(s) returned by an index. | 3 | 1 | 0.027 |
6 | This plan step accepts a row set (its only child) and sorts it in order to identify and eliminate duplicates. | -- | 3,890 | 155.752 |
7 | This plan step represents the execution plan for the subquery defined by the view . | 9,480 | 3,890 | 56.982 |
8 | This plan step retrieves all rows from table FIN_VOU_HDR. | 340,336 | 786,235 | 34,551.343 |
9 | This plan step accepts two sets of rows, each from a different table. A hash table is built using the rows returned by the first child. Each row returned by the second child is then used to probe the hash table to find row pairs which satisfy a condition specified in the query's WHERE clause. Note: The Oracle cost-based optimizer will build the hash table using what it thinks is the smaller of the two tables. It uses the statistics to determine which is smaller, so out of date statistics could cause the optimizer to make the wrong choice. | 349,840 | 83 | 4.863 |
10 | This plan step retrieves a single ROWID from the B*-tree index XPKFIN_VOU_PMT_DTL. | 2 | 1 | -- |
11 | This plan step retrieves rows from table FIN_VOU_PMT_DTL through ROWID(s) returned by an index. | 2 | 1 | 0.034 |
12 | This plan step joins two sets of rows by iterating over the driving, or outer, row set (the first child of the join) and, for each row, carrying out the steps of the inner row set (the second child). Corresponding pairs of rows are tested against the join condition specified in the query's WHERE clause. | 349,973 | 29 | 2.69 |
13 | This plan step retrieves one or more ROWIDs in ascending order by scanning the B*-tree index XPKFIN_VOU_CSHBNK. | 4 | 1 | -- |
14 | This plan step retrieves rows from table FIN_VOU_CSHBNK through ROWID(s) returned by an index. | 4 | 1 | 0.031 |
15 | This plan step joins two sets of rows by iterating over the driving, or outer, row set (the first child of the join) and, for each row, carrying out the steps of the inner row set (the second child). Corresponding pairs of rows are tested against the join condition specified in the query's WHERE clause. | 350,066 | 1 | 0.124 |
16 | This plan step retrieves a single ROWID from the B*-tree index XPKCOM_POLICY_M. | 2 | 1 | -- |
17 | This plan step retrieves rows from table COM_POLICY_M through ROWID(s) returned by an index. | 2 | 1 | 0.018 |
18 | This plan step joins two sets of rows by iterating over the driving, or outer, row set (the first child of the join) and, for each row, carrying out the steps of the inner row set (the second child). Corresponding pairs of rows are tested against the join condition specified in the query's WHERE clause. | 350,068 | 1 | 0.142 |
19 | This plan step retrieves a single ROWID from the B*-tree index XPKCOM_CLIENT_M. | 2 | 1 | -- |
20 | This plan step retrieves rows from table COM_CLIENT_M through ROWID(s) returned by an index. | 2 | 1 | 0.012 |
21 | This plan step joins two sets of rows by iterating over the driving, or outer, row set (the first child of the join) and, for each row, carrying out the steps of the inner row set (the second child). Corresponding pairs of rows are tested against the join condition specified in the query's WHERE clause. | 350,070 | 1 | 0.153 |
22 | This plan step retrieves one or more ROWIDs in ascending order by scanning the B*-tree index COM_CLTADDR_CLTPRIME. | 3 | 1 | -- |
23 | This plan step joins two sets of rows by iterating over the driving, or outer, row set (the first child of the join) and, for each row, carrying out the steps of the inner row set (the second child). Corresponding pairs of rows are tested against the join condition specified in the query's WHERE clause. | 350,072 | 1 | 0.219 |
24 | This plan step retrieves rows from table COM_CLIENT_ADDRESS through ROWID(s) returned by an index. | 3 | 1 | 0.065 |
25 | This plan step retrieves all ROWIDs from the B*-tree index XPKCLM_OVERRIDE_PYMNTS by walking the index starting with its smallest key. | 209 | 2,308 | 33.809 |
26 | This plan step accepts multiple sets of rows. Rows from the first set are eliminated using the data found in the second through n sets. |
27 | This plan step accepts a set of rows from its child node, and sorts them into groups based on the columns specified in the query's GROUP BY clause. | 350,073 | 1 | 0.219 |
28 | This plan step retrieves one or more ROWIDs in ascending order by scanning the B*-tree index IND_MDL_INT. | 59 | 3,890 | -- |
29 | This plan step retrieves rows from table COM_MODULE_INTM through ROWID(s) returned by an index. | 125 | 3,890 | 49.385 |
30 | This plan step retrieves one or more ROWIDs in ascending order by scanning the B*-tree index IND_CTIH_VOUPASS_IND. | 3 | 1 | -- |
31 | This plan step joins two sets of rows by iterating over the driving, or outer, row set (the first child of the join) and, for each row, carrying out the steps of the inner row set (the second child). Corresponding pairs of rows are tested against the join condition specified in the query's WHERE clause. | 9,480 | 3,890 | 155.752 |
32 | This plan step retrieves rows from table COM_TRANS_INT_HDR through ROWID(s) returned by an index. | 3 | 1 | 0.027 |
33 | This plan step accepts a row set (its only child) and sorts it in order to identify and eliminate duplicates. | -- | 3,890 | 155.752 |
34 | This plan step represents the execution plan for the subquery defined by the view . | 9,480 | 3,890 | 56.982 |
35 | This plan step retrieves all rows from table FIN_VOU_HDR. | 341,960 | 15,724,706 | 691,027.119 |
36 | This plan step accepts two sets of rows, each from a different table. A hash table is built using the rows returned by the first child. Each row returned by the second child is then used to probe the hash table to find row pairs which satisfy a condition specified in the query's WHERE clause. Note: The Oracle cost-based optimizer will build the hash table using what it thinks is the smaller of the two tables. It uses the statistics to determine which is smaller, so out of date statistics could cause the optimizer to make the wrong choice. | 351,870 | 1,669 | 97.793 |
37 | This plan step retrieves all rows from table CLM_OVERRIDE_PYMNTS. | 195 | 44,754 | 4,589.033 |
38 | This plan step accepts two sets of rows, each from a different table. A hash table is built using the rows returned by the first child. Each row returned by the second child is then used to probe the hash table to find row pairs which satisfy a condition specified in the query's WHERE clause. Note: The Oracle cost-based optimizer will build the hash table using what it thinks is the smaller of the two tables. It uses the statistics to determine which is smaller, so out of date statistics could cause the optimizer to make the wrong choice. | 352,067 | 2 | 0.322 |
39 | This plan step retrieves a single ROWID from the B*-tree index XPKFIN_VOU_PMT_DTL. | 2 | 1 | 0.021 |
40 | This plan step joins two sets of rows by iterating over the driving, or outer, row set (the first child of the join) and, for each row, carrying out the steps of the inner row set (the second child). Corresponding pairs of rows are tested against the join condition specified in the query's WHERE clause. | 352,069 | 1 | 0.182 |
41 | This plan step retrieves one or more ROWIDs in ascending order by scanning the B*-tree index XPKFIN_VOU_CSHBNK. | 4 | 1 | -- |
42 | This plan step retrieves rows from table FIN_VOU_CSHBNK through ROWID(s) returned by an index. | 4 | 1 | 0.031 |
43 | This plan step joins two sets of rows by iterating over the driving, or outer, row set (the first child of the join) and, for each row, carrying out the steps of the inner row set (the second child). Corresponding pairs of rows are tested against the join condition specified in the query's WHERE clause. | 352,072 | 1 | 0.213 |
44 | This plan step retrieves a single ROWID from the B*-tree index XPKCOM_POLICY_M. | 2 | 1 | -- |
45 | This plan step retrieves rows from table COM_POLICY_M through ROWID(s) returned by an index. | 2 | 1 | 0.018 |
46 | This plan step joins two sets of rows by iterating over the driving, or outer, row set (the first child of the join) and, for each row, carrying out the steps of the inner row set (the second child). Corresponding pairs of rows are tested against the join condition specified in the query's WHERE clause. | 352,073 | 1 | 0.23 |
47 | This plan step accepts a set of rows from its child node, and sorts them into groups based on the columns specified in the query's GROUP BY clause. | 352,074 | 1 | 0.23 |
48 | This plan step accepts multiple sets of rows, and combines them into one set including all duplicates. |
49 | This plan step accepts a row set (its only child) and sorts it in order to identify and eliminate duplicates. | 1,008,374 | 3 | 0.685 |
50 | This plan step retrieves all of the ROWIDs of B*-tree index PK_GROUP_ACCOUNT_M by sequentially scanning the leaf nodes. | 15 | 19,562 | 324.76 |
51 | This plan step retrieves all of the ROWIDs of B*-tree index INDX_COM_GROUP_M by sequentially scanning the leaf nodes. | 49 | 64,613 | 1,135.775 |
52 | This plan step retrieves all rows from table COM_CLIENT_ADDRESS. | 12,916 | 1,196,537 | 78,289.042 |
53 | This plan step retrieves all rows from table COM_CLIENT_M. | 18,493 | 4,825,487 | 56,548.676 |
54 | This plan step accepts two sets of rows, each from a different table. A hash table is built using the rows returned by the first child. Each row returned by the second child is then used to probe the hash table to find row pairs which satisfy a condition specified in the query's WHERE clause. Note: The Oracle cost-based optimizer will build the hash table using what it thinks is the smaller of the two tables. It uses the statistics to determine which is smaller, so out of date statistics could cause the optimizer to make the wrong choice. | 36,682 | 1,196,537 | 92,310.96 |
55 | This plan step accepts two sets of rows, each from a different table. A hash table is built using the rows returned by the first child. Each row returned by the second child is then used to probe the hash table to find row pairs which satisfy a condition specified in the query's WHERE clause. Note: The Oracle cost-based optimizer will build the hash table using what it thinks is the smaller of the two tables. It uses the statistics to determine which is smaller, so out of date statistics could cause the optimizer to make the wrong choice. | 39,413 | 16,022 | 1,517.709 |
56 | This plan step accepts two sets of rows, each from a different table. A hash table is built using the rows returned by the first child. Each row returned by the second child is then used to probe the hash table to find row pairs which satisfy a condition specified in the query's WHERE clause. Note: The Oracle cost-based optimizer will build the hash table using what it thinks is the smaller of the two tables. It uses the statistics to determine which is smaller, so out of date statistics could cause the optimizer to make the wrong choice. | 39,430 | 4,851 | 540.053 |
57 | This plan step retrieves one or more ROWIDs in ascending order by scanning the B*-tree index INDX_FVHDR_NBASEDOCTY_NBR. | 4 | 79 | -- |
58 | This plan step joins two sets of rows by iterating over the driving, or outer, row set (the first child of the join) and, for each row, carrying out the steps of the inner row set (the second child). Corresponding pairs of rows are tested against the join condition specified in the query's WHERE clause. | 296,151 | 97,066 | 15,071.771 |
59 | This plan step retrieves rows from table FIN_VOU_HDR through ROWID(s) returned by an index. | 53 | 20 | 0.879 |
60 | This plan step retrieves one or more ROWIDs in ascending order by scanning the B*-tree index IND_MDL_INT. | 59 | 3,890 | -- |
61 | This plan step retrieves rows from table COM_MODULE_INTM through ROWID(s) returned by an index. | 125 | 3,890 | 49.385 |
62 | This plan step retrieves one or more ROWIDs in ascending order by scanning the B*-tree index IND_CTIH_VOUPASS_IND. | 3 | 1 | -- |
63 | This plan step joins two sets of rows by iterating over the driving, or outer, row set (the first child of the join) and, for each row, carrying out the steps of the inner row set (the second child). Corresponding pairs of rows are tested against the join condition specified in the query's WHERE clause. | 9,480 | 3,890 | 155.752 |
64 | This plan step retrieves rows from table COM_TRANS_INT_HDR through ROWID(s) returned by an index. | 3 | 1 | 0.027 |
65 | This plan step represents the execution plan for the subquery defined by the view . | 9,480 | 3,890 | 56.982 |
66 | This plan step accepts two sets of rows, each from a different table. A hash table is built using the rows returned by the first child. Each row returned by the second child is then used to probe the hash table to find row pairs which satisfy an EXISTS subquery condition specified in the query's WHERE clause. Note: The Oracle cost-based optimizer will build the hash table using what it thinks is the smaller of the two tables. It uses the statistics to determine which is smaller, so out of date statistics could cause the optimizer to make the wrong choice. | 306,030 | 10 | 1.699 |
67 | This plan step retrieves a single ROWID from the B*-tree index XPKFIN_VOU_PMT_DTL. | 2 | 1 | -- |
68 | This plan step retrieves rows from table FIN_VOU_PMT_DTL through ROWID(s) returned by an index. | 2 | 1 | 0.034 |
69 | This plan step joins two sets of rows by iterating over the driving, or outer, row set (the first child of the join) and, for each row, carrying out the steps of the inner row set (the second child). Corresponding pairs of rows are tested against the join condition specified in the query's WHERE clause. | 306,046 | 4 | 0.816 |
70 | This plan step retrieves one or more ROWIDs in ascending order by scanning the B*-tree index XPKFIN_VOU_CSHBNK. | 4 | 1 | -- |
71 | This plan step joins two sets of rows by iterating over the driving, or outer, row set (the first child of the join) and, for each row, carrying out the steps of the inner row set (the second child). Corresponding pairs of rows are tested against the join condition specified in the query's WHERE clause. | 306,059 | 1 | 0.235 |
72 | This plan step retrieves rows from table FIN_VOU_CSHBNK through ROWID(s) returned by an index. | 4 | 1 | 0.031 |
73 | This plan step accepts a set of rows from its child node, and sorts them into groups based on the columns specified in the query's GROUP BY clause. | 306,060 | 1 | 0.235 |
74 | This plan step accepts multiple sets of rows, and combines them into one set including all duplicates. |
75 | This plan step designates this statement as an INSERT statement. | 1,008,374 | -- | -- |