Google optimizer based on CSSTidy test

Hello

I am currently working with a webmaster who has done a great job with our website: [link removed by Moderator]

In order to improve our conversions I use Google optimizer to run A / B split tests. As my webmaster is busy (it is supported too much work) it may take a few days to create test pages. Ideally, I would like to make simple changes on the site, without worrying him, so I can speed up my testing and results.

I know very little about Dreamweaver, but just the search options at this stage. It is a relatively easy language to learn and a novice to do simple changes without messing up the site? I should add that I want to continue to work with my webmaster - I want to just prepare to have a discussion illuminated with him.

I want your comments.

Thank you.

Scotkan wrote:

I know very little about Dreamweaver, but just the search options at this stage. It is a relatively easy language to learn and a novice to do simple changes without messing up the site?

Dreamweaver is not a language. It's a web development program used for editing HTML, CSS and other web-related. You can certainly use it to make simple changes to a Web site. You can also do a lot of damage on the site if you do not understand HTML, CSS or any other technology used by the site. Learn HTML and CSS is not rocket science, but don't expect to become an expert overnight, either.

You can learn about HTML and CSS through tutorials online at www.w3schools.com. There are also a few good books, like "HTML, XHTML & CSS" by Elizabeth Castro and "head first: HTML with CSS and XHTML" by Eric Freeman and Elizabeth Freeman.

Tags: Dreamweaver

