" Dedication To Prarva, and Abe, for a dream of more, and life surpassing the dream" "Dan doesn't guess. Let me boldface that and underline it. He doesn't execute an iterative guess-loop like I did, trying one idea after another in the hope of stumbling across an improvement. Instead, Dan uses an innovative and mathematically based diagramming method to derive the optimal, or near-optimal, execution plan for a SQL statement. Then he puts that plan into effect. And that's it. There's no guesswork, and there's no uncertainty as to whether further improvement is possible." "Chapter 1. Introduction Well begun is half done. ÑAristotle Politics, Bk. V, Ch. 4" (Indexed_Number_Column >= 123 AND Indexed_Number_Column < 124) OR (Indexed_Number_Column >= 1230 AND Indexed_Number_Column < 1240) OR (Indexed_Number_Column >= 12300 AND Indexed_Number_Column < 12400) OR... " CREATE TABLE PLAN_TABLE( STATEMENT_ID VARCHAR2(30), TIMESTAMP DATE, REMARKS VARCHAR2(80), OPERATION VARCHAR2(30), OPTIONS VARCHAR2(30), OBJECT_NODE VARCHAR2(128), OBJECT_OWNER VARCHAR2(30), OBJECT_NAME VARCHAR2(30), OBJECT_INSTANCE NUMBER(38), OBJECT_TYPE VARCHAR2(30), OPTIMIZER VARCHAR2(255), SEARCH_COLUMNS NUMBER(38), ID NUMBER(38), PARENT_ID NUMBER(38), POSITION NUMBER(38), COST NUMBER(38), CARDINALITY NUMBER(38), BYTES NUMBER(38), OTHER_TAG VARCHAR2(255), OTHER LONG);" " PLAN ---------------------------------------------------------------------- SELECT STATEMENT NESTED LOOPS NESTED LOOPS NESTED LOOPS TABLE ACCESS BY INDEX ROWID 4*EMPLOYEES INDEX RANGE SCAN EMPLOYEE_LAST_NAME TABLE ACCESS BY INDEX ROWID 3*EMPLOYEES INDEX UNIQUE SCAN EMPLOYEE_PKEY TABLE ACCESS BY INDEX ROWID 2*LOCATIONS INDEX UNIQUE SCAN LOCATION_PKEY TABLE ACCESS BY INDEX ROWID 1*LOCATIONS INDEX UNIQUE SCAN LOCATION_PKEY SQL> " "Universal Techniques for Controlling Plans" "It is well to moor your bark with two anchors. ÑPublilius Syrus (a.k.a. Publius) Maxim 119" "10.1 When Very Fast Is Not Fast Enough"