Edit D:\app\Administrator\product\11.2.0\dbhome_1\owb\lib\int\oracle\sysman\resources\VtoqMsg.class

??���/

�?	�?
 !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????�	�contents�[[Ljava/lang/Object;�<init>�()V�Code�LineNumberTable�getContents�()[[Ljava/lang/Object;�<clinit>�
SourceFile�VtoqMsg.java��[Ljava/lang/Object;�java/lang/Object�3012�Explain Plan�3001�3002�OK�3003�Cancel�3004�Help�3005�Apply�3009�
Production�3010�Beta�3011�Debug�3106�%Connection to database does not exist�3104�Database version not supported.�3105�Error binding data�3108�Incorrect plan display format.�3109�Error making JDBC connection.�3110�Error parsing plan data �3113�?lan 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.�3297�?n 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.�3115�Unknown plan type �3117�Error fetching explain plan.�3118�Error loading resources. �3119�Error executing query : �3296�Error dropping plan table : �3120�!Cannot fetch explain plan data : �3121�)Cannot change current session settings : �3123�Cannot generate explain plan : �3122�/Failed to delete temporary explain plan data : �3114�4Failed to create plan table in the current schema : �3124�?his 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.�3208�Rule�3209�Cost First Rows�3210�
Cost All Rows�3211�Choose�3212�Explain Cost: �3206�OF�3213�Execution Step�3214�
Expected Rows�3215�Object Owner�3216�Object Name�3217�Object Type�3218�Join Method�3219�Partition Start�3220�Partition Stop�3221�Partition ID�3222�Object Node�3223�Other�3224�	Other Tag�3006�null�3007�true�3008�false�3207�VIEW�3111�+Unknown Explain Plan operation encountered.�3112�(Unknown Explain Plan option encountered.�3116�$Error closing database transaction. �3225�wThis operation returns a single row by applying a group function to a group of selected rows from its child row source.�3226�MThis operation returns the distinct rows from its child row source, in order.�3227�kThis 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.�3229�jThis operation returns its child row source sorted on a per-column basis depending on the ORDER BY clause.�3230�GThis operation retrieves all rows of table {0} using a full table scan.�3288�9This 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.�3234�jThis operation accepts two sets of rows and returns the conglomerate of both sets, eliminating duplicates.�3235�lThis operation accepts two sets of rows and returns the conglomerate of both sets, including all duplicates.�3236�CThis operation yields the result of performing the query of view%s.�3237�DThis operation represents a table access to the internal table, {0}.�3238�FThis step in the plan designates this statement as a SELECT statement.�3239�GThis step in the plan designates this statement as an UPDATE statement.�3240�FThis step in the plan designates this statement as a DELETE statement.�3241�AThis operation represents an index lookup using domain index {0}.�3242�?his 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.�3243�?his 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.�3244�?his 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.�3245�UThis operation converts a bitmap index entry, returned by the child node, to a ROWID.�3246�AThis operation represents an index lookup using bitmap index {0}.�3247�JThis operation merges several bitmap indexes into a single bitmap indexes.�3248�RThis operation subtracts the bits of the second bitmap index child from the first.�3249�=This operation computes the bitwise OR of two bitmap indexes.�3250�cThis operation represents an iteration over each element in the list represented by its child node.�3251�This operation denotes a cartesian product between its two children row sources.  Cartesian products are extremely inefficient.�3252�WThis operation converts a ROWID, returned from the child node, to a bitmap index entry.�3253�GThis step in the plan designates this statement as an INSERT statement.�3254�CThis operation retrieves all ROWIDs via a full index lookup of {0}.�3289�AThis operation retrieves ROWID via a min/max lookup of index {0}.�3255�?his 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.�3256�?his 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.�3294�?his 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.�3258�uThis operation reorders the rows so that they are retrieved hierarchically (parent rows precede their children rows).�3259�HThis operation performs the non-distinct union of its child row sources.�3260�AThis operation counts the number of rows in its child row source.�3261�?his 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.�3264�FThis operation locks the row source, preparing its rows to be updated.�3265�BThis operation retrieves a single ROWID by an index lookup of {0}.�3266�RThis operation retrieves multiple ROWIDs in ascending order by scanning index {0}.�3267�SThis operation retrieves multiple ROWIDs in descending order by scanning index {0}.�3268�?his operation returns the set of rows in the first child row source which are also in the second child row source, eliminating duplicates.�3269�lThis operation merges its first child (pre-sorted) row source with its second child (pre-sorted) row source.�3270�?his operation performs an outer join by merging its first child (pre-sorted) row source with its second child (pre-sorted) row source.�3271�?his operation returns the set of rows in its first child row source which are not in its second child row source, eliminating duplicates.�3272�?his 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.�3273�?his 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.�3275�YThis operation retrieves rows from a remote database identified by the database link {0}.�3276�3This 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.�3278�?his 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.�3279�?This operation takes its two child row sources and hashes their join columns to find row pairs which satisfy the join condition.�3287�No step selected�3290�Explain Plan Rule:�3291�#Explain Plan Cost First (Cost {0}):�3292�!Explain Plan Cost All (Cost {0}):�3293�Explain Plan Choose:�3280�Start Plan Walk�3281�	Next Step�3282�
Previous Step�3283�Explain Plan Rule�3284�Explain Plan Cost First�3298�Stupid�3285�Explain Plan Cost All�3286�Explain Plan Choose�3295�oracle/sysman/resources/VtoqMsg�java/util/ListResourceBundle�!oracle/sysman/resources/VtoqMsgID�!�?�?��?����������������*?�?����������
����������?�?��������������?�����?}?�Y?�YSYSSY?�YSYSSY?�YSY	SSY?�Y
SYSSY?�YSY
SSY?�YSYSSY?�YSYSSY?�YSYSSY?�YSYSSY	?�YSYSSY
?�YSYSSY?�YSYSSY?�YSYSSY
?�YSYSSY?�Y SY!SSY?�Y"SY#SSY?�Y$SY%SSY?�Y&SY'SSY?�Y(SY)SSY?�Y*SY+SSY?�Y,SY-SSY?�Y.SY/SSY?�Y0SY1SSY?�Y2SY3SSY?�Y4SY5SSY?�Y6SY7SSY?�Y8SY9SSY?�Y:SY;SSY?�Y<SY=SSY?�Y>SY?SSY?�Y@SYASSY?�YBSYCSSY ?�YDSYESSY!?�YFSYGSSY"?�YHSYISSY#?�YJSYKSSY$?�YLSYMSSY%?�YNSYOSSY&?�YPSYQSSY'?�YRSYSSSY(?�YTSYUSSY)?�YVSYWSSY*?�YXSYYSSY+?�YZSY[SSY,?�Y\SY]SSY-?�Y^SY_SSY.?�Y`SYaSSY/?�YbSYcSSY0?�YdSYeSSY1?�YfSYgSSY2?�YhSYiSSY3?�YjSYkSSY4?�YlSYmSSY5?�YnSYoSSY6?�YpSYqSSY7?�YrSYsSSY8?�YtSYuSSY9?�YvSYwSSY:?�YxSYySSY;?�YzSY{SSY<?�Y|SY}SSY=?�Y~SYSSY>?�Y?SY?SY??�Y?Y?SY@?�Y?Y?SYA?�Y?Y?SYB?�Y?Y?SYC?�Y?Y?SYD?�Y?Y?SYE?�Y?Y?SYF?�Y?Y?SYG?�Y?Y?SYH?�Y?Y?SYI?�Y?Y?SYJ?�Y?Y?SYK?�Y?Y?SYL?�Y?Y?SYM?�Y?Y?SYN?�Y?Y?SYO?�Y?Y?SYP?�Y?Y?SYQ?�Y?Y?SYR?�Y?Y?SYS?�Y?Y?SYT?�Y?Y?SYU?�Y?Y?SYV?�Y?Y?SYW?�Y?Y?SYX?�Y?Y?SYY?�Y?Y?SYZ?�Y?Y?SY[?�Y?Y?SY\?�Y?Y?SY]?�Y?Y?SY^?�Y?Y?SY_?�Y?Y?SY`?�Y?Y?SYa?�Y?Y?SYb?�Y?Y?SYc?�Y?Y?SYd?�Y?Y?SYe?�Y?Y?SYf?�Y?Y?SYg?�Y?Y?SYh?�Y?Y?SYi?�Y?Y?SYj?�Y?Y?SYk?�Y?Y?SYl?�Y?Y?SYm?�Y?Y?SYn?�Y?Y?SYo?�Y?Y?SYp?�Y?Y?SYq?�Y?Y?SYr?�Y?Y?SYs?�Y?Y?SYt?�Y?Y?SYu?�Y?Y?SYv?�Y?Y?SYw?�Y?Y?SYx?�Y?Y?SYy?�Y?Y?SYz?�Y?Y?SY{?�Y?Y?SY|?�Y?Y?S?�?�����������	���

Ms-Dos/Windows Unix Write backup

jsp File Browser version 1.2 by www.vonloesch.de