Similar Questions

  • What is the meaning of the optimizer based on CSSTidy referring "A ORDERED USE_NL" Please?

    Hi all

    What is the meaning of the optimizer based on CSSTidy referring "A ORDERED USE_NL" Please?

    I searched the internet without great success (indicators of optimizer). Can you please enlighten me on this? Thank you.

    My problem is that it works well on a database and another data base, it is really slow.

    Kind regards

    Michael.

    Councils ORDERED to join the table in the order that they are put in the FROM clause. USE_NL oracle tips to use sweeping LOOP IMBRIQUEE.

    Here is an example. Find the order in which the tables are specified in the clause and the output of the execution plan.

    SQL> select /*+ ORDERED USE_NL(e d) */ d.dname, e.ename from emp e join dept d on e.deptno = d.deptno;
    ...
    ----------------------------------------------------------------------------------------
    | Id  | Operation                    | Name    | Rows  | Bytes | Cost (%CPU)| Time     |
    ----------------------------------------------------------------------------------------
    |   0 | SELECT STATEMENT             |         |       |       |     5 (100)|          |
    |   1 |  NESTED LOOPS                |         |    11 |   242 |     5   (0)| 00:00:01 |
    |   2 |   TABLE ACCESS FULL          | EMP     |    11 |    99 |     2   (0)| 00:00:01 |
    |   3 |   TABLE ACCESS BY INDEX ROWID| DEPT    |     1 |    13 |     1   (0)| 00:00:01 |
    |*  4 |    INDEX UNIQUE SCAN         | DEPT_PK |     1 |       |     1   (0)| 00:00:01 |
    ----------------------------------------------------------------------------------------
    Predicate Information (identified by operation id):
    ---------------------------------------------------
       4 - access("E"."DEPTNO"="D"."DEPTNO")
    
    SQL> select /*+ ORDERED USE_NL(e d) */ d.dname, e.ename from dept d join emp e on e.deptno = d.deptno;
    ...
    ---------------------------------------------------------------------------
    | Id  | Operation          | Name | Rows  | Bytes | Cost (%CPU)| Time     |
    ---------------------------------------------------------------------------
    |   0 | SELECT STATEMENT   |      |       |       |     5 (100)|          |
    |   1 |  NESTED LOOPS      |      |    11 |   242 |     5   (0)| 00:00:01 |
    |   2 |   TABLE ACCESS FULL| DEPT |     4 |    52 |     2   (0)| 00:00:01 |
    |*  3 |   TABLE ACCESS FULL| EMP  |     3 |    27 |     1   (0)| 00:00:01 |
    ---------------------------------------------------------------------------
    Predicate Information (identified by operation id):
    ---------------------------------------------------
       3 - filter("E"."DEPTNO"="D"."DEPTNO")
    
  • Software PC Optimizer based on CSSTidy

    Just bought a new computer laptop 11 "and has been putting up. Did not much else that sorted on the USB stick recovery and initialize Microsoft Office, but now I have the PC Optimizer software that wants to save - what the hell is this because I have not downloaded, don't want and apparently, according to a few sources than its malaware! What is going on?  This is a new computer and I have been nowhere in terms of surfing the web!

    Hello Geofftitto,

    Good question. I guess that optimizer PC came with the laptop as part of the additional software that HP adds to its systems.

    Whether you use it or not is totally up to you. Personally I don't use any sort of optimization programs that need to run in the background of my system.

    IF you don't, simply uninstall it. If you want to go a little more and get your geek on, use Revo Uninstaller to uninstall unwanted things on the operating system. Revo using the Windows uninstall program but are looking for the remaining files in the registry and others and will give you the option to delete them also. http://www.revouninstaller.com/revo_uninstaller_free_download.html

    Here is a link to improve your HP with Windows 8 system without having to install an optimizer.

    HP System Performance improvement

    It will be useful.

    I do not work for HP, just a volunteer.

  • How can I remove optimizer based on CSSTidy zeo

    It just bothers me

    Hi Jamesanderson1,

    1. What is the exact problem that you face?

    2. you receive messages or error codes?

    3. what anti-virus software is installed on the system?

    Step 1:

    If you try to uninstall zeo optimizer, then you can read the following article to uninstall.

    Uninstall a program

    Step 2:

    You can also read the following article to download the Microsoft Safety Scanner and perform a full scan on your computer.

    Microsoft safety scanner

    Note: When you perform the analysis, there are chances of losing the data that you can take a backup of important data before performing analysis.

    Hope this information is useful.

  • Lollipop Google Search 4.0 for test; )

    Install on my bike e but it crashes every time. I have not rooted yet a link to download

    www.apkmirror.com/apk/Google-Inc/Google-Search/Google-Search-4-0-26-1499465-ARM-apk/

    No, I had 11 CM mod, lollipop based ROM

  • How to make an accessible application for Google/Ichabod based FTE?

    What needs to be done to get a Flash Text Engine based application indexable by Google via Ichabod?

    Is there an interface that must be implemented?

    Thank you.

    Regrads,

    Benny

    The people that I spoke to said "FTE text is not currently indexed by Google, but Google and Adobe are working actively to do this."

    Gordon Smith

    Adobe Flex SDK team

  • How can I get rid of wlan optimizer to my pc

    How can I get rid of the optimizer based on CSSTidy WLAN of my pc, also error code ox80040154 can anyone help, kirky

    How can I get rid of the optimizer based on CSSTidy WLAN of my pc, also error code ox80040154 can anyone help, kirky

    Uninstall it by the manufacturer and/or contact them...
    http://www.Martin-Majowski.de/wlanoptimizer/

    Regarding the "80040154" error, where to get you?

  • Lenovo ee startup optimizer

    When I was optimization using lenovo startup optimizer based on CSSTidy it was power failure .and next time my pc optimizes every startup... I have to manually cancel.and start new startup optimizer restarts the pc on its own unless we cancel.

    What should do?

    Request support from Lenovo, its their usefulness/process

  • Optimize the Flash banner with bitmap images

    Hello

    I have to produce an announcement of Flash banner for my business. The specs are Flash 8 to 30 KB maximum.

    My company wants more high resolution possible and fluid animations, but no matter what I have, or I have to lower the resolution of my images or do the more static ad, that which no not my company is happy!

    I save images to the right size, so I do not adapt them in Flash

    I open each bitmaps and change their quality individually

    I clicked on the movie button compress

    I have optimized all forms that are in the film

    I made sure all the used more than once or animated objects are movieclips

    I used the optimizer based on CSSTidy SWF, but it made no difference.

    Is there something else that I missed?

    Thank you very much for any answer

    Sandra

    He are really no tricks to this, everything that needs to be done, and you have seem to have tried it before you posted.  Either you dynamically load things or you reduce the weight of that contains the file.  The swf file will carry the weight of any files used in that you imported to the library, including images, sounds and video, if you need the use of such things and maximize what you don't use before you import it.  Graphics created with Flash are very economical, as well as actionscript code, so they should be used as a preference.

  • Article based on a block

    Hi I have a block that is based on multiple tables, 4 in fact. I'm using Forms 10 g release 1 and oracle 10 g database.

    The block is very slow because the query is cost based. When I run the same query with the indicator / * + rule * / query is fast enough. 4 minutes vs 400 milliseconds. Is there a way to tell the block I want to solve based?

    When I founded the block on a view, I can specify the rule based indicator, but I can't have the block based on a view, because I'm not updating the block. The view is a bit complicated be updated. A view is editable if point of view have the primary key and the key to join foreing or something like that. In any case, I create the view and include the primary key and I can't update.

    -Does anyone know how I can add the suspicion in a block-shaped?

    Thank you

    Hello

    You can create a trigger before query that performs the following operations

    set_block_property ('block_name', OPTIMIZER_HINT, 'RULE');

    but as Francis, I'd look at why such poor plan the optimizer based on CSSTidy

    Hope this helps

    Neil

  • Registry entries for Internet Explorer typedurls (and shortcuts of desktop) is automatically added to a Chinese web site

    Despite a plethora of defenses of AV/Adaware/Antimalware (Mcafee, MS Security Essentials, Windows washer, Hijackthis, Adaware, CCleaner, Advanced Registy optimizer based on CSSTidy etc.), updated and cleaning of scans/washes off the power of the autocomplete etc. on mp PC XP SP3 IE - keep something not found, adding even 4 url entries in the registry key PosteDeTravail/HKEY_Current_User/Software/Microsoft/Internet Explorer/TypedURLS and two Chinese shortcuts on the desktop. Delete them via RegEdit, then purge and restart etc does not determine. I can't identify what process or the file is the cause or figure out how the hell this infection occurred or how to get rid of. Affected URLS are www. : 5050.cn; Baidu.com/s? NT = openssl_dg; Sogou.com/index.htm?PID=Sogou-addr3dac09e434797862 and pindao.huoban.taobao.com/channel/onSale.htm?pid=mm_17297392_2279105_8864797 cannot be found by Google research on this and I can't believe I'm the only one with this problem, which seems to be able to bypass know all security tools. Can anyone help as this is a major weakness of penetration for me and I tried everything to get rid of him? Thank you very much.

    Please report all further follow-up replies to your original thread: http://social.answers.microsoft.com/Forums/en-US/InternetExplorer/thread/8cd68f02-e191-43c2-9227-6d5dd6fe263a

  • This copy of Windows is not genuine. Windows 7 Build 7601

    Microsoft messages reappear that my Windows is not genuine and it must be re-bought.  My copy is authentic and I have the product key, but the MS site telling me there is an error 0X8007000D code when I get it.  I've had no problems with this product number works very well in the past.  I glued the diagnosis MS report below.  Any help appreciated.

    Diagnostic report (1.9.0027.0):

    -----------------------------------------

    Validation of Windows data-->

    Validation code: 50

    Code of Validation caching online: 0x0

    Windows product key: *-*-63 HM 9-V2RY4-JVD6P

    The Windows Product Key hash: yMGXpMbUi1opRZBV8zsEmbOn0vs =

    Windows product ID: 00359-OEM-8882522-99242

    Windows Product ID Type: 3

    Windows license Type: OEM System Builder

    The Windows OS version: 6.1.7601.2.00010300.1.0.003

    ID: {B85B0223-B892-4549-88ED-A92AD4B08745} (1)

    Admin: Yes

    TestCab: 0x0

    LegitcheckControl ActiveX: N/a, hr = 0 x 80070002

    Signed by: n/a, hr = 0 x 80070002

    Product name: Windows 7 Home Premium

    Architecture: 0 x 00000009

    Build lab: 7601.win7sp1_gdr.150316 - 1654

    TTS error:

    Validation of diagnosis:

    Resolution state: n/a

    Given Vista WgaER-->

    ThreatID (s): n/a, hr = 0 x 80070002

    Version: N/a, hr = 0 x 80070002

    Windows XP Notifications data-->

    Cached result: n/a, hr = 0 x 80070002

    File: No.

    Version: N/a, hr = 0 x 80070002

    WgaTray.exe signed by: n/a, hr = 0 x 80070002

    WgaLogon.dll signed by: n/a, hr = 0 x 80070002

    OGA Notifications data-->

    Cached result: n/a, hr = 0 x 80070002

    Version: N/a, hr = 0 x 80070002

    OGAExec.exe signed by: n/a, hr = 0 x 80070002

    OGAAddin.dll signed by: n/a, hr = 0 x 80070002

    OGA data-->

    Office status: 100 authentic

    Microsoft Office Home and Student 2007-100 authentic

    OGA Version: N/a, 0 x 80070002

    Signed by: n/a, hr = 0 x 80070002

    Office Diagnostics: 025D1FF3-364-80041010_025D1FF3-229-80041010_025D1FF3-230-1_025D1FF3-517-80040154_025D1FF3-237-80040154_025D1FF3-238-2_025D1FF3-244-80070002_025D1FF3-258-3_E2AD56EA-765-d003_E2AD56EA-766-0_E2AD56EA-134-80004005_E2AD56EA-765-b01a_E2AD56EA-766-0_E2AD56EA-148-80004005_16E0B333-89-80004005_B4D0AA8B-1029-80004005

    Data browser-->

    Proxy settings: N/A

    User Agent: Mozilla/4.0 (compatible; MSIE 8.0; Win32)

    Default browser: C:\Program Files (x86)\Google\Chrome\Application\chrome.exe

    Download signed ActiveX controls: fast

    Download unsigned ActiveX controls: disabled

    Run ActiveX controls and plug-ins: allowed

    Initialize and script ActiveX controls not marked as safe: disabled

    Allow the Internet Explorer Webbrowser control scripts: disabled

    Active scripting: allowed

    Recognized ActiveX controls safe for scripting: allowed

    Analysis of file data-->

    Other data-->

    Office details: {B85B0223-B892-4549-88ED-A92AD4B08745}1.9.0027.06.1.7601.2.00010300.1.0.003x 64*-*-*-*-JVD6P00359-OEM-8882522-992423S-1-5-21-3733390438-207797979-3624312199Hewlett-PackardHP Pavilion dv4 Notebook PCHewlett-PackardF.5220090903000000.000000 + 0000E030C00010000F604090409Eastern Standard Time(GMT-05:00)03HPQOEMSLIC-MPC100100Microsoft Office home and Student 2007124E7866B174E5738Ywu7Knlt8gyJDGtgE2UCqTUOygA = 81602 924-2637953-686791

    Content Spsys.log: 0 x 80070002

    License data-->

    C:\Windows\system32\slmgr.vbs(1333, 5) (null): these data are incorrect.

    Windows Activation Technologies-->

    HrOffline: 0x00000000

    HrOnline: 0xC004C533

    Beyond: 0 x 0000000000000000

    Event timestamp: 4:19:2015 23:24

    ActiveX: Registered, Version: 7.1.7600.16395

    The admin service: recorded, Version: 7.1.7600.16395

    Output beyond bitmask:

    --> HWID data

    N/a, hr = 0x8007000d

    Activation 1.0 data OEM-->

    N/A

    Activation 2.0 data OEM-->

    BIOS valid for OA 2.0: Yes

    Windows marker version: 0 x 20001

    OEMID and OEMTableID consistent: Yes

    BIOS information:

    ACPI Table name OEMID value OEMTableID value

    HPQOEM APIC-SLIC-MPC

    FACP                                   HP                          REPLEY

    SRAT                                    AMD                      AMD CRB

    MSCT HPQOEM SLIC-MPC

    HPQOEM HPET SLIC-MPC

    START HPQOEM SLIC-MPC

    MCFG HPQOEM SLIC-MPC

    SLIC                                      HPQOEM                             SLIC-MPC

    SSDT AMD PowerNow

    One of the most frequent causes of failures of WGA is the use of the registry the so-called "cleaners" - If you have installed everything, do yourself a favor and uninstall (or in the case of multifunction control, just don't use the registry "cleaner/optimizer based on CSSTidy")

  • Estimates of cardinality for index range scan with bind variables

    Oracle 11.2.0.4

    I am struggling to explain that the cardinality estimates for a scan of the index systematic range when using the bind variable.

    Consider the following query:

    SELECT /*+ INDEX(t1) */ *
    FROM   t1
    WHERE  source_id <= ?;
    
    

    Cardinalities for the INDEX RANGE SCAN and ACCESS of the TABLE are the same for different literal predicates, for example, source_id < = 5:

    ------------------------------------------------------------------------------------
    | Id  | Operation                   | Name | Rows  | Bytes | Cost (%CPU)| Time     |
    ------------------------------------------------------------------------------------
    |   0 | SELECT STATEMENT            |      |    50 |   350 |    12   (0)| 00:00:01 |
    |   1 |  TABLE ACCESS BY INDEX ROWID| T1   |    50 |   350 |    12   (0)| 00:00:01 |
    |*  2 |   INDEX RANGE SCAN          | IX1  |    50 |       |     2   (0)| 00:00:01 |
    ------------------------------------------------------------------------------------
    
    Predicate Information (identified by operation id):
    ---------------------------------------------------
    
       2 - access("SOURCE_ID"<=5)
    
    

    If a variable binding is used instead of a literal, the overall selectivity is 5%. However, why the optimizer based on CSSTidy gives a cardinality estimated 11 for the scan of the index systematic range? As with the predicates literal, surely the cardinalities of the index range scan and access table should be the same?

    ------------------------------------------------------------------------------------
    | Id  | Operation                   | Name | Rows  | Bytes | Cost (%CPU)| Time     |
    ------------------------------------------------------------------------------------
    |   0 | SELECT STATEMENT            |      |    50 |   350 |     5   (0)| 00:00:01 |
    |   1 |  TABLE ACCESS BY INDEX ROWID| T1   |    50 |   350 |     5   (0)| 00:00:01 |
    |*  2 |   INDEX RANGE SCAN          | IX1  |    11 |       |     2   (0)| 00:00:01 |
    ------------------------------------------------------------------------------------
    
    Predicate Information (identified by operation id):
    ---------------------------------------------------
    
       2 - access("SOURCE_ID"<=TO_NUMBER(:A))
    
    

    Unit test code:

    CREATE TABLE t1
    ( id NUMBER
    , source_id NUMBER
    );
    
    CREATE INDEX ix1 ON t1 (source_id);
    
    INSERT INTO t1
    SELECT level
         , ora_hash(level,99)+1
    FROM   dual
    CONNECT BY level <= 1000;
    
    exec DBMS_STATS.GATHER_TABLE_STATS(user,'T1')
    
    EXPLAIN PLAN FOR
    SELECT /*+ INDEX(t1) */ *
    FROM   t1
    WHERE  source_id <= 5;
    SELECT * FROM TABLE(dbms_xplan.display);
    
    EXPLAIN PLAN FOR
    SELECT /*+ INDEX(t1) */ *
    FROM   t1
    WHERE  source_id <= :a;
    SELECT * FROM TABLE(dbms_xplan.display);
    
    

    There are various places where the optimizer uses an assumption, and lie unpeekable (and of Villa "unknowable value") introduced guess.

    For unpeekable binds the conjecture for column<= {unknown}="" is="" 5%="" for="" table="" access="" (hence="" 50="" rows="" out="" of="" 1,000),="" but="" it's="" 0.009="" for="" index_column=""><= {unknown},="" which="" means="" i="" was="" expecting="" to="" see="" 9="" as="" the="" row="" estimate="" on="" the="" index="" range="">

    I just ran some quick tests, and EXPLAIN the PLAN seems to just use 0.011 selectivity in this case (in different versions of Oracle) although if we do the bind variable unpeekable at run time (and sample dynamic block etc.) optimization for execution is 0.009%.

    Concerning

    Jonathan Lewis

    Update: and this is a very old reference to the 0.009 (and 0.0045 for ' between the ' when it is applied to a clue: cost based Oracle - access Chapter 4 single B-tree )

  • selection of lines by using the stored procedure

    All the

    At the risk of asking something obvious, I would like to know if it is possible to wrap a selection within a stored procedure.

    Create the abc as procedure

    Start

    date of b;

    Select sysdate into double b;

    end;

    /

    Question: I have a select complex which should be called from JAVA. I don't want to create a VIEW since at the request of the view, indeed I will do so: SELECT * FROM (my original query) which leads to performance.

    I would like to be able to:

    exec has;

    This should give me the result of

    SELECT

    x, z, c

    Of

    one

    ;

    How can I make this possible a stored procedure?

    Thank you

    Well, yes there are ways to do it, but first of all, you are mistaken in thinking that select * from , would lead to a performance overhead.  The optimizer based on CSSTidy will optimize the request to provide results without worrying so there is no noticeable performance difference.

    Java, you probably want to use a ref cursor and get java to retrieve the results back.

    Example of refcursor function (demonstrated SQL * more I don't have Java)...

    SQL > create or replace function test RETURN as sys_refcursor
    cur_o 2 sys_refcursor;
    3. start
    4. open cur_o to select empno, ename from emp;
    5 return cur_o;
    6 end;
    7.

    The function is created.

    SQL > var r refcursor;
    SQL > exec: r: = test();

    PL/SQL procedure successfully completed.

    SQL > print r;

    EMPNO, ENAME
    ---------- ----------
    7369 SMITH
    7499 ALLEN
    7521 WARD
    7566 JONES
    7654 MARTIN
    7698 BLAKE
    7782 CLARK
    7788 SCOTT
    KING 7839
    7844 TURNER
    7876 ADAMS
    JAMES 7900
    7902 FORD
    7934 MILLER

    14 selected lines.

  • Parallel DML may be downgraded to the DML series?

    Oracle Database Enterprise Edition 11.2.0.3.0

    When you run a parallel query (e.g. SELECT * FROM parallel_table WHERE a <?), the optimizer may choose a parallel or series, the selectivity of the predicate function plan and availability different access roads - usually a scan interval series index for highly selective queries (a small number of return lines), and a parallel table full scan for less selective queries (returning a large number of lines).

    However, with parallel DML enabled, no such optimization seems to happen. There may be a very effective for a query as series plan "DELETE FROM parallel_table WHERE a <? ', but once parallel DML is activated, the optimizer based on CSSTidy always seems to choose a parallel plan.

    Is there a way to allow the optimizer to choose between series and parallel DML according to predicates in the query? I wish I could enable parallel DML, but knowing that, in the case of a very selective, query optimizer will not parallel DML use but will use a series DML.

    Note that I'm allowing to the DML, not no force in parallel it (although it seems more to do with the fact that a table series is considered parallel, without having to refer to the query).

    Here is an example of this behavior, deleted 18 m rows in a table of rows of 300 m:

    First, the cost of a DML series operation is 59,000, using an index to access the lines:

    COMMIT;

    ALTER SESSION DISABLE PARALLEL DML.

    DELETE

    OF parallel_table

    WHERE the DATETIME_a < sysdate - 650;

    ---------------------------------------------------------------------------------------------

    | ID | Operation | Name                    | Lines | Bytes | Cost (% CPU). Time |

    ---------------------------------------------------------------------------------------------

    |   0 | DELETE STATEMENT.                         |    18 M |  2037M | 58723 (1) | 00:11:45 |

    |   1.  REMOVE | PARALLEL_TABLE |       |       |            |          |

    |*  2 |   INDEX RANGE SCAN | IDX_PT_DATETIME_A |    18 M |  2037M | 58723 (1) | 00:11:45 |

    ---------------------------------------------------------------------------------------------

    Now, by allowing parallel DML, the optimizer chooses a parallel full table much more expensive for the same request, cost 926 000 scan. Why he won't come back in terms of the series?

    COMMIT;

    ALTER SESSION ENABLE PARALLEL DML.

    DELETE

    OF parallel_table

    WHERE the DATETIME_a < sysdate - 650;

    ----------------------------------------------------------------------------------------------------------------------------

    | ID | Operation | Name               | Lines | Bytes | Cost (% CPU). Time |    TQ | IN-OUT | PQ Distrib.

    ----------------------------------------------------------------------------------------------------------------------------

    |   0 | DELETE STATEMENT.                    |    18 M |  2037M |   926K (1) | 03:05:22 |        |      |            |

    |   1.  COORDINATOR OF PX |                    |       |       |            |          |        |      |            |

    |   2.   PX SEND QC (RANDOM). : TQ10001 |    18 M |  2037M |   926K (1) | 03:05:22 |  Q1, 01 | P > S | QC (RAND) |

    |   3.    INDEX MAINTENANCE | PARALLEL_TABLE |       |       |            |          |  Q1, 01 | SVCP |            |

    |   4.     RECEIVE PX |                    |    18 M |  2037M |   926K (1) | 03:05:22 |  Q1, 01 | SVCP |            |

    |   5.      RANGE OF SEND PX | : TQ10000 |    18 M |  2037M |   926K (1) | 03:05:22 |  Q1 00 | P > P | RANGE |

    |   6.       REMOVE | PARALLEL_TABLE |       |       |            |          |  Q1 00 | SVCP |            |

    |   7.        ITERATOR BLOCK PX |                    |    18 M |  2037M |   926K (1) | 03:05:22 |  Q1 00 | ISSUE |            |

    |*  8 |         TABLE ACCESS FULL | PARALLEL_TABLE |    18 M |  2037M |   926K (1) | 03:05:22 |  Q1 00 | SVCP |            |

    ----------------------------------------------------------------------------------------------------------------------------

    Dan.Jan wrote:

    So in summary, by adding a second index to the table, the optimizer computes a much higher estimate of the costs for the use of a scan of the index systematic range. As a result, he opts for the full table scan, which is not necessarily the most efficient plan. I am inclined to think that it is a bug with optimizer, as much as it manifests itself only in the line superior (0) plan.

    It's a pretty good reason to be suspicious - and I think you are right that it is a bug.

    The cost of a removal is the cost of the selection the ROWID of the lines to remove, which is in this very simple case: ' selectivity * leaf_blocks ' for the index. However, when you create the second FINAL cost index seems to change to "selectivity * (leaf_blocks + clustering_factor) ' (I ran your test case, tried a few simple variations and looked 10053 files trace - so my conclusion is not a complete analysis of the question.)

    Since you have a test case, raise a SR with Oracle.

    Concerning

    Jonathan Lewis

    (Update: added missing 'leaf_blocks' to the 2nd expression)

Maybe you are looking for