Efficient SQL Statements
Enviado el Martes, 12 mayo a las 15:45:00 por csr |
|
Efficient SQL Statements
Tomado de www.oracle-base.com
This is an extremely brief look at some of the factors that may effect the efficiency of your SQL and PL/SQL code. It is
not intended as a thorough discussion of the area and should not be used as such.
Check Your Stats
The Cost Based Optimizer (CBO) uses statistics to decide which execution plan to use. If these statistics are incorrect the decision made by the CBO
may be incorrect. For this reason it is important to make sure that these statistics are refreshed regularly. The following articles will help you
achieve this aim:
Why Indexes Aren't Used
The presence of an index on a column does not guarantee it will be used. The following is a small list of factors that
will prevent an index from being used:
-
The optimizer decides it would be more efficient not to use the index. As a rough rule of thumb, on evenly distributed
data an index will be used if it restricts the number rows returned to 5% or less of the total number of rows. In the
case of randomly distributed data, an index will be used if it restricts the number of rows returned to 25% or less of
the total number of rows.
- You perform a function on the indexed column i.e. WHERE UPPER(name) = 'JONES'
- You perform mathematical operations on the indexed column i.e. WHERE salary + 1 = 10001
- You concatenate a column i.e. WHERE firstname || ' ' || lastname = 'JOHN JONES'
-
You do not include the first column of a concatenated index in the WHERE clause of your statement. For the index to be
used in a partial match, the first column (leading-edge) must be used. Note. Index-Skip-Scanning in Oracle9i and above
allow indexes to be used even when the leading edge is not referenced.
-
The use of 'OR' statements confuses the Cost Based Optimizer (CBO). It will rarely choose to use an index on column
referenced using an OR statement. It will even ignore optimizer hints in this situation. The only way of guaranteeing
the use of indexes in these situations is to use the /*+ RULE */ hint.
EXISTS vs. IN
The EXISTS function searches for the presence of a single row meeting the stated criteria as opposed to the IN
statement which looks for all occurrences. For example:
PRODUCT - 1000 rows
ITEMS - 1000 rows
(A)
SELECT p.product_id
FROM products p
WHERE p.item_no IN (SELECT i.item_no
FROM items i);
(B)
SELECT p.product_id
FROM products p
WHERE EXISTS (SELECT '1'
FROM items i
WHERE i.item_no = p.item_no)
For query A, all rows in ITEMS will be read for every row in PRODUCTS. The effect will be 1,000,000 rows read
from items. In the case of query B, a maximum of 1 row from ITEMS will be read for each row of PRODUCTS, thus
reducing the processing overhead of the statement.
Rule of thumb:
- If the majority of the filtering criteria are in the subquery then the
IN variation may be more performant.
- If the majority of the filtering criteria are in the top query then the
EXISTS variation may be more performant.
I would suggest they you should try both variants and see which works the best.
Presence Checking
If processing is conditional on the presence of certain records in a table, you may use code such as:
SELECT Count(*)
INTO v_count
FROM items
WHERE item_size = 'SMALL';
IF v_count = 0 THEN
-- Do processing related to no small items present
END IF;
If there are many small items, time and processing will be lost retrieving multiple records which are not needed. This
would be better written like one of the following:
SELECT Count(*)
INTO v_count
FROM items
WHERE item_size = 'SMALL'
AND rownum = 1;
IF v_count = 0 THEN
-- Do processing related to no small items present
END IF;
OR
BEGIN
SELECT '1'
INTO v_dummy
FROM items
WHERE item_size = 'SMALL'
AND rownum = 1;
EXCEPTION
WHEN NO_DATA_FOUND THEN
-- Do processing related to no small items present
END;
In these examples only single a record is retrieved in the presence/absence check.
Inequalities
If a query uses inequalities (item_no > 100) the optimizer must estimate the number of rows
returned before it can decide the best way to retrieve the data. This estimation is prone to errors.
If you are aware of the data and it's distribution you can use optimizer hints to
encourage or discourage full table scans to improve performance.
If an index is being used for a range scan on the column in question, the performance can be improved by
substituting >= for >. In this case, item_no > 100 becomes item_no >= 101. In the first case,
a full scan of the index will occur. In the second case, Oracle jumps straight to the first index entry with
an item_no of 101 and range scans from this point. For large indexes this may significantly reduce the number
of blocks read.
When Things Look Bad!
If you have a process/script that shows poor performance you should do the following:
- Write sensible queries in the first place!
-
Identify the specific statement(s) that are causing a problem. The simplest way to do this usually involves
running the individual statements using SQLPlus and timing them (SET TIMING ON)
-
Use EXPLAIN to look at the execution plan of the statement. Look for any full table accesses that look dubious.
Remember, a full table scan of a small table is often more efficient than access by rowid.
-
Check to see if there are any indexes that may help performance. A quick way to do this is to run the statement using
the Rule Based Optimizer (RBO) (SELECT /*+ RULE */ ). Under the RBO, if an index is present it will be used. The resultant
execution plan may give you some ideas as to what indexes to play around with. You can then remove the RULE hint and replace
it by the specific index hints you require. This way, the CBO will still be used for table accesses where hints aren't
present. Remember, if data volumes change over time, the hint that helped may become a hindrance! For this reason,
hints should be avoided if possible, especially the /*+ RULE */ hint.
-
Try adding new indexes to the system to reduce excessive full table scans. Typically, foreign key columns should be
indexed as these are regularly used in join conditions. On occasion it may be necessary to add composite (concatenated)
indexes that will only aid individual queries. Remember, excessive indexing can reduce INSERT, UPDATE and DELETE performance.
Driving Tables (RBO Only)
The structure of the FROM and WHERE clauses of DML statements can be tailored to improve the performance of the statement.
The rules vary depending on whether the database engine is using the Rule or Cost based optimizer. The
situation is further complicated by the fact that the engine may perform a Merge Join or a
Nested Loop join to retrieve the data. Despite this, there are a few rules you can use to improve the performance of your SQL.
Oracle processes result sets a table at a time. It starts by retrieving all the data for the first (driving) table. Once this data is
retrieved it is used to limit the number of rows processed for subsequent (driven) tables. In the case of multiple table joins, the driving table limits
the rows processed for the first driven table. Once processed, this combined set of data is the driving set for the second driven table etc.
Roughly translated into English, this means that it is best to process tables that will retrieve a small number of rows
first. The optimizer will do this to the best of it's ability regardless of the structure of the DML, but the following factors may help.
Both the Rule and Cost based optimizers select a driving table for each query. If a decision cannot be made, the order of
processing is from the end of the FROM clause to the start. Therefore, you should always place your driving table at the end of the FROM clause.
Subsequent driven tables should be placed in order so that those retrieving the most rows are nearer to the start of the FROM clause. Confusingly, the WHERE
clause should be writen in the opposite order, with the driving tables conditions first and the final driven table last. ie.
FROM d, c, b, a
WHERE a.join_column = 12345
AND a.join_column = b.join_column
AND b.join_column = c.join_column
AND c.join_column = d.join_column;
If we now want to limit the rows brought back from the "D" table we may write the following:
FROM d, c, b, a
WHERE a.join_column = 12345
AND a.join_column = b.join_column
AND b.join_column = c.join_column
AND c.join_column = d.join_column
AND d.name = 'JONES';
Depending on the number of rows and the presence of indexes, Oracle my now pick "D" as the driving table.
Since "D" now has two limiting factors (join_column and name), it may be a better candidate as a driving
table so the statement may be better written as:
FROM c, b, a, d
WHERE d.name = 'JONES'
AND d.join_column = 12345
AND d.join_column = a.join_column
AND a.join_column = b.join_column
AND b.join_column = c.join_column
This grouping of limiting factors will guide the optimizer more efficiently making table "D" return
relatively few rows, and so make it a more efficient driving table.
Remember, the order of the items in both the FROM and WHERE clause will not force the optimizer to pick a
specific table as a driving table, but it may influence it's decision. The grouping of limiting conditions onto a single
table will reduce the number of rows returned from that table, and will therefore make it a stronger
candidate for becoming the driving table.
Caching Tables
Queries will execute much faster if the data they reference is already cached. For small frequently used tables
performance may be improved by caching tables. Normally, when full table scans occur, the cached data is placed
on the Least Recently Used (LRU) end of the buffer cache. This means that it is the first data to be paged
out when more buffer space is required. If the table is cached (ALTER TABLE employees CACHE;) the data is placed
on the Most Recently Used (MRU) end of the buffer, and so is less likely to be paged out before it is re-queried.
Caching tables may alter the CBO's path through the data and should not be used without careful consideration.
Improving Parse Speed
Execution plans for SELECT statements are cached by the server, but unless the exact same statement is repeated the stored execution plan
details will not be reused. Even differing spaces in the statement will cause this lookup to fail. Use of bind variables allows
you to repeatedly use the same statements whilst changing the WHERE clause criteria. Assuming the statement does not have a cached execution
plan it must be parsed before execution. The parse phase for statements can be decreased by efficient use of aliasing. This helps the
speed of parsing the statements in two ways:
- If an alias is not present, the engine must resolve which tables own the specified columns.
- A short alias is parsed more quickly than a long table name or alias. If possible, reduce the alias to a single letter.
The following is an example:
| Bad Statement |
Good Statement |
SELECT first_name,
last_name,
country
FROM employee,
countries
WHERE country_id = id
AND lastname = 'HALL';
|
SELECT e.first_name,
e.last_name,
c.country
FROM employee e,
countries c
WHERE e.country_id = c.id
AND e.last_name = 'HALL';
|
Packages Procedures and Functions
When an SQL statement, or anonymous block, is passed to the server it is processed in three phases:
| Phase |
Actions |
| Parse |
Syntax Check and Object Resolution |
| Execution |
Necessary Reads and Writes performed |
| Fetch |
Resultant rows are Retrieved, Assembled, Sorted and Returned |
The Parse phase is the most time and resource intensive. This phase
can be avoided if all anonymous blocks are stored as Database Procedures,
Functions, Packages or Views. Being database objects their SQL text and
compiled code is stored in Data Dictionary and the executable copies reside in
the Shared Pool.
Further Reading
- Oracle Server SQL Reference (Reference Manual)
- Oracle DBA Handbook (Oracle Press)
- Oracle Advanced Tuning and Administration (Oracle Press)
- Oracle PL/SQL Programming (Oracle Press)
Hope this helps. Regards Tim...
|
| |
 |
 |
Puntuación Promedio: 0 votos: 0
|
|
 |
 |
|