Query performance tuning
Hi guruPerhaps this question is stupid, but I think this is the forum where each user to get the information on issues while there.
I want to start learning performance optimization, but do not know the path of where to start anyone can suggest me the same.
Thanks in advance
but it is big enough
Performance optimization is also quite big.
John
Tags: Database
Similar Questions
-
Will there be any tools avialable to the on query performance tuning
Hello
How to tune a database query?
Suppose that there are basic query "select * from emp where empid = '1101' ';"
Y at - it all avilabale tools to suggest performance Tuning on a query?
How can I resolve this application, and what is the best approach on this?
Please share your ideas and thanks.Oracle provides tools such as SQL Trace and TKPROF. For the information on a SQL query.
But basically, you should know how oracle works. You must be aware of the different access plans and know why they are being used.
You need to know when to use an index and when not to use a.
There are many more. Best thing for you would be to start reading the document.
-
Foglight performance tuning - Cache Code JVM
Just curious about this setting. Currently, our new FMS are amazing. But I noticed this option in the field guide. No indication on that? The docs a bit thin. When I use it? What is the default if I don't specify? How to monitor the need to increase this?
Performance Tuning field Guide
To optimize the execution of code in larger environments, you can increase the size of the
JVM code cache.
To increase the size of the JVM code cache:
1 open
/config/foglight.config. 2. change the line foglight.vm.option0 as follows:
Foglight.VM.option0 = '-XX:ReservedCodeCacheSize = 128 m "
3. restart the management server.
The default setting is different based on the platform of the JVM.
It is default to 1024 m on 64-bit systems or 32 m on most systems except Solaris where it could be 48 m.
It sets the size used by the cache code during compilation JIT compiler. If this cache is small you will receive errors like this in the log file
Java HotSpot(TM) Client VM warning: CodeCache is full. Compiler has been disabled. Java HotSpot(TM) Client VM warning: Try increasing the code cache size using -XXReservedCodeCacheSize=And it allows to disable the JIT compiler, which will result in reduced performance because all dynamic logic as rules and other groovy scripts will no longer be dealt with by the JIT.
The default settings will work in most cases, but a big FMS with many objects and rules may require a greater reserve of cache to keep the happy JIT compiler.
Stefan
-
The BLASTP_ALIGN query performance decreases as increases the size table Ref?
Newbie here.
I'm using Oracle 11.2.0.3.
I am currently running and a loop through the cursor according to who uses the tool BLASTP_ALIGN from Oracle:
FOR MyALIGN_TAB IN
(
Select a.query_string, H.AA_SEQUENCE target_string, t_seq_id, pct_identity, alignment_length, incompatibilities, positive, gap_openings, gap_list, q_seq_start, q_frame, q_seq_end, t_seq_start, t_seq_end, t_frame, score, wait
from (select t_seq_id, pct_identity, alignment_length, incompatibilities, positive, gap_openings, gap_list, q_seq_start, q_frame, q_seq_end, t_seq_start, t_seq_end, t_frame, score, wait
table (BLASTP_ALIGN ((p_INPUT_SEQUENCE SELECT query_string FROM DUAL),
CURSOR (Select GB_ACCESSION, AA_SEQUENCE from HUMAN_DB1. HUMAN_PROTEINS),
1-1, 0, 0, 'PAM30',. 1, 10, 1, 2, 0, 0)
)
),
(SELECT p_INPUT_SEQUENCE FROM DUAL Query_string).
HUMAN_DB1. HUMAN_PROTEINS H
WHERE UPPER (t_seq_id) = UPPER (H.gb_accession) and gap_openings = 0
)
LOOP
This initial query works relatively well (about 2 seconds) on a table target of approximately 20,000 documents (reproduced above, as the HUAMN_DB1. Table HUMAN_PROTEINS. However, if I had to choose a selected target table that contains approximately 170 000 records, the query performance are significantly reduced in about 45 seconds. The two tables have identical ratings.
I was wondering if there are ways to improve the performance of BLASTP_ALIGN on large tables? There only seems to be a lot of documentation on BLASTP_ALIGN. I could find this (http://docs.oracle.com/cd/B19306_01/datamine.102/b14340/blast.htm), but it wasn't that useful.
Any ideas would be greatly appreciated.
In case one is interested... it looked like the AA_SEQUENCE column in the following slider: SLIDER (Select GB_ACCESSION, AA_SEQUENCE from HUMAN_DB1. HUMAN_PROTEINS) was a CLOB field. In my second target, my column correspodoning table was VARCHAR2. One hypothesis is that BLASTP_ALIGN made a VARCHAR2-> CLOB conversion internally. I changed the table to have a CLOB column and with success against BLASTP_ALIGN 170 000 documents about 8 seconds (not much, but better than 45).
I will mark it as answered.
-
I took "Oracle Database 12 c: new performance management and Tuning" the oracle University training. Now I would like to get certified on "Oracle Database 11g: Performance Tuning 1Z0-054 ' exam. Is this possible?
I guess you ask if you can use the course 12 c as long as the condition of course for the review of 11g. Over 12 c is not listed as one of the options for the 11 g certification and course requirements are normally specific version - at least with DBA certifications. If you are already an Oracle OCP DBA, of course, there is no requirement of course for the review of performance tuning. From what I know the training requirements for other certifications, I do not that you will be able to use it. However, Brandye will provide a definitive answer to whether the course 12 c would be acceptable for 11g certification.
That said, I'm with John - 12 c review is about a community of 85 to 90% in the review of the 11g and is currently about 20% of the price while it is in beta. What is the point of trying to cross the releases?
-
1Z0-054: Oracle Database 11g Performance Tuning Expert
I intend to give the exam 1z0-054 for the certification, "Oracle Database 11g Performance Tuning Expert".
The path to Certification indicates that, if you are 'OCP DBA 11 g' then you can directly take this article and there is no requirement for training instructor. Therefore, I decided to prepare my own. Can someone guide me on study material and landfills?
Kind regards
Ahmer MansoorTherefore, I decided to prepare my own. Can someone guide me on study material and landfills?
First of all, the word "shock" has a precise meaning. It is short for "landfills of brain", which are illegal and can cost you this certification and all others you have taken.
http://blogs.Oracle.com/certification/entry/0477
Second - there is currently no study guide or a specific book to this certification at the moment. I write the study guides and this one is actually next on my list when I finished the current book to * 1Z0-117: Oracle Database 11 g Release 2: SQL Tuning *. I have a guide for 1Z0 - 054 before sometime in may more likely. That said, I have a few links for legal study on the companion Web site material for my series of guide to the subjects for this exam. It also has links to the Oracle documentation that contains the information you need. Once I have started writing the book review, links will develop quickly because I research for her themes and links to the documentation could extend as well.
http://www.oraclecertificationprep.com/Apex/f?p=OCPSG:EXAM_DETAILS:0:no:P2_EXAM:1Z0 - 054
-
How to tune the query performance, any1 help me to impropve... Thanks in advanceCURSOR c_exercise_list IS SELECT DECODE(v_mfd_mask_id ,'Y',' ',o.opt_id) opt_id, DECODE(v_mfd_mask_id ,'Y',' ',o.soc_sec) soc_sec, P.plan_id plan_id, E.exer_id exer_id, E.exer_num, DECODE(G.sar_flag, 0, DECODE(G.plan_type, 0, '1', 1, '2', 2, '3', 3, ' ', 4,'5', 5, '6', 6, '7', 7, '8', 8, '9', '0'), ' ') option_type, TO_CHAR(G.grant_dt, 'YYYYMMDD') grant_dt, TO_CHAR(E.exer_dt, 'YYYYMMDD') exer_dt, E.opts_exer opts_exer, E.mkt_prc mkt_prc, E.swap_prc swap_prc, E.shrs_swap shrs_swap, decode(e.exer_type,2,decode(xe.cash_partial,'Y','A','2'),TO_CHAR(E.exer_type)) exer_type, E.sar_shrs sar_shrs, NVL(ROUND(((xe.sar_shrs_withld_optcost - (e.opts_exer * g.opt_prc) / e.mkt_prc) * e.mkt_prc),2),0)+e.sar_cash sar_cash, NVL(f.fixed_fee1,0) fixed_fee1, NVL(f.fixed_fee2,0) fixed_fee2, NVL(f.fixed_fee3,0) fixed_fee3, NVL(f.commission,0) commission, NVL(f.sec_fee,0) sec_fee, NVL(f.fees_paid,0) fees_paid, NVL(ct.amount,0) cash_tend, E.shrs_tend shrs_tend, G.grant_id grant_id, NVL(G.grant_cd, ' ') grant_cd, NVL(xg.child_symbol,' ') child_symbol, NVL(xg.opt_gain_deferred_flag,'N') defer_flag, o.opt_num opt_num, --XO.new_ssn, DECODE(v_mfd_mask_id ,'Y',' ',xo.new_ssn) new_ssn, xo.use_new_ssn ,xo.tax_verification_eligible tax_verification_eligible ,(SELECT TO_CHAR(MIN(settle_dt),'YYYYMMDD') FROM tb_ml_exer_upload WHERE exer_num = E.exer_num AND user_id=E.user_id AND NVL(settle_dt,TO_DATE('19000101','YYYYMMDD'))>=E.exer_dt) AS settle_dt ,xe.rsu_type AS rsu_type ,xe.trfbl_det_name AS trfbl_det_name ,o.user_txt1,o.user_txt2,xo.user_txt3,xo.user_txt4,xo.user_txt5,xo.user_txt6,xo.user_txt7 ,xo.user_txt8,xo.user_txt9,xo.user_txt10,xo.user_txt11, xo.user_txt12, xo.user_txt13, xo.user_txt14, xo.user_txt15, xo.user_txt16, xo.user_txt17, xo.user_txt18, xo.user_txt19, xo.user_txt20, xo.user_txt21, xo.user_txt22, xo.user_txt23, xo.user_dt2, xo.adj_dt_hire_vt_svc, xo.adj_dt_hire_vt_svc_or, xo.adj_dt_hire_vt_svc_or_dt, xo.severance_plan_code, xo.severance_begin_dt, xo.severance_end_dt, xo.retirement_bridging_dt ,NVL(xg.pu_var_price ,0) v_pu_var_price ,NVL(xe.ficamed_override,'N') v_ficmd_ovrride ,NVL(xe.vest_shrs,0) v_vest_shrs ,NVL(xe.client_exer_id,' ') v_client_exer_id ,(CASE WHEN xg.re_tax_flag = 'Y' THEN pk_xop_reg_outbound.Fn_GetRETaxesWithheld(g.grant_num, E.exer_num, g.plan_type) ELSE 'N' END) re_tax_indicator -- 1.5V ,xe.je_bypass_flag ,xe.sar_shrs_withld_taxes --Added for SAR july 2010 release ,xe.sar_shrs_withld_optcost --Added for SAR july 2010 release FROM (SELECT exer.* FROM exercise exer WHERE NOT EXISTS (SELECT s.exer_num FROM suspense s WHERE s.exer_num = exer.exer_num AND s.user_id = exer.user_id AND exer.mkt_prc = 0))E, grantz G, xop_grantz xg, optionee o, xop_optionee xo, feeschgd f, cashtendered ct, planz P,xop_exercise xe WHERE E.grant_num = G.grant_num AND E.user_id = G.user_id AND E.opt_num = o.opt_num AND E.user_id = o.user_id AND (G.grant_num = xg.grant_num(+) AND G.user_id=xg.user_id(+)) AND (o.opt_num = xo.opt_num(+) AND o.user_id=xo.user_id(+)) AND E.plan_num = P.plan_num AND E.user_id = P.user_id AND E.exer_num = f.exer_num(+) AND E.user_id = ct.user_id(+) AND E.exer_num = ct.exer_num(+) AND E.user_id = ct.user_id(+) AND E.exer_num=xe.exer_num(+) AND E.user_id=xe.user_id(+) AND G.user_id = USER AND NOT EXISTS ( SELECT tv.exer_num FROM tb_xop_tax_verification tv--,exercise ex WHERE tv.exer_num = e.exer_num AND tv.user_id = e.user_id AND tv.user_id = v_cms_user AND tv.status_flag IN (0,1,3,4, 5)) -- Not Processed ;
Published by: BluShadow on February 21, 2013 08:14
corrected {noformat}{noformat} tags. Please read {message:id=9360002} and learn how to post code correctly.956684 wrote:
I got the cost of CPU: 458.50 time: 1542.90 therefore anything can capture to improve performance, but there is no applied full table scan to put nothing in the mentioned table. . and most of the columns are index unique scan takes place... someone can help me to find the solutionHis request as "my car doesn't work, care color is gray. Can solve you this problem? »
Please read the FAQ, I already posted and follow the instructions.
-
The DIMINFO affects query performance?
Hi all
A USER_SDO_GEOM_METADATA can. DIMINFO well defined to improve the query performance?
For all the tables in my system, I have the USER_SDO_GEOM_METADATA view like this:
DIMINFO
X; -2147483648; 2147483648; 5TH-5
Y; -2147483648; 2147483648; 5TH-5
Z; -2147483648; 2147483648; 5TH-5
Thanks to you allThe simple answer is Yes - it provides an alternative and faster I/O path.
The real question is whether it is supposed that was the data model and its use.
So your question is similar to asking if a varchar2 column indexing is good or not. The answer is "+ depends on +".
-
Query performance poor when they join CONTAINS to another table
We just recently started evaluation Oracle Text for a search solution. We must be able to find a table which can have over 20 million lines. Each user can have visibility to a very small part of these lines. The goal is to have a single Oracle text index that represents all the columns of research in the table (multi column datastore) and provide a score for each search result so that we can sort the search results in descending score order. What we see is that the performance of the queries of TOAD are extremely fast, when we write a simple CONTAINS query against the table indexed Oracle text. However, when we first try reduce the lines from that CONTAINS query must search using a we find the query performance degrades significantly.
For example, we can find all the records that a user has access from our base table of the following query:
SELECT d.duns_loc
DUNS d
JOIN primary_contact pc
ON d.duns_loc = pc.duns_loc
AND pc.emp_id =: employeeID;
This query may run in < 100 m in the example, this query returns close to 1200 lines of the duns_loc of primary key.
Our search query looks like this:
SELECT score (1), d.
DUNS d
WHERE CONTAINS (TEXT_KEY,: research, 1) > 0
ORDER BY score (1) DESC;
The: Find value in this example will be 'Highway '. The query can return 246 k lines in about 2 seconds.
2 seconds is good, but we should be able to have a much quicker response if the request did not have to search the entire table, right? Since each user can only records from 'view' that they are assigned to as us if the search operation had to be analysed a tiny tiny percentage of the TEXT index, we should see results faster (and more relevant). If we now write the following query:
WITH the subset
AS
(SELECT d.duns_loc
DUNS d
JOIN primary_contact pc
ON d.duns_loc = pc.duns_loc
AND pc.emp_id =: employeeID
)
SELECT score (1), d.
DUNS d
JOIN the subset s
ON d.duns_loc = s.duns_loc
WHERE CONTAINS (TEXT_KEY,: research, 1) > 0
ORDER BY score (1) DESC;
For reasons that we have not been able to identify this query actually takes longer to run than the sum times the contributing elements. This query takes more than 6 seconds to run. We, or our DBA can understand why this query runs worse than a large open research. Open research is not ideal because the query eventually folders back to the user, they do not have access to view.
Has anyone ever encountered something like that? Any suggestions on what to watch or where to go? If someone wants more information to help diagnosis to let me know, and I'll be happy to produce it here.
Thank you!!Since you're using two tables, you will get probably better performance on an index that uses a section group and a user_datastore that uses a procedure. He should be able to recover all the data with a simple query, and hit a single index. Please see the demo below. Indexing can be slower, but research should be faster. If you have your primary and foreign keys in place and current statistics before you create the index, it should speed up indexing.
SCOTT@orcl_11gR2> -- tables: SCOTT@orcl_11gR2> CREATE TABLE duns 2 (duns_loc NUMBER, 3 business_name VARCHAR2 (15), 4 business_name2 VARCHAR2 (15), 5 address_line VARCHAR2 (30), 6 city VARCHAR2 (15), 7 state VARCHAR2 (2), 8 business_phone VARCHAR2 (15), 9 contact_name VARCHAR2 (15), 10 contact_title VARCHAR2 (15), 11 text_key VARCHAR2 (1), 12 CONSTRAINT duns_pk PRIMARY KEY (duns_loc)) 13 / Table created. SCOTT@orcl_11gR2> CREATE TABLE primary_contact 2 (duns_loc NUMBER, 3 emp_id NUMBER, 4 CONSTRAINT primary_contact_pk 5 PRIMARY KEY (emp_id, duns_loc), 6 CONSTRAINT primary_contact_fk FOREIGN KEY (duns_loc) 7 REFERENCES duns (duns_loc)) 8 / Table created. SCOTT@orcl_11gR2> -- data: SCOTT@orcl_11gR2> INSERT INTO duns (duns_loc, address_line) VALUES (1, 'highway') 2 / 1 row created. SCOTT@orcl_11gR2> INSERT INTO duns (duns_loc, address_line) VALUES (2, 'highway') 2 / 1 row created. SCOTT@orcl_11gR2> INSERT INTO primary_contact VALUES (1, 1) 2 / 1 row created. SCOTT@orcl_11gR2> INSERT INTO primary_contact VALUES (2, 2) 2 / 1 row created. SCOTT@orcl_11gR2> INSERT INTO duns (duns_loc, address_line) 2 SELECT object_id, object_name 3 FROM all_objects 4 WHERE object_id > 2 5 / 76029 rows created. SCOTT@orcl_11gR2> INSERT INTO primary_contact 2 SELECT object_id, namespace 3 FROM all_objects 4 WHERE object_id > 2 5 / 76029 rows created. SCOTT@orcl_11gR2> -- gather statistics: SCOTT@orcl_11gR2> EXEC DBMS_STATS.GATHER_TABLE_STATS (USER, 'DUNS') PL/SQL procedure successfully completed. SCOTT@orcl_11gR2> EXEC DBMS_STATS.GATHER_TABLE_STATS (USER, 'PRIMARY_CONTACT') PL/SQL procedure successfully completed. SCOTT@orcl_11gR2> -- procedure: SCOTT@orcl_11gR2> CREATE OR REPLACE PROCEDURE duns_proc 2 (p_rowid IN ROWID, 3 p_clob IN OUT NOCOPY CLOB) 4 AS 5 BEGIN 6 FOR d IN 7 (SELECT duns_loc, 8 '' || 9 business_name || ' ' || 10 business_name2 || ' ' || 11 address_line || ' ' || 12 city || ' ' || 13 state || ' ' || 14 business_phone || ' ' || 15 contact_name || ' ' || 16 contact_title || 17 ' ' 18 AS duns_cols 19 FROM duns 20 WHERE ROWID = p_rowid) 21 LOOP 22 DBMS_LOB.WRITEAPPEND (p_clob, LENGTH (d.duns_cols), d.duns_cols); 23 FOR pc IN 24 (SELECT '' || emp_id || ' ' AS pc_col 25 FROM primary_contact 26 WHERE duns_loc = d.duns_loc) 27 LOOP 28 DBMS_LOB.WRITEAPPEND (p_clob, LENGTH (pc.pc_col), pc.pc_col); 29 END LOOP; 30 END LOOP; 31 END duns_proc; 32 / Procedure created. SCOTT@orcl_11gR2> SHOW ERRORS No errors. SCOTT@orcl_11gR2> -- user datastore, section group with field section: SCOTT@orcl_11gR2> begin 2 ctx_ddl.create_preference ('duns_store', 'USER_DATASTORE'); 3 ctx_ddl.set_attribute ('duns_store', 'PROCEDURE', 'duns_proc'); 4 ctx_ddl.set_attribute ('duns_store', 'OUTPUT_TYPE', 'CLOB'); 5 ctx_ddl.create_section_group ('duns_sg', 'BASIC_SECTION_GROUP'); 6 ctx_ddl.add_field_section ('duns_sg', 'emp_id', 'emp_id', true); 7 end; 8 / PL/SQL procedure successfully completed. SCOTT@orcl_11gR2> -- text index with user datastore and section group: SCOTT@orcl_11gR2> CREATE INDEX duns_context_index 2 ON duns (text_key) 3 INDEXTYPE IS CTXSYS.CONTEXT 4 FILTER BY duns_loc 5 PARAMETERS 6 ('DATASTORE duns_store 7 SECTION GROUP duns_sg 8 SYNC (ON COMMIT)') 9 / Index created. SCOTT@orcl_11gR2> -- variables: SCOTT@orcl_11gR2> VARIABLE employeeid NUMBER SCOTT@orcl_11gR2> EXEC :employeeid := 1 PL/SQL procedure successfully completed. SCOTT@orcl_11gR2> VARIABLE search VARCHAR2(100) SCOTT@orcl_11gR2> EXEC :search := 'highway' PL/SQL procedure successfully completed. SCOTT@orcl_11gR2> -- query: SCOTT@orcl_11gR2> SET AUTOTRACE ON EXPLAIN SCOTT@orcl_11gR2> SELECT SCORE(1), d.* 2 FROM duns d 3 WHERE CONTAINS 4 (text_key, 5 :search || ' AND ' || 6 :employeeid || ' WITHIN emp_id', 7 1) > 0 8 / SCORE(1) DUNS_LOC BUSINESS_NAME BUSINESS_NAME2 ADDRESS_LINE CITY ST BUSINESS_PHONE ---------- ---------- --------------- --------------- ------------------------------ --------------- -- --------------- CONTACT_NAME CONTACT_TITLE T --------------- --------------- - 3 1 highway 1 row selected. Execution Plan ---------------------------------------------------------- Plan hash value: 2241294508 -------------------------------------------------------------------------------------------------- | Id | Operation | Name | Rows | Bytes | Cost (%CPU)| Time | -------------------------------------------------------------------------------------------------- | 0 | SELECT STATEMENT | | 38 | 1102 | 12 (0)| 00:00:01 | | 1 | TABLE ACCESS BY INDEX ROWID| DUNS | 38 | 1102 | 12 (0)| 00:00:01 | |* 2 | DOMAIN INDEX | DUNS_CONTEXT_INDEX | | | 4 (0)| 00:00:01 | -------------------------------------------------------------------------------------------------- Predicate Information (identified by operation id): --------------------------------------------------- 2 - access("CTXSYS"."CONTAINS"("TEXT_KEY",:SEARCH||' AND '||:EMPLOYEEID||' WITHIN emp_id',1)>0) SCOTT@orcl_11gR2> -
I have a table that lists the users visits to pages on our website. The information takes the type of structure within our next record table:
VisitID | IDVisiteur | VisitPage | VisitDate
Index | UniqueID. VisitPage | Date/time
I need to get to IDVisiteur who visited in a user defined date range for a report that is to be written, and then get a count the days of separate visit that each user has visited our website. I have a request of work attached that will get me the result set, I want, but it's so _very_ slowly. Query Analyzer it shows that 84% included in table scans. I hope someone has a suggestion on how to optimize it. I am currently working on a MSSQL 8.0 Server, so I have no access to the function of tronque() that I would prefer to use on the dates, but that's a minor inconvenience.
Thank you
-Daniel
Quote:
Posted by: Dan Bracuk
You have an index on visitdate?Visitdate contains real-time, or are all the parts of the time 0:00? If they are all from 00:00, you don't need the convert function. Otherwise, you might have better luck by selecting all data from your database and using Q of Q for the counties.
Dan there on this one. Looking at the design table index was absent. Once I added an index my query performance dramatically, improved enough so that I don't have a lot of worries more. Thanks for the suggestion.
-Daniel
-
Oracle Application Performance Tuning
Hi all
Please forgive me if I'm asking this in the wrong section.
I'm an engineer s/w with 2 years exp. I worked as a tuning performance for Oracle EBS resource in my company. Jobs in question especially SQL tuning and treating indices etc. At the moment I took interest in s/n things, and I finished my TRAY in Oracle 10 g. Now, my company gives me the opportunity to move to a team of DBA of the Application and I'm totally confused about this.
Becoming a DBA Apps means that the effort that I put in the certification in 10g will be of no use. There are other Apps DBA certification documents. I should stay put in performance tuning & wait for a chance to base DBA or I will accept the opportunity to Apps DBA.
Also, did my exp. in SQL tuning performance hold any value as such with exposure to activities of s/n?
Please guide me in this matter I am very confused right now.
Kind regards
LucetteLucette wrote:
Hello bigdelboy, thank you very much for your answer.Yes, I meant by oracle Apps DBA Oracle EBS.
1Z0-046 clearing, is an option. However, my question is will delete both reviews the Admin I and Admin II being of any help, bypassing the expericnce practice? The EBS DBA work involves support and patching, cloning and installation of the new node etc.
Also, is my performance tuning experience will help me somehow on the way forward as a DBA / EBS DBA?
Thank you for your valuable time.
Kind regards
Lucette SarathThe way I read it is that.
People notice that you are able to understand and SQL performance. And you must have some knowledge of Oracle EBS. And in fact, you also have a DBA OCA.
So, there are 98% + chance you can be transformed into a good Oracle Apps DBA (and the core s/n). If I was in their position I want you on my team. It's the way we used to bring on DBA in the old days before approval, and he still has a lot of merit. OK you can only do tasks limited at first... but the number of taks you can do will increase substantially in recent months.
I imagine that the Oracle Apps DBA will be pleased to have a person on board who can tune SQL which sometimes can sometimes seem more like an art than a science of performance. The application of patches, etc. can be taught in small doses. If they are a good team, they're not trying to give you all at once, they'll get to learn one procedure at a time.
And remember, if in doubt ask. and if you do not understand ask again. And be safe and not sorry on actions that could be serious.
.................
If your fear on liinux: recipes of Linux for Oracle DBA (Apress) might be a good book to read but can be expensive in India
Same: (Oracle Applications Dba field Guide) can agree, and the same (Rman recipes for Oracle Database 11 g A problem-solution approach) can have some value if you need to get fast speed in these areas.
They are not perfect, but they sometimes have to consolidate the information carefully; However only buy if you think they are pretty cheap. You can buy them well and feel disappointed (these all is found by Apress which have produced a number of good books... they also published some waste as well)And review the dba examples 2 days as well and install examples n OTN linux so... they are free from books I mentioned.
Rgds - bigdelboy.
-
Dates for "Oracle Database 11g: Performance Tuning" exam
Hello!
Today Oracle posted the info on the new database Oracle 11 g Performance Tuning review required for new certification expertise:
http://education.Oracle.com/pls/web_prod-PLQ-dad/db_pages.GetPage?page_id=41 & p_exam_id = 1Z0_054 #2
It is said that pre-registration for the beta version review starts today, however, it does not say when the phase beta begins and ends. Anyone know?
Thank you
MarcusMarch 31, 2009 is the current provisional end date for the exam in beta 1Z1-054. This date is subject to change.
Kind regards
Brandye Barrington
Certification Forum Moderator
Manager certification program -
1Z0-024 1Z0-054 vs Performance Tuning
Hello
obiously, they are tests for very different versions (8i vs 11g), but if you take that into consideration, I think they are very similar... But in Oracle 8i you had to pass 5 exams (Yes FIVE!) If you want to get your OCP. Today, you get 11G OCP with 3 tests... and if you pass 1Z0-054 you have one cerfitication others...
Is this true?
Are different so the two reviews?, it seems that they are very similar (all similar which can be oracle 8i and oracle 11g)
Anyone who has had 1z0-024 (there are almost 13 years) took 1z0-054?
Concerning
Is this true?
I guess that what you are asking to be true is that the 11g OCP requires three exams (TRUE) and passing the 1Z0 - 054 you grant OCÉ certification in addition to the 11 g OCP (also TRUE). Theoretically, you could also win the 11g tuning certification without an OCP, but there're so much, we need practical training that must also be met.
Are different so the two reviews?, it seems that they are very similar (all similar which can be oracle 8i and oracle 11g)
Well, I don't have a handy list of topics for 1Z0 - 024, so I'll work from subjects for 1Z0 - 054 and extrapolate. First of all, I will list some of the topics in 054 which are features that did not exist in 8i:
Automatic maintenance AWR, ADDM, tasks, reports of ASH, database Resource manager, planner of the Oracle, SQL tuning automatically, planning Plan SQL, SQL Performance Analyzer, Database Replay, Automatic Shared Memory Management, automatic memory management, space management auto Segment, Segment retractable, Automatic Storage Management, Statspack.
Please note that the list above is perhaps not complete. I might have missed some. However, I think I can answer your question with confidence, saying: "Yes - the two reviews are very different."
-
I have two schemas of two databases.
When I check the sql plan, both the schema contains diffrently (one is underway for a full table scan and a scan of systematic index range).
Both the scheme almost similar kind of data, indexes, and charges.
What is causing the performance of sql
in the second plan, the optimizer expects the analysis of range on IDX_TSK_ID step 5 to return to only 14 lines and decides it's a good idea to join the second TB_TRANS_MSTR table with a nested loops join (make a loop on 14 TASK_INSTANCE results and do a search on each iteration of the use of the PK_TRANS_ID index).
In the foreground, the optimizer decides to read TB_TRANS_MSTR (containing 978 lines) and build a table of hash in memory of the results - and then probe against the TASK_INSTANCE second set.
The next question is: which plan is most suitable and translates into better performance? The chances are high that the best plan is one that includes an estimate more fitting of the cardinalities. These estimates are based on a simple arithmetic (more or less) - and they depend on the table and column statistics. So the dba_tab_column entires Swen W. mentioned would be useful. In addition the text of the query would probably we shed some light on the question.
-
Partitioning strategy for the OBIEE query performance
I use partitioning for the first time and I'll have trouble determining if I partition my fact table in a way that will allow the partition size to work with queries generating OBIEE. I've set up a simple example using query I wrote to illustrate my problem. In this example, I have a star with a fact table schema and I join in two dimensions. My fact table is partitioned on JOB_ID and TIME_ID RANGE LIST and those are the keys that link the two dimensions that I use in this application.
Select sum (boxbase)
TEST_RESPONSE_COE_JOB_QTR a
Join DIM_STUDY C on A.job_id = C.job_id
Join DIM_TIME B on A.response_time_id = B.time_id
where C.job_name = "FY14 CSAT"
and B.fiscal_quarter_name = ' quarter 1';
What can I say, because the query is in fact done filtering on columns in the dimensions instead of they, the columns in the table, the size isn't actually is happening. I see actually slightly better performance of a non-partitioned table, even though I wrote this application specifically for partitioning strategy which is now in place.
If I run the next statement, it runs a lot faster and a plan to explain is very simple and it seems to me that it's size down to a partition of sub as I hoped. This isn't any query generated by OBIEE how will seem so.
Select sum (boxbase)
of TEST_RESPONSE_COE_JOB_QTR
where job_id = 101123480
and response_time_id < 20000000;
Any suggestions? I get some benefits from the exchange of partition by using this configuration, but if I'm going to sacrifice performance reports then that maybe isn't useful, or at the very least, I would need to get rid of my partitions void if they are not providing any benefit.
Here are the plans to explain that I got for two queries in my original post:
Operation
Name of the object
Lines
Bytes
Cost
Object node
In/Out
PStart
PStop
INSTRUCTION SELECT optimizer Mode = ALL_ROWS
1
20960
AGGREGATION OF TRI
1
13
VIEW
SYS. VW_ST_5BC3A99F
101 K
1 M
20960
NESTED LOOPS
101 K
3 M
20950
PARTITION LIST SUBQUERY
101 K
2 M
1281
KEY (SUBQUERY)
KEY (SUBQUERY)
RANGE OF PARTITION SUBQUERY
101 K
2 M
1281
KEY (SUBQUERY)
KEY (SUBQUERY)
CONVERSION OF BITMAP IN ROWID
101 K
2 M
1281
BITMAP AND
MERGE TO BITMAP IMAGE
KEY ITERATION BITMAP
BUFFER
INDEX SKIP SCAN
CISCO_SYSTEMS. DIM_STUDY_UK
1
17
1
BITMAP INDEX RANGE SCAN
CISCO_SYSTEMS. FACT_RESPONSE_JOB_ID_BMID_12
KEY
KEY
MERGE TO BITMAP IMAGE
KEY ITERATION BITMAP
BUFFER
VIEW
CISCO_SYSTEMS.index$ _join$ _052
546
8 K
9
HASH JOIN
INDEX RANGE SCAN
CISCO_SYSTEMS. DIM_TIME_QUARTER_IDX
546
8 K
2
INDEX FULL SCAN
CISCO_SYSTEMS. TIME_ID_PK
546
8 K
8
BITMAP INDEX RANGE SCAN
CISCO_SYSTEMS. FACT_RESPONSE_TIME_ID_BMIDX_11
KEY
KEY
TABLE ACCESS BY ROWID USER
CISCO_SYSTEMS. TEST_RESPONSE_COE_JOB_QTR
1
15
19679
ROWID
L LINE
Operation
Name of the object
Lines
Bytes
Cost
Object node
In/Out
PStart
PStop
INSTRUCTION SELECT optimizer Mode = ALL_ROWS
1
1641
AGGREGATION OF TRI
1
13
SIMPLE LIST OF PARTITION
198 K
2 M
1641
KEY
KEY
RANGE OF SINGLE PARTITION
198 K
2 M
1641
1
1
TABLE ACCESS FULL
CISCO_SYSTEMS. TEST_RESPONSE_COE_JOB_QTR
198 K
2 M
1641
36
36
It seems unreasonable to think that relying on our index in a table partitioned (or partitioned in a way only focused on the help of ETL) can actually work better than partitioning in a way that we could get some size dynamic, but never static pruning?
Yes - standard tables with indexes can often outperform partitioned tables. It all depends on types of queries and predicates to query which are typically used and the number of rows returned in general.
Size of the partition eliminates the partitions TOGETHER - regardless of the number of rows in the partition or table. An index, on the other hand, is prohibited if the query predicate needs a significant number of lines since Oracle can determine that the cost is lower simply use close readings and make a full scan.
A table with 1 million rows and a query predicate who wants 100 K of them probably will not use an index at all. But the same table with two partitions could easily have one of the partitions pruned by the "number of effective lines" only 500 k or less.
If you are partitioning for performance, you should test your critical queries to make sure partitioning/pruning is effective for them.
Select sum (boxbase)
TEST_RESPONSE_COE_JOB_QTR a
Join DIM_STUDY C on A.job_id = C.job_id
Join DIM_TIME B on A.response_time_id = B.time_id
where C.job_name = "FY14 CSAT"
and B.fiscal_quarter_name = ' quarter 1';
So, what is a typical value for 'A.response_time_id '? That represents a 'B.time_id '?
Because a way of providing explicit partition keys may be to use a range of 'response_time_id' of the FACT table rather than a value of 'fiscal_quarter_name' of the DIMENSION table.
If "1 quarter" could correspond to a range of dates from 01/01/YYYY ' at ' 03/31/yyyy '. "."
Also, you said that on the partitioning: JOB_ID and TIME_ID
But if your questions relate mainly to the DATES / TIMES, you might be better use the TIME_ID for PARTITIONS and JOB_ID, if necessary, for the subpartitioning.
Date range partitioning is one of the most common around.and serves both performance and ease of maintenance (delete/archive old data).
Maybe you are looking for
-
Hello I hope I'm not creating a dump. anyway. A big question on tiara: I always use the same type of display: graphical 2D with several curves, and axes. The default font size is 3 (too big), the thickness of the default curve is minimal (too thin),
-
Perforce Workspace and LabVIEW
Hello I take more than one job where I use an existing computer that has been configured with Perforce for Source control of LabVIEW. I use the same local workspace as my predecessor who is simple, the c drive. When I create a new VI and add it to pe
-
How can I bypass the Welcome screen and go directly to windows
My computer used to go directly to the desktop at startup, but now opens the home screen where I have to click on "owner" continuous seized on the desktop. I want to eliminate that.
-
Invalid partition table appear on my HP a1700n
Can a System repair and recovery to be
-
My laptop is a HP Pavilion dv2000 as the topic says were running Windows 7 32 boatyard that I go to Device Manager and I see in the "Other devices" section requiring two Base system device, their record was also the compressor, but I already found th