/     !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~ contents[[Ljava/lang/Object;()VCodeLineNumberTable getContents()[[Ljava/lang/Object; SourceFile VtoqMsg.java  [Ljava/lang/Object;java/lang/Object3012 Explain Plan30013002OK3003Cancel3004Help3005Apply3009 Production3010Beta3011Debug3106%Connection to database does not exist3104Database version not supported.3105Error binding data3108Incorrect plan display format.3109Error making JDBC connection.3110Error parsing plan data 3113Plan table does not exist in the current schema. Please create the plan table using the utlxplan.sql script supplied with the database to create the plan table first.3297An invalid plan table found in the current schema. Please recreate the plan table using the utlxplan.sql script supplied with the database to create the plan table first.3115Unknown plan type 3117Error fetching explain plan.3118Error loading resources. 3119Error executing query : 3296Error dropping plan table : 3120!Cannot fetch explain plan data : 3121)Cannot change current session settings : 3123Cannot generate explain plan : 3122/Failed to delete temporary explain plan data : 31144Failed to create plan table in the current schema : 3124This could be because of insufficient privileges to execute the explain plan command on the underlying objects or because of unqualified object names in the sql.3208Rule3209Cost First Rows3210 Cost All Rows3211Choose3212Explain Cost: 3206OF3213Execution Step3214 Expected Rows3215 Object Owner3216 Object Name3217 Object Type3218 Join Method3219Partition Start3220Partition Stop3221 Partition ID3222 Object Node3223Other3224 Other Tag3006null3007true3008false3207VIEW3111+Unknown Explain Plan operation encountered.3112(Unknown Explain Plan option encountered.3116$Error closing database transaction. 3225wThis operation returns a single row by applying a group function to a group of selected rows from its child row source.3226MThis operation returns the distinct rows from its child row source, in order.3227kThis operation returns its child row source sorted into groups based on the columns of the GROUP BY clause.3228]This operation returns its child row source sorted in preparation for a merge-join operation.3229jThis operation returns its child row source sorted on a per-column basis depending on the ORDER BY clause.3230GThis operation retrieves all rows of table {0} using a full table scan.32889This operation retrieves rows from a sample of table {0}.3231_This operation retrieves rows of table {0} based on the value of the key of an indexed cluster.3232[This operation retrieves rows of table {0} based on the value of the key of a hash cluster.3233?This operation retrieves a row of table {0} based on its ROWID.3234jThis operation accepts two sets of rows and returns the conglomerate of both sets, eliminating duplicates.3235lThis operation accepts two sets of rows and returns the conglomerate of both sets, including all duplicates.3236CThis operation yields the result of performing the query of view%s.3237DThis operation represents a table access to the internal table, {0}.3238FThis step in the plan designates this statement as a SELECT statement.3239GThis step in the plan designates this statement as an UPDATE statement.3240FThis step in the plan designates this statement as a DELETE statement.3241AThis operation represents an index lookup using domain index {0}.3242This step describes partition boundaries applicable to a single partitioned object or to a set of equi-partitioned objects where the partition is based on a hash function.3243This operation performs an anti join by taking its two child row sources and hashing their join columns to find row pairs which satisfy the join condition.3244This operation performs a semi join by taking its two child row sources and hashing their join columns to find row pairs which satisfy the join condition.3245UThis operation converts a bitmap index entry, returned by the child node, to a ROWID.3246AThis operation represents an index lookup using bitmap index {0}.3247JThis operation merges several bitmap indexes into a single bitmap indexes.3248RThis operation subtracts the bits of the second bitmap index child from the first.3249=This operation computes the bitwise OR of two bitmap indexes.3250cThis operation represents an iteration over each element in the list represented by its child node.3251This operation denotes a cartesian product between its two children row sources. Cartesian products are extremely inefficient.3252WThis operation converts a ROWID, returned from the child node, to a bitmap index entry.3253GThis step in the plan designates this statement as an INSERT statement.3254CThis operation retrieves all ROWIDs via a full index lookup of {0}.3289AThis operation retrieves ROWID via a min/max lookup of index {0}.3255This step describes partition boundaries applicable to a single partitioned object or to a set of equi-partitioned objects where the partition is based on a range of ROWIDs.3256This operation produces a row set that is sorted in order to determine uniqueness. However, no sort is actually needed at this step because the child operation's result set is already sorted.3294This operation returns its child row source sorted into groups based on the values of the first n, n-1, n-2, ... 0 expressions for each row.3257[This operation returns intersection of the ROWIDs collected by single-column index lookups.3258uThis operation reorders the rows so that they are retrieved hierarchically (parent rows precede their children rows).3259HThis operation performs the non-distinct union of its child row sources.3260AThis operation counts the number of rows in its child row source.3261This operation counts the number of rows in its child row source, but the number of rows counted is limited to the ROWNUM value in the WHERE clause.3262\This operation takes a row source and rejects some of the rows, returning the accepted rows.3263>This operation returns only the first row of a query's result.3264FThis operation locks the row source, preparing its rows to be updated.3265BThis operation retrieves a single ROWID by an index lookup of {0}.3266RThis operation retrieves multiple ROWIDs in ascending order by scanning index {0}.3267SThis operation retrieves multiple ROWIDs in descending order by scanning index {0}.3268This operation returns the set of rows in the first child row source which are also in the second child row source, eliminating duplicates.3269lThis operation merges its first child (pre-sorted) row source with its second child (pre-sorted) row source.3270This operation performs an outer join by merging its first child (pre-sorted) row source with its second child (pre-sorted) row source.3271This operation returns the set of rows in its first child row source which are not in its second child row source, eliminating duplicates.3272This operation compares each row of its first child row source with all rows of its second child row source, joining those row pairs for which some condition holds.3273This operation performs an outer join by comparing each row of its first child row source with all rows of its second child row source, joining those row pairs for which some condition holds.3274;This step is an internal operation performed by the server.3275YThis operation retrieves rows from a remote database identified by the database link {0}.32763This operation accesses values in the sequence {0}.3277{This step describes partition boundaries applicable to a single partitioned object or to a set of equi-partitioned objects.3278This operation performs an outer join by taking its two child row sources and hashing their join columns to find row pairs which satisfy the join condition.3279This operation takes its two child row sources and hashes their join columns to find row pairs which satisfy the join condition.3287No step selected3290Explain Plan Rule:3291#Explain Plan Cost First (Cost {0}):3292!Explain Plan Cost All (Cost {0}):3293Explain Plan Choose:3280Start Plan Walk3281 Next Step3282 Previous Step3283Explain Plan Rule3284Explain Plan Cost First3298Stupid3285Explain Plan Cost All3286Explain Plan Choose3295oracle/sysman/resources/VtoqMsgjava/util/ListResourceBundle!oracle/sysman/resources/VtoqMsgID!* }YYSYSSYYSYSSYYSY SSYY SY SSYY SY SSYYSYSSYYSYSSYYSYSSYYSYSSY YSYSSY YSYSSY YSYSSY YSYSSY YSYSSYY SY!SSYY"SY#SSYY$SY%SSYY&SY'SSYY(SY)SSYY*SY+SSYY,SY-SSYY.SY/SSYY0SY1SSYY2SY3SSYY4SY5SSYY6SY7SSYY8SY9SSYY:SY;SSYYSY?SSYY@SYASSYYBSYCSSY YDSYESSY!YFSYGSSY"YHSYISSY#YJSYKSSY$YLSYMSSY%YNSYOSSY&YPSYQSSY'YRSYSSSY(YTSYUSSY)YVSYWSSY*YXSYYSSY+YZSY[SSY,Y\SY]SSY-Y^SY_SSY.Y`SYaSSY/YbSYcSSY0YdSYeSSY1YfSYgSSY2YhSYiSSY3YjSYkSSY4YlSYmSSY5YnSYoSSY6YpSYqSSY7YrSYsSSY8YtSYuSSY9YvSYwSSY:YxSYySSY;YzSY{SSY<Y|SY}SSY=Y~SYSSY>YSYSSY?YSYSSY@YSYSSYAYSYSSYBYSYSSYCYSYSSYDYSYSSYEYSYSSYFYSYSSYGYSYSSYHYSYSSYIYSYSSYJYSYSSYKYSYSSYLYSYSSYMYSYSSYNYSYSSYOYSYSSYPYSYSSYQYSYSSYRYSYSSYSYSYSSYTYSYSSYUYSYSSYVYSYSSYWYSYSSYXYSYSSYYYSYSSYZYSYSSY[YSYSSY\YSYSSY]YSYSSY^YSYSSY_YSYSSY`YSYSSYaYSYSSYbYSYSSYcYSYSSYdYSYSSYeYSYSSYfYSYSSYgYSYSSYhYSYSSYiYSYSSYjYSYSSYkYSYSSYlYSYSSYmYSYSSYnYSYSSYoYSYSSYpYSYSSYqYSYSSYrYSYSSYsYSYSSYtYSYSSYuYSYSSYvYSYSSYwYSYSSYxYSYSSYyYSYSSYzYSYSSY{YSYSSY|YSYSS