Planning queries
We are on 11.5.10 and planning an implementation of planning. I have queries, can someone answer please. Also, I raised tar 7541116.993 for errors that we are experiencing during the charge.(1) this product does not support updates to existing configurations? I see this option only for rare items.
(2) I don't see the option to filter for certain objects. For example the cost of billing shipping network, BOMs,.
etc.
(3) we are facing some problems with the API when data is loaded in the target instance. TAR 7541116.993 raised for the same thing.
Thank you
Shilpa.
In the interest of other clients.
#1. It depends on the APIs to support for the update of existing records. Planning product/framework as such nothing to do with it. If you find this update is not supported, you can connect SR against the specific product families for support.
#2. Have you taken high 11i.AZ. H.Delta.2 patch? Filter option is supported on most of the APIs. You can customize option filter for API as well. I have already published metalink note on it.
Tags: Oracle Applications
Similar Questions
-
How to check the plan and statistics of queries written in block PLSQL
Hi all
I have a production database (11.2.0.3.0) on which I will only select access on the tables and sign in plsql from another schema. I do not have access to the file system, I can connect only with sqlplus.
I have a procedure which is having 2-3 requests each have the array of objects used in type from clause. I want to check the plan and the stats of these queries. Can you help me please?
Thanks and greetings
Alexander gelin
Alexandre Gelin says:
Thanks Karthick_Arp. I use the same method until now, but it's tricky. I don't know how to get the query statistics.
You can define STATISTICS_LEVEL = ALL at the level of the session
ALTER session set statistics_level = all;
You can then run your package
And then
Select * from table (dbms_xplan.display_cursor (SQL_ID, null, 'ALLSTATS LAST'));
This you will get estimated and actual statistics with buffer and reading.
-
3 clues on 3 different columns, but explain plan shows full table scan for select queries
I have a table - used and have index - functional ind1 (upper (f_name)), index - (emp_id) ind2 ind3 (upper (l_name) functional on 3 columns diffferent - what, emp_id, l_name respectively.) Now when I check explain plans for sub queries, they all have two shows complete table for the employee of the table scan. FYI - employee table is non-parittioned.
Can someone tell me why 3 indices are not used here?
(1) select emp_id, upper (f_name), upper (l_name) of the employee
(2) select upper (f_name), mp_id, upper (l_name) of the employee
where upper (f_name) = upper (f_name)
and emp_id = emp_id
and upper (l_name) = upper (l_name)
If I can push oracle (version 11) to use these indexes somewho - maybe using tips? Any help is appreciated.
Observations: SQL> desc emp1; Name Null? Type ----------------------------------------- -------- ----------------- EMPID NOT NULL NUMBER F_NAME NOT NULL VARCHAR2(3) L_NAME NOT NULL VARCHAR2(3) SALARY NUMBER JOB_ROLE VARCHAR2(5) DEPTID NUMBER create index idx2 on emp1(empid); create index idx1 on emp1(upper(f_name) ); create index idx3 on emp1(f_name,empid, l_name); exec dbms_stats.gather_table_stats(user,'EMP1', cascade=>true); 8 rows selected. SQL> explain plan for 2 select /*+ index_join(e idx1 idx2 idx3)*/ upper(l_name),empid, upper(f_name) from emp1 e; Explained. SQL> select * from table(dbms_xplan.display); PLAN_TABLE_OUTPUT -------------------------------------------------------------------------------- Plan hash value: 3449967945 ------------------------------------------------------------------------- | Id | Operation | Name | Rows | Bytes | Cost (%CPU)| Time | ------------------------------------------------------------------------- | 0 | SELECT STATEMENT | | 20000 | 175K| 14 (0)| 00:00:01 | | 1 | INDEX FULL SCAN | IDX3 | 20000 | 175K| 14 (0)| 00:00:01 | ------------------------------------------------------------------------- 8 rows selected. SQL> explain plan for 2 select upper(f_name),empid,upper(l_name) from emp1 e; Explained. SQL> select * from table(dbms_xplan.display); PLAN_TABLE_OUTPUT -------------------------------------------------------------------------------- Plan hash value: 3449967945 ------------------------------------------------------------------------- | Id | Operation | Name | Rows | Bytes | Cost (%CPU)| Time | ------------------------------------------------------------------------- | 0 | SELECT STATEMENT | | 20000 | 175K| 14 (0)| 00:00:01 | | 1 | INDEX FULL SCAN | IDX3 | 20000 | 175K| 14 (0)| 00:00:01 | ------------------------------------------------------------------------- 8 rows selected. SQL> explain plan for 2 select /*+ index_ffs(e idx3)*/ upper(l_name),empid, upper(f_name) from emp1 e; Explained. SQL> select * from table(dbms_xplan.display); PLAN_TABLE_OUTPUT -------------------------------------------------------------------------------- Plan hash value: 2496145112 ----------------------------------------------------------------------------- | Id | Operation | Name | Rows | Bytes | Cost (%CPU)| Time | ----------------------------------------------------------------------------- | 0 | SELECT STATEMENT | | 20000 | 175K| 14 (0)| 00:00:01 | | 1 | INDEX FAST FULL SCAN| IDX3 | 20000 | 175K| 14 (0)| 00:00:01 | ----------------------------------------------------------------------------- 8 rows selected. SQL> explain plan for 2 select /*+ index(e idx3)*/ upper(l_name),empid, upper(f_name) from emp1 e; Explained. SQL> select * from table(dbms_xplan.display); PLAN_TABLE_OUTPUT -------------------------------------------------------------------------------- Plan hash value: 3449967945 ------------------------------------------------------------------------- | Id | Operation | Name | Rows | Bytes | Cost (%CPU)| Time | ------------------------------------------------------------------------- | 0 | SELECT STATEMENT | | 20000 | 175K| 14 (0)| 00:00:01 | | 1 | INDEX FULL SCAN | IDX3 | 20000 | 175K| 14 (0)| 00:00:01 | ------------------------------------------------------------------------- 8 rows selected. SQL> explain plan for 2 select upper(f_name),empid,upper(l_name) from emp1 e; Explained. SQL> select * from table(dbms_xplan.display); PLAN_TABLE_OUTPUT -------------------------------------------------------------------------------- Plan hash value: 3449967945 ------------------------------------------------------------------------- | Id | Operation | Name | Rows | Bytes | Cost (%CPU)| Time | ------------------------------------------------------------------------- | 0 | SELECT STATEMENT | | 20000 | 175K| 14 (0)| 00:00:01 | | 1 | INDEX FULL SCAN | IDX3 | 20000 | 175K| 14 (0)| 00:00:01 | ------------------------------------------------------------------------- 8 rows selected. SQL> drop index idx3; Index dropped. SQL> explain plan for 2 select upper(l_name),empid, upper(f_name) from emp1 e; Explained. SQL> select * from table(dbms_xplan.display); PLAN_TABLE_OUTPUT -------------------------------------------------------------------------------- Plan hash value: 3330885630 -------------------------------------------------------------------------- | Id | Operation | Name | Rows | Bytes | Cost (%CPU)| Time | -------------------------------------------------------------------------- | 0 | SELECT STATEMENT | | 20000 | 175K| 18 (0)| 00:00:01 | | 1 | TABLE ACCESS FULL| EMP1 | 20000 | 175K| 18 (0)| 00:00:01 | -------------------------------------------------------------------------- 8 rows selected. SQL> create index idx3 on emp1(f_name,empid, l_name ); Index created. SQL> explain plan for 2 select upper(l_name),empid, upper(f_name) from emp1 e; Explained. SQL> select * from table(dbms_xplan.display); PLAN_TABLE_OUTPUT -------------------------------------------------------------------------------- Plan hash value: 3449967945 ------------------------------------------------------------------------- | Id | Operation | Name | Rows | Bytes | Cost (%CPU)| Time | ------------------------------------------------------------------------- | 0 | SELECT STATEMENT | | 20000 | 175K| 14 (0)| 00:00:01 | | 1 | INDEX FULL SCAN | IDX3 | 20000 | 175K| 14 (0)| 00:00:01 |
-
Hyperion security: Planning/Essbase/HFM newspapers queries
Hello world
I installed 11.1.2.1 Hyperion and its all on the newspapers of Hyperion Essbase/Planning/HFM in which I've been caught below queries:
- If the process of registration of the request of Hyperion Essbase/Planning/HFM is enabled or disabled by someone, it is captured in any newspaper?
- If changes are made to one of the Planning/Essbase/HFM application events, then he is captured in any newspaper?
- If changes are made to one of the Planning/Essbase/HFM configuration files that affect the start to the top of the application, then he is captured in any newspaper?
- If the Planning/Essbase/HFM application is started or stopped, then he is captured in any newspaper?
- Is the successful connection, rejected the methods of access and login (for example: If an unauthorized user attempts to access to the Application of Essbase/Planning/HFM, then are the details of the user, the IP address from which it is accessed, etc.) captured in any newspaper?
- All activities are performed by privileged users (IE users with root/admin/power access application) at the request of Essbase/Planning/HFM captured in any newspaper?
- If there is no change in the user's privileges, then it is captured in any newspaper?
- If a user has chosen to make a transaction on an account, then at least the username, the date and time of access must be recorded to ensure that records are accessible by the valid user, having captured for any newspaper?
- If the system contains sensitive data, the system must be able to produce the event logs indicating if a user has accessed, displays or something, which can be useful at a later point in time, is that it is captured in any newspaper?
- If a user privileges is changed (for example: simple user to admin user), then he is captured in any newspaper?
- If all connections are established from application FTP or inetd, it is captured in any newspaper?
- Is the syslog facility AUTH messages captured in any newspaper?
- CRON is log messages in any newspaper?
- SSH is log messages in any newspaper?
Thank you
Sunny
Hi Sunny,
Here are a few interview questions?
You should be able to get information on the EPM connection Install-config troubleshooting guide.
Check here: Installation and Configuration Troubleshooting GuideKind regards
Santy.
-
Plan of the hash value for two queries!
Hello
DB: Oracle 11g (11.2.0.3.0)
OS: RHEL 5
I have two question:
1. can two queries have the same hash value of the plan? I mean I have here are two queries:
SELECT /+ NO_MERGE * / MIN (payor.next_review_date). *
* Payer from *.
* WHERE payor.review_complete = 0 *.
* AND payor.closing_date IS NULL *.
* AND payor.patient_key = 10; *
and
SELECT MIN (payor.next_review_date)
* Payer from *.
* WHERE payor.review_complete = 0 *.
* AND payor.closing_date IS NULL *.
* AND payor.patient_key = 10; *
When I tried to examine the execution plan for the two motions, the hash value of the plan remains the same. This means that implementation plan for both queries are same? If so, then how Oracle includes or changes to the execution plan based on hint. If not, then what hash value of the plan represents?
2. If the plan with suspicion, and without suspicion is identical except for a given query except the number of lines and bytes. Do you mean this query with fewer lines and scanned bytes is better?
Thanks in advance
-Onkar>
1. can two queries have the same hash value of the plan?
>
Yes - as already said - but it's not just because of tips.Here is the example code that I use to show that Oracle does NOT simply use a text version of the query that you propose and compute a hash of it.
These two queries are radically different but have the same hash value; Oracle are not different at all.set serveroutput on set autotrace traceonly select * from DEPT A, EMP B where A.DEPTNO=B.DEPTNO SQL> select * from DEPT A, EMP B 2 where A.DEPTNO=B.DEPTNO 3 / 14 rows selected. Execution Plan ---------------------------------------------------------- Plan hash value: 844388907 select * from (select * from DEPT) A, (select * from EMP) B WHERE A.DEPTNO = B.DEPTNO SQL> select * from 2 (select * from DEPT) A, (select * from EMP) B 3 WHERE A.DEPTNO = B.DEPTNO 4 / 14 rows selected. Execution Plan ---------------------------------------------------------- Plan hash value: 844388907 -
Error getting query plans for queries involving logical operators
I'm trying to gather information to improve the performance of queries for an application I am running using Oracle Berkeley XML database version 2.4.16 with all available patches installed and have encountered problems in the documentation of my XQuery query plans. I hope that these problems also partly explain query performance problems I'm having.
Specifically, I use dbxml to start
qplan collection('browser')/*[@parentIndex='none']I have this make more complex as follows:
<XQuery>
<QueryPlanToAST>
<LevelFilterQP>
<StepQP axis="parent-of-attribute" uri="*" name="*" nodeType="element">
<ValueQP container="browser" index="node-attribute-equality-string" operation="eq" child="parentIndex" value="none"/>
</StepQP>
</LevelFilterQP>
</QueryPlanToAST>
</XQuery>
qplan collection('browser')/*[@parentIndex='none' and @uri='http://example.com/']NB: the above should have been: collection qplan ("browser") / * open_square_bracket @parentIndex = "none" and @uri = "http://example.com/" close_square_bracket
and the dbxml command-line utility responds with:
queryPlan failed, Wrong number of arguments.
This happens about any variation on this request where there are two conditions related (or gold) set term [].
An overview of what motivates the error would be very useful.
Thank you
Geoff Shuetrim
Published by: Geoff Shuetrim on February 6, 2009 14:26Hi Geoff,
Please apply "" or "" to your expression of qplan. "
Like this:qplan "collection('browser')/open_square_bracket[@a='b']"or
qplan 'collection("browser")/open_square_bracket[@a="b"]'Note: as stated above, use ' ' inside the phrase while using "" outside of expression and use ' ' inside the phrase while using "'outside the expression.
Published by: rucong.zhao on February 5, 2009 19:37
-
Queries Smartphones Rogers Blackberry Bold blackBerry - wireless and data Plan-
I talked to people at Rogers and have seen various posts, and I am VERY confused.
Currently, I have a new Blackberry "BOLD" (since 12/14/08) with
a data plan.
Issues related to the:
(1) if I'm on Wifi (checked under managed connections - service status) and I'm surfing Internet, do I get charged for usage under the Rogers data plan?
(2) if I'm on Wifi (checked as stated above) and I use the BB services
like Blackberry Messenger, which are charged according to the Rogers data plan?
My assumption has been that Wifi for browsing the Internet (using the Hotspot browser) should NOT pay i.e. does not pass by Rogers but services Blackberry (BB Messenger, my Gmail and Hotmail account) would be charged under the Rogers plan data through the network 3 G or Wifi.
Can you get it someone please let me know if the above is correct, because I'm quite confused.
Thanks in advance... Elliot
(1) if I use the Internet Hotspot browser using Wifi to surf the Internet, I should NOT charged under the plan of Rogers data... is this correct?
Yes is correct.
(2) there are I understand that Internet Hotspot browser does NOT work when Wifi is NOT working... is this correct?
Yes is correct.
My other post was on the features of the Blackberry like Blackberry Messenger, mobile.blackberry.com, do not work with Hotspot Wifi browser.
-
A few queries on the design of PA
Hello
I'm working on a design of PA (1930-1990 MHz) 4W using Freescale LDMOS MW6S004N transistor (attached sheet). It would be very useful if someone could shed some light on the following queries;
1) I've traced the I - V curve and the Vgs as 2.77V (Vds = 28V, ID = 50mA) and biased the transistor with solenoid and BIASTEE elements to watch the gain and stability. But the gain is only around 7dB @ 1960 MHZ (while the data sheet shows a gain of 18 dB). Also, looking at the factors of stability, a MU1 MU2 is less than 0 and K<>
Yes, why is the only model not give the gain - without correspondence as other peripheral circuit?
Why is he unstable? It should be like that?
2) but when I increase the tensions of polarization, I see improving gain up to 10dB and then drop on a further increase of the voltage input/drain. So I'm not supposed to gain the necessary to the data sheet specified bias point?
3) in the datasheet, page nr.8, Zsource and Zload for the test circuit are specified for 1930, 1960 and 1990 MHz. So if I create the test as shown circuit (with input output matching and lines of bias) and make a measure of ZIN at the source and the load of the appliance, should not I should I get accurate impedances at these frequencies? This should be done in a scheme with infectious myonecrose or OMN only and without the device?
4) should I see the exact data sheet specified impedance if I do a pull source or load pull in the original circuit using LTUNER elements?
5) , How can I specify the magnitude and angle in the LTUNER element when I have a point of impedance in R + jX format? I have attached a screenshot of an example of AWR tutorial, but I don't see how the conversion was performed at mag
Pointers to these queries will help a lot! Thanks in advance.
1 & 2. It is a power FET; It has a very low output impedance; the datasheet shows the production capacity is 25pF. If so, I don't see how you get the desired gain when he puts an end to the output of 50 ohms. In addition, the specification of gain run 4W on. Look at an angle specified as class AB, so the small gain may not match upward with specifications, either.
3. If you build the circuit as described, I think lets you get results close to those that they specify. You can join the project?
4. you can ask Freescale, but my guess is that nothing will be exact. Follow patterns of the specific formulas, and despite the flexibility permitted by the various parameters on a FET, it is difficult to get behavior exactly measured in all conditions.
5. LTUNER is probably not the right choice, if you plan to do harmonic analysis balance; HBTUNER may be preferable because it allows to bypass the harmonics and send power to the rear. You can reduce the number of items in your base using HBTUNER2test circuit, which has built-in te through. If you double-click on one any of these elements of tuner, you will see the description of the Mag and Ang parameters, which States that they are for Gamma. So write some equations and convert z to gamma. The AWR design environment allows to describe the functions and can handle complex variables. For example, see the image as an attachment.
-
Cursor_Sharing = Force and queries with literal comparisons forcing FTS
Hi all
I have the following scenario:
- Oracle 11.2.0.3
- A 3rd party application, requiring cursor_sharing = TRUE
- A table (T2310) with an indexed field (C1000000161), which has no duplicate values
- Cause the Mode Cache = force (don't think it's relevant in the present case, but its here to justify its appearance in the explain output)
In this scenario, the 3rd party application run queries like the one below (I have to use the trick here, given that the explanation will not show the FTS):
SQL> select /*+ GATHER_PLAN_STATISTICS */ C1000000161 > from aradmin.T2310 > where C1000000161 = 'INC000002137945' or ('a' = 'b');This type of query will eventually force a full table scan:
SQL> SELECT * FROM table(DBMS_XPLAN.DISPLAY_CURSOR(FORMAT=>'ALLSTATS LAST')); PLAN_TABLE_OUTPUT -------------------------------------------------------------------------------------------------------------------- SQL_ID f3njwvkb0yf1x, child number 0 ------------------------------------- select /*+ GATHER_PLAN_STATISTICS */ C1000000161 from aradmin.T2310 where C1000000161 = :"SYS_B_0" or (:"SYS_B_1" = :"SYS_B_2") Plan hash value: 1862236576 -------------------------------------------------------------------------------------------------------------------- | Id | Operation | Name | Starts | E-Rows | A-Rows | A-Time | Buffers | Reads | -------------------------------------------------------------------------------------------------------------------- PLAN_TABLE_OUTPUT -------------------------------------------------------------------------------------------------------------------- | 0 | SELECT STATEMENT | | 1 | | 0 |00:03:00.20 | 3964K| 161K| | 1 | RESULT CACHE | bkhyzz7n945syc4numpbs27y20 | 1 | | 0 |00:03:00.20 | 3964K| 161K| |* 2 | TABLE ACCESS FULL| T2310 | 1 | 44030 | 0 |00:03:00.20 | 3964K| 161K| -------------------------------------------------------------------------------------------------------------------- Predicate Information (identified by operation id): --------------------------------------------------- 2 - filter((:SYS_B_1=:SYS_B_2 OR "T2310"."C1000000161"=:SYS_B_0)) Result Cache Information (identified by operation id): PLAN_TABLE_OUTPUT -------------------------------------------------------------------------------------------------------------------- ------------------------------------------------------ 1 -
As we can see in the explanation, literals are replaced with bind variables, and I think that it is forcing the FTS. If you remove the literal comparison, the index is used as intended.
So my question is: is it possible to avoid this behavior on the side of the database?
Thank you!
As you say, we have two possible plans, we want to either that each row in the table or we want to use our predicate of the column. If we let the plan for both possibilities should have acceptable performance for the typical case (: SYS_B_1<>: SYS_B_2) and correct the results in the case of equality.
If sql is rewritable I would do something like
Select / * + GATHER_PLAN_STATISTICS * / C1000000161
of t2310
where C1000000161 =: b1
and (: b2 <> : b3 or: b2 is null or: b3 is null)
Union of all the
Select C1000000161
of t2310
where: = b2: b3;The or_expand indicator (undocumented, but I find it more easy to set use_concat) could be useful to force the regime to take this shape without having to rewrite the query.
create table t2310 (pk_col, C1000000161 VARCHAR2 (100 CHAR), constraint t2310_pk primary key (pk_col));
create index t2310_161 on t2310 (C1000000161);
Insert into t2310
Select rownum, dbms_random.string ('U', 3) | To_char(rowNum,00000000000000)
of the double
connect by rownum<=>
commit;
exec dbms_Stats.gather_Table_stats (user, 't2310')
ALTER session set cursor_sharing = force;Select / * + OR_EXPAND(t2310 C1000000161) GATHER_PLAN_STATISTICS * / C1000000161
of t2310
where C1000000161 = 'INC000002137946' or ("a" = "b");
SELECT * FROM table (DBMS_XPLAN. DISPLAY_CURSOR (FORMAT-ONLINE 'ALLSTATS LAST'));Hash value of plan: 928588817
-------------------------------------------------------------------------------------------
| ID | Operation | Name | Begins | E - lines. A - lines. A - time | Pads |
-------------------------------------------------------------------------------------------
| 0 | SELECT STATEMENT | | 1. | 0 | 00:00:00.01 | 2.
| 1. CONCATENATION. | 1. | 0 | 00:00:00.01 | 2.
|* 2 | INDEX RANGE SCAN | T2310_161 | 1. 6. 0 | 00:00:00.01 | 2.
|* 3 | FILTER | | 1. | 0 | 00:00:00.01 | 0 |
|* 4 | TABLE ACCESS FULL | T2310 | 0 | 99994 | 0 | 00:00:00.01 | 0 |
-------------------------------------------------------------------------------------------Information of predicates (identified by the operation identity card):
---------------------------------------------------2 - access("C1000000161"=:SYS_B_0)
3 - filter(:SYS_B_1=:SYS_B_2)
4 filter (LNNVL ("C1000000161" =: SYS_B_0))Now, you can use a plan for this sql database attach to the sql application:
Select / * + GATHER_PLAN_STATISTICS * / C1000000161
of t2310
where C1000000161 = 'INC000002137946' or ("a" = "b");
SELECT * FROM table (DBMS_XPLAN. DISPLAY_CURSOR (FORMAT-ONLINE 'ALLSTATS LAST'));Hash value of plan: 1862236576
-------------------------------------------------------------------------------------
| ID | Operation | Name | Begins | E - lines. A - lines. A - time | Pads |
-------------------------------------------------------------------------------------
| 0 | SELECT STATEMENT | | 1. | 0 | 00:00:00.03 | 248.
|* 1 | TABLE ACCESS FULL | T2310 | 1. 1006 | 0 | 00:00:00.03 | 248.
-------------------------------------------------------------------------------------Information of predicates (identified by the operation identity card):
---------------------------------------------------1 Filter ((: SYS_B_1 =: SYS_B_2 or "C1000000161" =: SYS_B_0))
@sql_find t2310
CHILD_NUMBER PLAN_HASH_VALUE LAST_ACTIVE_TIME EXECUTIONS SQL_TEXT SQL_ID
------------- ------------ --------------- ------------------- ---------- ----------------------------------------------------------------------------------------------------
34k49g78s1w5w 453626665 04/01/2016 0 22:55:11 1 Select / * + no_parallel_index (t, "T2310_PK") cursor_sharing_exact use_weak_name_resl dyn dbms_stats
cnsa5smf77n8w 2274106110 04/01/2016 0 22:55:11 1 Select / * + no_parallel_index (t, "T2310_161") use_weak_name_resl cursor_sharing_exact, dbms_stats dy
1cyhgv72abcf5 928588817 04/01/2016 0 22:55:11 1 Select / * + OR_EXPAND(t2310 C1000000161) GATHER_PLAN_STATISTICS * / t2310 C1000000161 where C1000
gv84zvt3hagrk 1862236576 04/01/2016 0 22:55:11 1 Select / * + GATHER_PLAN_STATISTICS * / C1000000161 t2310 where C1000000161 =: 'SYS_B_0' or (: "SYS)
2z5dv340ttwc3 0 0 01/04/2016-22:55:11 1 BEGIN dbms_Stats.gather_Table_stats (user, 't2310'); END;number of plans of var
exec: plans: = dbms_spm.load_plans_from_cursor_cache(sql_id=>'gv84zvt3hagrk',plan_hash_value=>1862236576)print plans
PLANS
--------
1Select the SQL_HANDLE column, plan_name, sql_Text dba_sql_plan_baselines;
SQL_HANDLE PLAN_NAME SQL_TEXT
------------------------------ ------------------------------ ---------------------------------------------------------
SQL_32cad750b449f08a SQL_PLAN_35kqra2u4mw4a24696a58 select / * + GATHER_PLAN_STATISTICS * / C1000000161
of t2310
where C1000000161 =
exec: plans: = dbms_spm.load_plans_from_cursor_cache (sql_id-online '1cyhgv72abcf5', plan_hash_value-online 928588817, sql_handle => 'SQL_32cad750b449f08a')
Select the SQL_HANDLE column, plan_name, sql_Text dba_sql_plan_baselines;
SQL_HANDLE PLAN_NAME SQL_TEXT
------------------------------ ------------------------------ -----------------------------------------------------
SQL_32cad750b449f08a SQL_PLAN_35kqra2u4mw4a24696a58 select / * + GATHER_PLAN_STATISTICS * / C1000000161
of t2310
where C1000000161 =SQL_32cad750b449f08a SQL_PLAN_35kqra2u4mw4af7b73bde select / * + GATHER_PLAN_STATISTICS * / C1000000161
of t2310
where C1000000161 =exec: plans: = dbms_spm.alter_sql_plan_baseline(sql_handle=>'SQL_32cad750b449f08a',plan_name=>'SQL_PLAN_35kqra2u4mw4a24696a58',attribute_name=>'enabled',attribute_value=>'NO')
Select / * + GATHER_PLAN_STATISTICS * / C1000000161
of t2310
where C1000000161 = 'INC000002137946' or ("a" = "b");
SELECT * FROM table (DBMS_XPLAN. DISPLAY_CURSOR (FORMAT-ONLINE 'ALLSTATS LAST'));Hash value of plan: 928588817
-------------------------------------------------------------------------------------------
| ID | Operation | Name | Begins | E - lines. A - lines. A - time | Pads |
-------------------------------------------------------------------------------------------
| 0 | SELECT STATEMENT | | 1. | 0 | 00:00:00.01 | 2.
| 1. CONCATENATION. | 1. | 0 | 00:00:00.01 | 2.
|* 2 | INDEX RANGE SCAN | T2310_161 | 1. 6. 0 | 00:00:00.01 | 2.
|* 3 | FILTER | | 1. | 0 | 00:00:00.01 | 0 |
|* 4 | TABLE ACCESS FULL | T2310 | 0 | 99994 | 0 | 00:00:00.01 | 0 |
-------------------------------------------------------------------------------------------Information of predicates (identified by the operation identity card):
---------------------------------------------------2 - access("C1000000161"=:SYS_B_0)
3 - filter(:SYS_B_1=:SYS_B_2)
4 filter (LNNVL ("C1000000161" =: SYS_B_0))Note
-----
-Basic plan SQL SQL_PLAN_35kqra2u4mw4af7b73bde used for this statementAs you can see, line 4 is running at all because of the filter in line 3 (start = 0 where id = 4)
-
How can I improve record speed of 100 millions of queries?
How can I improve record speed of 100 millions of queries?
When I ask several condition they have queries slow about 200 to 500 seconds.
3070066 wrote:
How can I improve record speed of 100 millions of queries?
When I ask several condition they have queries slow about 200 to 500 seconds.
There are 4 ways.
Faster hardware, faster disks, more big pipes, I/O etc. In other words, reduce costs (depending on the time) to the IO has 100 million lines.
Parallel processing. Instead of a single process serialized bed a 100 million lines, using a 100 in parallel process, each reading of 1 million rows.
Planning of roads I/O better and faster the query whether does not read a 100 million lines, or to read a 100 million lines (of say only 1 KB each), reading a 100 million entries index (for example, 50 bytes).
Rethink the requirement of the business that requires reading/treatment one lines 100 million. Or rethink the model of data requiring a 100 million lines to deal with this requirement of the company.
There is no option 5, which uses a magic wand that can be rough to make this process quick. Analyze the performance of the query (based on the links already provided in responses above) is the first step in the process of identifying the real problem and how to solve it.
-
Hello world
I have a little a problem of performance on 12 c that gives me a little trouble at the head. I moved from 11 to 12 databases and no amendment of the application have been made. Our requests are generated somewhat dynamically, so that they are the same thing every time.
Let's start with the execution plan I get:
SQL > select * from table (dbms_xplan.display ());
PLAN_TABLE_OUTPUT
--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
Hash value of plan: 3567104424
-----------------------------------------------------------------------------------------------------------------------------------------------------------
| ID | Operation | Name | Lines | Bytes | Cost (% CPU). Time | TQ | IN-OUT | PQ Distrib.
-----------------------------------------------------------------------------------------------------------------------------------------------------------
| 0 | SELECT STATEMENT | | 55. 7095 | 3764 (1) | 00:00:01 | | | |
| 1. COORDINATOR OF PX | | | | | | | | |
| 2. PX SEND QC (ORDER). : TQ10006 | 55. 7095 | 3764 (1) | 00:00:01 | Q1, 06 | P > S | QC (ORDER).
| 3. SORT ORDER BY | | 55. 7095 | 3764 (1) | 00:00:01 | Q1, 06 | SVCP | |
| 4. PX RECEIVE | | 55. 7095 | 3763 (1) | 00:00:01 | Q1, 06 | SVCP | |
| 5. RANGE OF SEND PX | : TQ10005 | 55. 7095 | 3763 (1) | 00:00:01 | Q1, 05 | P > P | RANGE |
| 6. UNIQUE FATE | | 55. 7095 | 3763 (1) | 00:00:01 | Q1, 05 | SVCP | |
|* 7 | HASH JOIN | | 55. 7095 | 3762 (1) | 00:00:01 | Q1, 05 | SVCP | |
| 8. PX RECEIVE | | 801 | 50463 | 3696 (1) | 00:00:01 | Q1, 05 | SVCP | |
| 9. PX SEND HASH | : TQ10003 | 801 | 50463 | 3696 (1) | 00:00:01 | Q1, 03 | P > P | HASH |
| * 10 | HASH JOIN | | 801 | 50463 | 3696 (1) | 00:00:01 | Q1, 03 | SVCP | |
| 11. RECEIVE PX | | 801 | 40851 | 2333 (1) | 00:00:01 | Q1, 03 | SVCP | |
| 12. PX SEND BROADCAST | : TQ10002 | 801 | 40851 | 2333 (1) | 00:00:01 | Q1, 02 | P > P | BROADCAST |
| 13. NESTED LOOPS | | 801 | 40851 | 2333 (1) | 00:00:01 | Q1, 02 | SVCP | |
| 14. KIND OF BUFFER. | | | | | Q1, 02 | ISSUE | |
| 15. RECEIVE PX | | | | | | Q1, 02 | SVCP | |
| 16. PX SEND HASH | : TQ10000 | | | | | | S > P | HASH |
| 17. NESTED LOOPS | | 823. 31274 | 1509 (1) | 00:00:01 | | | |
| * 18. TABLE ACCESS BY ROWID INDEX BATCH | PAGED_LOOKUP_PKS | 500 | 9500 | 3 (0) | 00:00:01 | | | |
| * 19. INDEX RANGE SCAN | PAGED_LOOKUP_PKS_IDX2 | 1. | 2 (0) | 00:00:01 | | | |
| 20. TABLE ACCESS BY ROWID INDEX BATCH | BILL_ITEM | 2. 38. 4 (0) | 00:00:01 | | | |
| * 21. INDEX RANGE SCAN | BILL_ITEM_FK2 | 4. | 2 (0) | 00:00:01 | | | |
| * 22. INDEX UNIQUE SCAN | PK_INSERTION | 1. 13. 1 (0) | 00:00:01 | Q1, 02 | SVCP | |
| 23. ITERATOR BLOCK PX | | 1548K | 17 M | 1353 (2) | 00:00:01 | Q1, 03 | ISSUE | |
| 24. FULL RESTRICTED INDEX SCAN FAST | BOOKING_ACCOUNT_1 | 1548K | 17 M | 1353 (2) | 00:00:01 | Q1, 03 | SVCP | |
| 25. PX RECEIVE | | 22037 | 1420K | 65 (2) | 00:00:01 | Q1, 05 | SVCP | |
| 26. PX SEND HASH | : TQ10004 | 22037 | 1420K | 65 (2) | 00:00:01 | Q1, 04 | S > P | HASH |
| 27. SELECTOR PX | | | | | | Q1, 04 | SCWC | |
| 28. TABLE ACCESS FULL | CONTACT | 22037 | 1420K | 65 (2) | 00:00:01 | Q1, 04 | SCWP | |
-----------------------------------------------------------------------------------------------------------------------------------------------------------
Information of predicates (identified by the operation identity card):
---------------------------------------------------
7 - access ("ACCOUNT_ID" ="ACCOUNT_ID")
10 - access ("BOOKING" ="BOOKING")
18 - filter("T1".") SEQUENCE_NO' < 501 AND "T1". ("' SEQUENCE_NO" > = 1).
19 - access("T1".") SESSION_ID '= 123456 AND 'T1'.' SEARCH_ID "= 25)
21 - access("T1".") N1 "=" BILL_ID")
22 - access ("BOOKING" = "BOOKING" AND "INSERTION_SET" = "INSERTION_SET" AND "INSERT"="INSERT")
Note
-----
-the dynamic statistics used: dynamic sampling (level = 2)
-This is an adaptation plan
-2 directives Plan Sql used for this statement
51 selected lines.
Elapsed time: 00:00:00.15
SQL > spool off
OK, now let's go through the problem:
- It's a development running on a virtual server, and which hosts a few other databases, so the parallel execution is not a good thing. parallel_degree_policy is set to MANUAL, parallel_max_servers and all other parallel_ limits are set to 1 and tables have been changed with the settings of NOPARALLEL. So why is the execution plan always generated with all stages of parallel execution? I don't seem to get rid of in 12 c
- Next mystery is that the said plan of the explain command is an adaptation plan, and yet I put the true optimizer_adaptive_reproting_only
- Now to the problem of effective enforcement, so I'm playing around with all these settings. The query runs for 3-4 seconds, returning around about 500 cases. However, in some cases this same query with the same input variable races for hours and if I can believe the AWR and ASH reports, read a good 180 GB of data. The main wait event is direct path read temp temp and writing.
This is not isolated to that one query. I have a few queries now that all display the same behavior, one of them running overnight. I don't seem to get to a standard nested loop execution plans.
The entire base is a database plug-in and I don't know I just missed something in the new features Guide.
Would appreciate some ideas.
Thank you
If you want to disable parallel execution, you must set parallel_max_servers to zero. Maybe the optimizer thinks he can use a parallel plan because parallel_max_servers is non-zero (even though the number of slaves available means that it will be serialized to a parallel plan).
Note that you have a ticket saying dynamic stats have been used. Maybe you have a 11 for optimizer_dynamic_sampling setting, and allowing Oracle to be very inventive with collection of samples and parallelism.
You have also 2 SQL instructions in game. These are the things that get associated with objects rather than the instructions, then perhaps someone has been playing with parallelism and managed to associate the parallelism with one of the tables in your query (I am not sure 100% that it is possible, just throw a suggestion). Take a look at the SQL used for education guidelines.
To give us a little more information, you can:
Shoot memory execution plan dbms_xplan.display_cursor ({sql_id}, {number of children}, 'ALL'));
We show all the parallel settings (see setting the parallel)
Pull on the parameters of the optimizer for query memory (select name, value of V$ sql_optimizer_env where sql_id = {your sql identifier} and child_number = {your child number})
Concerning
Jonathan Lewis
-
Hi all
I use under version
Connected to Oracle Database 11g Express Edition Release 11.2.0.2.0
SQL > SELECT DEPTNO
DEPT 2
3. WHERE DEPTNO! = ALL
4 (DEPTNO SELECT FROM EMP WHERE DEPTNO IS NOT NULL);
DEPTNO
----------
40
Execution plan
----------------------------------------------------------
Hash value of plan: 474461924
---------------------------------------------------------------------------
| ID | Operation | Name | Lines | Bytes | Cost (% CPU). Time |
---------------------------------------------------------------------------
| 0 | SELECT STATEMENT | | 4. 104. 5 (20) | 00:00:01 |
|* 1 | HASH ANTI JOIN | | 4. 104. 5 (20) | 00:00:01 |
| 2. TABLE ACCESS FULL | DEPT | 4. 52. 2 (0) | 00:00:01 |
|* 3 | TABLE ACCESS FULL | EMP | 14. 182. 2 (0) | 00:00:01 |
---------------------------------------------------------------------------
Information of predicates (identified by the operation identity card):
---------------------------------------------------
1 - access ("DEPTNO" ="DEPTNO")
3 - filter ("DEPTNO" IS NOT NULL)
Note
-----
-dynamic sample used for this survey (level = 2)
----------------------------------------------------------------------------------------------------
SQL > SELECT DEPTNO FROM DEPT
2. IF YOU USE NOT IN DEPTNO (DEPTNO SELECT FROM EMP WHERE DEPTNO IS NOT NULL);
DEPTNO
----------
40
Execution plan
----------------------------------------------------------
Hash value of plan: 474461924
---------------------------------------------------------------------------
| ID | Operation | Name | Lines | Bytes | Cost (% CPU). Time |
---------------------------------------------------------------------------
| 0 | SELECT STATEMENT | | 4. 104. 5 (20) | 00:00:01 |
|* 1 | HASH ANTI JOIN | | 4. 104. 5 (20) | 00:00:01 |
| 2. TABLE ACCESS FULL | DEPT | 4. 52. 2 (0) | 00:00:01 |
|* 3 | TABLE ACCESS FULL | EMP | 14. 182. 2 (0) | 00:00:01 |
---------------------------------------------------------------------------
Information of predicates (identified by the operation identity card):
---------------------------------------------------
1 - access ("DEPTNO" ="DEPTNO")
3 - filter ("DEPTNO" IS NOT NULL)
Note
-----
-dynamic sample used for this survey (level = 2)
--------------------------------------------------------------------------------------------------
SQL > SELECT DEPTNO
DEPT 2
3. WHERE THERE IS NO
4 (SELECT * FROM EMP WHERE EMP.) DEPTNO = DEPT. DEPTNO);
DEPTNO
----------
40
Execution plan
----------------------------------------------------------
Hash value of plan: 474461924
---------------------------------------------------------------------------
| ID | Operation | Name | Lines | Bytes | Cost (% CPU). Time |
---------------------------------------------------------------------------
| 0 | SELECT STATEMENT | | 4. 104. 5 (20) | 00:00:01 |
|* 1 | HASH ANTI JOIN | | 4. 104. 5 (20) | 00:00:01 |
| 2. TABLE ACCESS FULL | DEPT | 4. 52. 2 (0) | 00:00:01 |
| 3. TABLE ACCESS FULL | EMP | 14. 182. 2 (0) | 00:00:01 |
---------------------------------------------------------------------------
Information of predicates (identified by the operation identity card):
---------------------------------------------------
1 - access("EMP".") DEPTNO "=" DEPT ". ("' DEPTNO ')
Note
-----
-dynamic sample used for this survey (level = 2)
My doubt is as all the query 3 generates even explain plan
Can we consider that all queries to be the same as in the review of the performance.
Thank you
NOT IN and EXISTS are not the same. If there is only one NULL value in the sub query used with NOT IN then any condition fails.
Here is a note of AskTom on this topic
https://asktom.Oracle.com/pls/Apex/f?p=100:11:0:P11_QUESTION_ID:442029737684
-
Hi gurus
I try to explain the plan and referring to the link that http://docs.oracle.com/database/121/TGSQL/tgsql_interp.htm#TGSQL277understand/learn, see below for more details:
1st step
EXPLAIN PLAN
SET statement_id = "ex_plan1" FOR
SELECT phone_number
Employees
WHERE phone_number AS 650% ';
step 2
SELECT PLAN_TABLE_OUTPUT
TABLE (DBMS_XPLAN. DISPLAY (NULL, 'ex_plan1', 'BASIC'));
Output
PLAN_TABLE_OUTPUT
Hash value of plan: 1445457117
---------------------------------------
| ID | Operation | Name |
---------------------------------------
| 0 | SELECT STATEMENT | |
| 1. TABLE ACCESS FULL | EMPLOYEES |
---------------------------------------
If you have watched the plan explained above then in operation, he leads shows TABLE ACCESS FULL.
Let's see now another for we explain with other data, see below
Step 3
EXPLAIN PLAN
SET statement_id = "ex_plan2" FOR
SELECT last_name
Employees
WHERE name LIKE '% Pe;
Step 4
SELECT PLAN_TABLE_OUTPUT
TABLE (DBMS_XPLAN. DISPLAY (NULL, 'ex_plan2', 'BASIC'));
Output
PLAN_TABLE_OUTPUT
Hash value of plan: 3085132068
----------------------------------------
| ID | Operation | Name |
----------------------------------------
| 0 | SELECT STATEMENT | |
| 1. INDEX RANGE SCAN | EMP_NAME_IX |
----------------------------------------
First Question:
When I run the sql below:SELECT phone_number
Employees
WHERE phone_number AS 650% ';
so why does it display FULL TABLE ACCESS
on the other hand, when I have executed under SQL:
SELECT last_name
Employees
WHERE name LIKE '% Pe;
so why it shows INDEX RANGE SCAN even the two queries by using like operator.
2nd question
In step 4 in the section operation, what is the meaning of the INDEX RANGE SCAN?
3rd issue
In step 4, under the name of topic, what is the meaning of EMP_NAME_IX?
Thanks in advance
Concerning
Shu
All this would be in the documentation.
The second query uses a different plan because there was a clue on last_name.
Index range scan is exactly what it sounds like - it scans the index to find the appropriate values
emp_name_ix is the name of the index that it scans.
-
Different plan for the same sql id
Hello
Our team of application reported recently that a query ran longer than usual.
Search in tables AWR (dba_hist_active_sess_history & dba_hist_sqlstat), it was a change of plan_hash_value. The next day, without intervention from anyone (collect statistics did not run, no change in the tables involved) the sql used the former plan and completed quickly.
The differences in the plan was the index that was used to access the table.
What could be the reason for the optimizer to choose a bad plan and return once more the good thing. ?
The code sql that has been run twice & three in one day and then it years off cursor cache.
Regime shifts are normal.
Flipfloppping plans are quite normal.
I'd be willing to bet that a large percentage of your SQL shows variations in implementation plans and you never notice.
And there are several reasons why you might get a different plan.
1 bind variable peeking - it is normal SQL for the age from the cache and then get analyzed once again with different bind variable leading to different cardinality estimates and plans
2. the statistics change - it is normal that the statistics of change over time causing different cardinality estimates and the various plans, especially if the histograms are involved and changing buckets
3. data change - especially if you use dynamic sampling it is normal to get a different sample of data leading to different cardinality estimates and plans
4 SYSDATE - it's normal for queries with SYSDATE in them to recognize that time is never on leave and which, in conjunction with statistics or data, can lead to different cardinality estimates and plans
5. integrated optimization features - it's normal for features like ACS to kick in and notice that they got forecasts wrong in an execution plan and force the recalculation to a different plan with an adjusted cardinality.
Using DBMS_XPLAN. DISPLAY_CURSOR or DISPLAY_AWR you can get different plans (provided that they are in memory or AWR). The notes section should indicate cardinality comments have been a factor. You can also get links peeked with format mask of "+ PEEKED_BINDS".
-
How to avoid the ORA-01722 in Collection queries?
I'm in the middle of 11 g migration of 12 c and reproduciple face ORA-01722: virheellinen (invalid number) errors with selects for existing collections.
Never paid any attention to it, but good to know that this can happen.
So it's potentially get ORA-01722 invalid number
select to_number(coll.c007) c007 from my,apex_collections coll where my.id = coll.n002 -- my_id and coll.collection_name = 'TUNE_COLL' and to_number(coll.c007) = 1 -- first level
While this isn't:
select to_number(c007) FROM ( select c007 from my,apex_collections coll where my.id = coll.n002 -- my_id and coll.collection_name = 'TUNE_COLL' -- and to_number(coll.c007) = 1 -- first level ) where to_number(c007) = 1 -- first level
What is nasty, it's that the responsibe 25 pages of theme with parts of report gets berzerk when error messages between and so on.
I read the following articles, and it really seems that it comes and goes...
http://deneskubicek.blogspot.fi/2013/03/Apex-collections-and-joins.html
But did not find any quick way to resolve all queries on collections. Somehow, this seems to be because I exceeds the number of columns n001-005 and start using vc c001... columns for numbers.
So what is the best alternative to doing things?
1.) divide collections a number c001... so that the numbers will always n001 numbers... (it is a time consuming task)
2.) extra make selects select collection... is it enough to convert vc/characters to numbers.
3.) or in any another cool tip - are there for example views on collections?
Paavo /rgrds
Paavo wrote:
The error comes randomly, and maybe it has something to do with the existing 'temporary' collections already.
They may have something extraordinary in c007 which cannot be to_numbered with different collection_name.
It has developed before, and this is indeed the cause. The optimizer apply predicates in a different order than that was used earlier. That is, instead of limiting the lines of the collection by the name of the collection to the collection of TUNE_COLL first, then filtering by the value converted C007, she asks C007 firstly, clause that straightens to lines of collections where C007 value can not be converted to a number. This tends to occur during or after the SUMMIT or base data at level, as in this case.
The fix is beef - cross selects all collections and difficulty where the conditions so that they appear only at specific collection_name?
Surely it is necessary on all access collection still? And as explained above, it will not necessarily solve the problem, because the optimizer can change the execution plan and apply predicates in any order.
Why you have exceeded the n001-n005 number of columns? What values are held in these? Preferably, I would suggest using these columns to store digital keys that are used in joins, values put numerical values only referenced in query projections in the columns of characters c001-c050 (and of course to do the same for date values). Then, you can create a view of the collection which explicitly converts values of the column returned to numbers or dates. Using views on top of collections, it is good practice in any case because it allows explicit column names to use in queries rather than a lot of impenetrable n00x and c0xx, which avoids thinking sitting developers "which column is now the postal code?
Maybe you are looking for
-
I recently updated my iPhone iOS 10 and then again 10.0.2 6Plus - but I encounter the same problem. The ringtones that I attributed to specific contacts do not play, the phone only plays the default ringtone. All ringtones work when I press them, and
-
Does not work and can not get compatabilaty program to play the game, any suggestions?
-
At first, this may seem like only an issue with a third-party application, but the question applies to Windows in general. I am a software developer and experienced Windows user, but I can't seem to find no answer on what's going on. Normally lock on
-
Catalogo vuoto dopo di una cartella twice
Ho 24 cartelle music da catalgare, in wmp ver.12.0.7601.1.7514 avevo inesrito nei percorsi della gestione del catalogo musica the first 14 e fin whichTutto bene, ho added poi it percorso della 15 has left e a di notte, mattina dopo... scansire sorpre
-
It is safe to delete the archivelogs FRA?
HelloI'm running an Oracle 12 c database and running a backup script every week:RMAN > BACKUP of DATA PLUS ARCHIVELOG;The archivelog should therefore be connected, no? Today I got an ora-00257. The current solution is to resize the area of 6 GB to 20