transformation of the two different database table

Hi all
I am trying to load the table from a database table to another table of database in ODI 10 g. I created two physical and logical topology.
But when in the design of the interface I drag source and target tables in the diagram window, but here he doesnot shows the auto mapping options, when I try manually by dragging a field, I failed. When I run the operation the following error has occurred:
Create or replace view db1. "" C$ _0 W_INT_ORG_D.
(

)
in select

from db1. W_INT_ORG_DS W_INT_ORG_DS
where (1 = 1)


Here db of the source and the target are the same...
How can I solve it

Click the field to the target. And then in the expression editor to write

sourcetable_alisname. FieldName

As do this for all columns, then save and close the interface.
Now open your interface, and then click on any target filed. You should see the filed source raised is automatically informed.

If everything is ok then its done.

Thank you

Tags: Business Intelligence

Similar Questions

  • How to create a Pool of connections to two different databases in OBIEE

    Hello

    I have a requirement where few reports coming from databases and a few others to another database. I created two pools of connections and added the frame connection details. But when I created the report I get error as below.

    State: HY000. Code: 10058. [NQODBC] [SQL_STATE: HY000] [nQSError: 10058] A general error occurred. [nQSError: 43113] The message returned by OBIS. [nQSError: 17001] Oracle error code: 942, message: ORA-00942: table or view does not exist to the call of the OCIStmtExecute OIC. [nQSError: 17010] Prepare the SQL statement failed. (HY000)

    Now, I would like to see if I can create a pool of connections to two different databases. If so, how that happen.

    Thank you!

    Hi Antonio,.

    Cross database joins are possible, no problem for it. But you do not do so in an object of unique data base in the physical layer using 2 pools of connections connection to the source A and B, then adding objects to A and B children of your unique database.

    You create 2 databases in the physical layer, each with its own connection pool, then you can do your knuckles crossed on the physical schema.

    As a picture is worth a thousand words, take a look:

    The physical diagram uses objects of A and B and define the rules of the join between them, it is a cross-database join. But in the physical layer of the database A and B are 2 separate objects each with its own pool of connections.

  • How to divide the screen into two parts in order to see the two different parts of the same file? [Suggestion] [Android]

    I am Brazilian and I use Adobe Acrobat Reader DC a lot. I would suggest an implementation of features present in the PC, I missed a lot of things on Android, which is 'New window' or something like that, like split the screen into two parts in order to see the two different parts of the same file.

    For smartphones, its use is restricted, but for tablets, it can be really useful, because it allows the display of two distinct points of the same file,

    I have reduced considerably the use of paper using this application, however, I need to navigate the file always pick up a few points seen earlier, which causes a lot of discomfort compared to printed documents.

    This is a suggestion, but I would like it to be considered.

    Thank you for your request. We have taken note of the same and must try to integrate it into one of our future releases.

    Thank you.

  • How can I join two tables that belong to two different databases?

    I can build a SQL query in SQL Server Management Studio, which performs a join of a table in a database with a table in another database.  I have a good 'read' name to username/password for the two databases.

    How to do the join in ColdFusion?  The tag < cfquery > requires a unique data source.  I could do like two queries and through comparing, or maybe even some use dbtype = query, but it would be horribly less effective than a direct join.

    I could place the SQL statement in a stored procedure, but that seems like overkill - all the necessary number of fields in the "WHERE" clause will change based on the logic of the ColdFusion program.

    Does anyone know of a way to do this with < cfquery >?

    How do you take in SQL Server Management Studio?  You must do something that I'm not aware, if what you're doing here does not work in a block.

    The way I did in the past is just to fully qualify the names of the tables.  Server.databaseOwner.database.table know if I remember correctly.

    This does not require that the database connected to the name of data source is configured to be allowed to connect to the database.

  • Same SQL different execution Plans in two different database instances.

    Hi all

    I run a different query on two instances of database. On one instance, the query takes 30 minutes and the other it takes 10 hours to complete. Data on the two instances are the same. When I generated the execution plan, on the two cases, it was different.

    OS: Redhat Linux 5
    Database version: 11.2.02 (on two instances)

    Plan on 1 Instance that takes 30 minutes.
    SELECT 
     X_REPLEN_RQST_INV_STG.BUSINESS_UNIT, 
     NVL(SUBSTR (W_PURCH_SCHEDULE_LINE_F.PURCH_ORDER_NUM, 
     INSTR(W_PURCH_SCHEDULE_LINE_F.PURCH_ORDER_NUM, '~', -1, 1) - LENGTH(W_PURCH_SCHEDULE_LINE_F.PURCH_ORDER_NUM)),'N/A') AS DOC_ID, 
     W_PURCH_SCHEDULE_LINE_F.PURCH_ORDER_ITEM, 
     W_PURCH_SCHEDULE_LINE_F.PURCH_SCHEDULE_NUM, 
     X_REPLEN_RQST_INV_STG.INV_ITEM_ID, 
     X_REPLEN_RQST_INV_STG.PROCESS_DATE AS REPLEN_PROCESS_DT, 
     X_REPLEN_RQST_INV_STG.EXPECTED_DATE AS REPLEN_EXPECTED_DT, 
     X_REPLEN_RQST_INV_STG.REORDER_QTY AS REPLEN_REORDER_QTY, 
     X_ITEM_ATTRIB_D.REPLENISH_CLASS AS REPLEN_CLASS, 
     X_REPLEN_RQST_INV_STG.REPLEN_STATUS, 
     X_REPLEN_RQST_INV_STG.REPLENISH_TYPE AS REPLEN_TYPE, 
     X_REPLEN_RQST_INV_STG.REQ_ID, 
     X_REPLEN_RQST_INV_STG.REQ_LINE_NBR, 
     X_REPLEN_RQST_INV_STG.REQ_SCHED_NBR, 
     X_REPLEN_RQST_INV_STG.REQ_DISTRIB_NBR, 
     P.FIRST_PO_DISP_DT, 
     W_PURCH_SCHEDULE_LINE_F.DATASOURCE_NUM_ID
FROM 
     X_REPLEN_RQST_INV_STG LEFT OUTER JOIN W_RQSTN_LINE_COST_F 
               ON X_REPLEN_RQST_INV_STG.RQSTN_LN_COST_INTG_ID = W_RQSTN_LINE_COST_F.INTEGRATION_ID 
                    AND X_REPLEN_RQST_INV_STG.DATASOURCE_NUM_ID = W_RQSTN_LINE_COST_F.DATASOURCE_NUM_ID 
     LEFT OUTER JOIN W_PURCH_COST_F 
               ON W_RQSTN_LINE_COST_F.INTEGRATION_ID = W_PURCH_COST_F.REQ_DISTR_INTG_ID 
                    AND W_RQSTN_LINE_COST_F.DATASOURCE_NUM_ID = W_PURCH_COST_F.DATASOURCE_NUM_ID 
     INNER join W_PURCH_SCHEDULE_LINE_F 
               ON W_PURCH_COST_F.PURCH_SCHEDULE_INTG_ID = W_PURCH_SCHEDULE_LINE_F.INTEGRATION_ID 
                    AND W_PURCH_COST_F.DATASOURCE_NUM_ID = W_PURCH_SCHEDULE_LINE_F.DATASOURCE_NUM_ID 
     LEFT OUTER JOIN W_STATUS_D S1 
               ON W_RQSTN_LINE_COST_F.APPROVAL_STATUS_WID = S1.ROW_WID 
                    AND W_RQSTN_LINE_COST_F.DATASOURCE_NUM_ID = S1.DATASOURCE_NUM_ID 
                    AND 'PURCH_APPROVE' = S1.W_STATUS_CLASS 
     LEFT OUTER JOIN W_STATUS_D S2 
               ON W_PURCH_COST_F.APPROVAL_STATUS_WID = S2.ROW_WID 
                    AND W_PURCH_COST_F.DATASOURCE_NUM_ID = S2.DATASOURCE_NUM_ID 
                    AND 'PURCH_APPROVE' = S2.W_STATUS_CLASS 
     LEFT OUTER JOIN (SELECT p1.BUSINESS_UNIT, p1.PO_ID, MIN(p1.DATETIME_DISP) AS FIRST_PO_DISP_DT
FROM 
          X_PS_PO_DISPATCHED p1 GROUP BY p1.BUSINESS_UNIT, p1.PO_ID) P 
               ON SUBSTR (W_PURCH_SCHEDULE_LINE_F.PURCH_ORDER_NUM, 1, INSTR(W_PURCH_SCHEDULE_LINE_F.PURCH_ORDER_NUM, '~', 1, 1)-1) = P.BUSINESS_UNIT 
                    AND SUBSTR (W_PURCH_SCHEDULE_LINE_F.PURCH_ORDER_NUM, INSTR(W_PURCH_SCHEDULE_LINE_F.PURCH_ORDER_NUM, '~', -1, 1) - LENGTH(W_PURCH_SCHEDULE_LINE_F.PURCH_ORDER_NUM)) = 

P.PO_ID      
     LEFT OUTER JOIN W_PRODUCT_D 
               ON W_PURCH_SCHEDULE_LINE_F.PRODUCT_WID = W_PRODUCT_D.ROW_WID 
     LEFT OUTER JOIN X_ITEM_ATTRIB_D 
               ON SUBSTR (W_PURCH_SCHEDULE_LINE_F.PURCH_ORDER_NUM, 1, INSTR(W_PURCH_SCHEDULE_LINE_F.PURCH_ORDER_NUM, '~', 1, 1)-1) = X_ITEM_ATTRIB_D.BUSINESS_UNIT 
                    AND W_PRODUCT_D.PART_NUM = X_ITEM_ATTRIB_D.INV_ITEM_ID
WHERE 
     TRIM(X_REPLEN_RQST_INV_STG.req_id) IS NOT NULL 
     AND X_REPLEN_RQST_INV_STG.replenish_type = '1' 
     AND X_REPLEN_RQST_INV_STG.replen_status = '4' 
     AND X_ITEM_ATTRIB_D.REPLENISH_CLASS = 'A' 
     AND S1.STATUS_CODE != 'X' 
     AND S2.STATUS_CODE != 'X' 
     AND P.FIRST_PO_DISP_DT IS NOT NULL

Execution Plan
----------------------------------------------------------
Plan hash value: 1674299164

----------------------------------------------------------------------------------------------------------------
| Id  | Operation                            | Name                    | Rows  | Bytes | Cost (%CPU)| Time     |
----------------------------------------------------------------------------------------------------------------
|   0 | SELECT STATEMENT                     |                         |     1 |   461 | 13942   (1)| 00:04:11 |
|*  1 |  HASH JOIN                           |                         |     1 |   461 | 13942   (1)| 00:04:11 |
|   2 |   NESTED LOOPS                       |                         |       |       |            |          |
|   3 |    NESTED LOOPS                      |                         |     1 |   441 | 10409   (1)| 00:03:08 |
|   4 |     NESTED LOOPS                     |                         |     1 |   421 | 10407   (1)| 00:03:08 |
|   5 |      NESTED LOOPS                    |                         |     1 |   388 | 10406   (1)| 00:03:08 |
|   6 |       NESTED LOOPS                   |                         |     1 |   319 | 10405   (1)| 00:03:08 |
|   7 |        NESTED LOOPS                  |                         |     1 |   280 | 10404   (1)| 00:03:08 |
|*  8 |         HASH JOIN                    |                         |     1 |   220 | 10401   (1)| 00:03:08 |
|   9 |          NESTED LOOPS                |                         |       |       |            |          |
|  10 |           NESTED LOOPS               |                         |    16 |  2896 | 10392   (1)| 00:03:08 |
|* 11 |            TABLE ACCESS FULL         | X_REPLEN_RQST_INV_STG   |    16 |  2432 | 10375   (1)| 00:03:07 |
|* 12 |            INDEX UNIQUE SCAN         | W_RQST_LN_CS_F_U1       |     1 |       |     1   (0)| 00:00:01 |
|  13 |           TABLE ACCESS BY INDEX ROWID| W_RQSTN_LINE_COST_F     |     1 |    29 |     2   (0)| 00:00:01 |
|* 14 |          TABLE ACCESS FULL           | W_STATUS_D              |     1 |    39 |     8   (0)| 00:00:01 |
|  15 |         TABLE ACCESS BY INDEX ROWID  | W_PURCH_COST_F          |     1 |    60 |     3   (0)| 00:00:01 |
|* 16 |          INDEX RANGE SCAN            | W_PURCH_COST_F_M1       |     1 |       |     2   (0)| 00:00:01 |
|* 17 |        TABLE ACCESS BY INDEX ROWID   | W_STATUS_D              |     1 |    39 |     1   (0)| 00:00:01 |
|* 18 |         INDEX UNIQUE SCAN            | W_STATUS_D_P1           |     1 |       |     0   (0)| 00:00:01 |
|  19 |       TABLE ACCESS BY INDEX ROWID    | W_PURCH_SCHEDULE_LINE_F |     1 |    69 |     1   (0)| 00:00:01 |
|* 20 |        INDEX UNIQUE SCAN             | W_PRCH_SC_LN_F_U1       |     1 |       |     1   (0)| 00:00:01 |
|  21 |      TABLE ACCESS BY INDEX ROWID     | W_PRODUCT_D             |     1 |    33 |     1   (0)| 00:00:01 |
|* 22 |       INDEX UNIQUE SCAN              | W_PRODUCT_D_P1          |     1 |       |     0   (0)| 00:00:01 |
|* 23 |     INDEX RANGE SCAN                 | X_ITEM_ATTRIB_U01       |     1 |       |     1   (0)| 00:00:01 |
|* 24 |    TABLE ACCESS BY INDEX ROWID       | X_ITEM_ATTRIB_D         |     1 |    20 |     2   (0)| 00:00:01 |
|  25 |   VIEW                               |                         |  1428K|    27M|  3529   (2)| 00:01:04 |
|* 26 |    FILTER                            |                         |       |       |            |          |
|  27 |     HASH GROUP BY                    |                         |  1428K|    27M|  3529   (2)| 00:01:04 |
|  28 |      TABLE ACCESS FULL               | X_PS_PO_DISPATCHED      |  1428K|    27M|  3493   (1)| 00:01:03 |
----------------------------------------------------------------------------------------------------------------
    On the Instance 2
    SELECT 
     X_REPLEN_RQST_INV_STG.BUSINESS_UNIT, 
     NVL(SUBSTR (W_PURCH_SCHEDULE_LINE_F.PURCH_ORDER_NUM, 
     INSTR(W_PURCH_SCHEDULE_LINE_F.PURCH_ORDER_NUM, '~', -1, 1) - LENGTH(W_PURCH_SCHEDULE_LINE_F.PURCH_ORDER_NUM)),'N/A') AS DOC_ID, 
     W_PURCH_SCHEDULE_LINE_F.PURCH_ORDER_ITEM, 
     W_PURCH_SCHEDULE_LINE_F.PURCH_SCHEDULE_NUM, 
     X_REPLEN_RQST_INV_STG.INV_ITEM_ID, 
     X_REPLEN_RQST_INV_STG.PROCESS_DATE AS REPLEN_PROCESS_DT, 
     X_REPLEN_RQST_INV_STG.EXPECTED_DATE AS REPLEN_EXPECTED_DT, 
     X_REPLEN_RQST_INV_STG.REORDER_QTY AS REPLEN_REORDER_QTY, 
     X_ITEM_ATTRIB_D.REPLENISH_CLASS AS REPLEN_CLASS, 
     X_REPLEN_RQST_INV_STG.REPLEN_STATUS, 
     X_REPLEN_RQST_INV_STG.REPLENISH_TYPE AS REPLEN_TYPE, 
     X_REPLEN_RQST_INV_STG.REQ_ID, 
     X_REPLEN_RQST_INV_STG.REQ_LINE_NBR, 
     X_REPLEN_RQST_INV_STG.REQ_SCHED_NBR, 
     X_REPLEN_RQST_INV_STG.REQ_DISTRIB_NBR, 
     P.FIRST_PO_DISP_DT, 
     W_PURCH_SCHEDULE_LINE_F.DATASOURCE_NUM_ID
FROM 
     X_REPLEN_RQST_INV_STG LEFT OUTER JOIN W_RQSTN_LINE_COST_F 
               ON X_REPLEN_RQST_INV_STG.RQSTN_LN_COST_INTG_ID = W_RQSTN_LINE_COST_F.INTEGRATION_ID 
                    AND X_REPLEN_RQST_INV_STG.DATASOURCE_NUM_ID = W_RQSTN_LINE_COST_F.DATASOURCE_NUM_ID 
     LEFT OUTER JOIN W_PURCH_COST_F 
               ON W_RQSTN_LINE_COST_F.INTEGRATION_ID = W_PURCH_COST_F.REQ_DISTR_INTG_ID 
                    AND W_RQSTN_LINE_COST_F.DATASOURCE_NUM_ID = W_PURCH_COST_F.DATASOURCE_NUM_ID 
     INNER join W_PURCH_SCHEDULE_LINE_F 
               ON W_PURCH_COST_F.PURCH_SCHEDULE_INTG_ID = W_PURCH_SCHEDULE_LINE_F.INTEGRATION_ID 
                    AND W_PURCH_COST_F.DATASOURCE_NUM_ID = W_PURCH_SCHEDULE_LINE_F.DATASOURCE_NUM_ID 
     LEFT OUTER JOIN W_STATUS_D S1 
               ON W_RQSTN_LINE_COST_F.APPROVAL_STATUS_WID = S1.ROW_WID 
                    AND W_RQSTN_LINE_COST_F.DATASOURCE_NUM_ID = S1.DATASOURCE_NUM_ID 
                    AND 'PURCH_APPROVE' = S1.W_STATUS_CLASS 
     LEFT OUTER JOIN W_STATUS_D S2 
               ON W_PURCH_COST_F.APPROVAL_STATUS_WID = S2.ROW_WID 
                    AND W_PURCH_COST_F.DATASOURCE_NUM_ID = S2.DATASOURCE_NUM_ID 
                    AND 'PURCH_APPROVE' = S2.W_STATUS_CLASS 
     LEFT OUTER JOIN (SELECT p1.BUSINESS_UNIT, p1.PO_ID, MIN(p1.DATETIME_DISP) AS FIRST_PO_DISP_DT
FROM 
          X_PS_PO_DISPATCHED p1 GROUP BY p1.BUSINESS_UNIT, p1.PO_ID) P 
               ON SUBSTR (W_PURCH_SCHEDULE_LINE_F.PURCH_ORDER_NUM, 1, INSTR(W_PURCH_SCHEDULE_LINE_F.PURCH_ORDER_NUM, '~', 1, 1)-1) = P.BUSINESS_UNIT 
                    AND SUBSTR (W_PURCH_SCHEDULE_LINE_F.PURCH_ORDER_NUM, INSTR(W_PURCH_SCHEDULE_LINE_F.PURCH_ORDER_NUM, '~', -1, 1) - LENGTH(W_PURCH_SCHEDULE_LINE_F.PURCH_ORDER_NUM)) = 

P.PO_ID      
     LEFT OUTER JOIN W_PRODUCT_D 
               ON W_PURCH_SCHEDULE_LINE_F.PRODUCT_WID = W_PRODUCT_D.ROW_WID 
     LEFT OUTER JOIN X_ITEM_ATTRIB_D 
               ON SUBSTR (W_PURCH_SCHEDULE_LINE_F.PURCH_ORDER_NUM, 1, INSTR(W_PURCH_SCHEDULE_LINE_F.PURCH_ORDER_NUM, '~', 1, 1)-1) = X_ITEM_ATTRIB_D.BUSINESS_UNIT 
                    AND W_PRODUCT_D.PART_NUM = X_ITEM_ATTRIB_D.INV_ITEM_ID
WHERE 
     TRIM(X_REPLEN_RQST_INV_STG.req_id) IS NOT NULL 
     AND X_REPLEN_RQST_INV_STG.replenish_type = '1' 
     AND X_REPLEN_RQST_INV_STG.replen_status = '4' 
     AND X_ITEM_ATTRIB_D.REPLENISH_CLASS = 'A' 
     AND S1.STATUS_CODE != 'X' 
     AND S2.STATUS_CODE != 'X' 
     AND P.FIRST_PO_DISP_DT IS NOT NULL


---------------------------------------------------------------------------------------------------------------
| Id  | Operation                           | Name                    | Rows  | Bytes | Cost (%CPU)| Time     |
---------------------------------------------------------------------------------------------------------------
|   0 | SELECT STATEMENT                    |                         |     1 |   420 | 19630   (1)| 00:04:35 |
|   1 |  NESTED LOOPS                       |                         |       |       |            |       |
|   2 |   NESTED LOOPS                      |                         |     1 |   420 | 19630   (1)| 00:04:35 |
|   3 |    NESTED LOOPS                     |                         |     1 |   400 | 19627   (1)| 00:04:35 |
|   4 |     NESTED LOOPS                    |                         |     1 |   386 | 19626   (1)| 00:04:35 |
|   5 |      NESTED LOOPS                   |                         |     1 |   317 | 19625   (1)| 00:04:35 |
|   6 |       NESTED LOOPS                  |                         |     1 |   289 | 19624   (1)| 00:04:35 |
|   7 |        NESTED LOOPS                 |                         |     1 |   229 | 19621   (1)| 00:04:35 |
|   8 |         NESTED LOOPS                |                         |     1 |   201 | 19620   (1)| 00:04:35 |
|   9 |          MERGE JOIN CARTESIAN       |                         |     1 |   172 | 19619   (1)| 00:04:35 |
|  10 |           VIEW                      |                         |     1 |    20 |  4942   (2)| 00:01:10 |
|* 11 |            FILTER                   |                         |       |       |            |       |
|  12 |             HASH GROUP BY           |                         |     1 |    20 |  4942   (2)| 00:01:10 |
|  13 |              TABLE ACCESS FULL      | X_PS_PO_DISPATCHED      |  1428K|    27M|  4902   (1)| 00:01:09 |
|  14 |           BUFFER SORT               |                         |     1 |   152 | 19619   (1)| 00:04:35 |
|* 15 |            TABLE ACCESS FULL        | X_REPLEN_RQST_INV_STG   |     1 |   152 | 14676   (1)| 00:03:26 |
|  16 |          TABLE ACCESS BY INDEX ROWID| W_RQSTN_LINE_COST_F     |     1 |    29 |     1   (0)| 00:00:01 |
|* 17 |           INDEX UNIQUE SCAN         | W_RQST_LN_CS_F_U1       |     1 |       |     1   (0)| 00:00:01 |
|* 18 |         TABLE ACCESS BY INDEX ROWID | W_STATUS_D              |     1 |    28 |     1   (0)| 00:00:01 |
|* 19 |          INDEX UNIQUE SCAN          | W_STATUS_D_P1           |     1 |       |     0   (0)| 00:00:01 |
|  20 |        TABLE ACCESS BY INDEX ROWID  | W_PURCH_COST_F          |     3 |   180 |     3   (0)| 00:00:01 |
|* 21 |         INDEX RANGE SCAN            | W_PURCH_COST_F_M1       |     1 |       |     2   (0)| 00:00:01 |
|* 22 |       TABLE ACCESS BY INDEX ROWID   | W_STATUS_D              |     1 |    28 |     1   (0)| 00:00:01 |
|* 23 |        INDEX UNIQUE SCAN            | W_STATUS_D_P1           |     1 |       |     0   (0)| 00:00:01 |
|* 24 |      TABLE ACCESS BY INDEX ROWID    | W_PURCH_SCHEDULE_LINE_F |     1 |    69 |     1   (0)| 00:00:01 |
|* 25 |       INDEX UNIQUE SCAN             | W_PRCH_SC_LN_F_U1       |     1 |       |     1   (0)| 00:00:01 |
|* 26 |     TABLE ACCESS BY INDEX ROWID     | W_PRODUCT_D             |     1 |    14 |     1   (0)| 00:00:01 |
|* 27 |      INDEX UNIQUE SCAN              | W_PRODUCT_D_P1          |     1 |       |     0   (0)| 00:00:01 |
|* 28 |    INDEX RANGE SCAN                 | X_ITEM_ATTRIB_U01       |     1 |       |     2   (0)| 00:00:01 |
|* 29 |   TABLE ACCESS BY INDEX ROWID       | X_ITEM_ATTRIB_D         |     1 |    20 |     3   (0)| 00:00:01 |
---------------------------------------------------------------------------------------------------------------
    In the second execution plan, we can see that it uses a Cartesian product.

    Thank you.

    Oceaner wrote:
    Hi all

    I run a different query on two instances of database. On one instance, the query takes 30 minutes and the other it takes 10 hours to complete. Data on the two instances are the same. When I generated the execution plan, on the two cases, it was different.

    The most obvious difference is the subquery total inline:

    Quick plan:

    ----------------------------------------------------------------------------------------------------------------
| Id  | Operation                            | Name                    | Rows  | Bytes | Cost (%CPU)| Time     |
----------------------------------------------------------------------------------------------------------------
|*  1 |  HASH JOIN                           |                         |     1 |   461 | 13942   (1)| 00:04:11 |
|   2 |   NESTED LOOPS                       |                         |       |       |            |          |
...
|  25 |   VIEW                               |                         |  1428K|    27M|  3529   (2)| 00:01:04 |
|* 26 |    FILTER                            |                         |       |       |            |          |
|  27 |     HASH GROUP BY                    |                         |  1428K|    27M|  3529   (2)| 00:01:04 |
|  28 |      TABLE ACCESS FULL               | X_PS_PO_DISPATCHED      |  1428K|    27M|  3493   (1)| 00:01:03 |
----------------------------------------------------------------------------------------------------------------

    Plan of slow

    ---------------------------------------------------------------------------------------------------------------
| Id  | Operation                           | Name                    | Rows  | Bytes | Cost (%CPU)| Time     |
---------------------------------------------------------------------------------------------------------------
...
|   9 |          MERGE JOIN CARTESIAN       |                         |     1 |   172 | 19619   (1)| 00:04:35 |
|  10 |           VIEW                      |                         |     1 |    20 |  4942   (2)| 00:01:10 |
|* 11 |            FILTER                   |                         |       |       |            |          |
|  12 |             HASH GROUP BY           |                         |     1 |    20 |  4942   (2)| 00:01:10 |
|  13 |              TABLE ACCESS FULL      | X_PS_PO_DISPATCHED      |  1428K|    27M|  4902   (1)| 00:01:09 |
|  14 |           BUFFER SORT               |                         |     1 |   152 | 19619   (1)| 00:04:35 |
|* 15 |            TABLE ACCESS FULL        | X_REPLEN_RQST_INV_STG   |     1 |   152 | 14676   (1)| 00:03:26 |
...
---------------------------------------------------------------------------------------------------------------

    Note the value of lines given to the operation - VIEW


    One for the slow plan - that of why Oracle chose display online as a starting point for the query and used a Cartesian merge join to join to the table nearby.

    1.4Million for the fast plan - this is why Oracle has decided to visit the table set and use it as the table of the probe in a hash join.

    I think we can assume that the estimation of the single line is a big mistake. We can also assume that the two series of statistics (or possibly index definitions) on the tables two versions do not match.

    It would be useful, of course, see the comprehensive implementation plan, and preferably one from memory: (http://jonathanlewis.wordpress.com/2006/12/22/dbms_xplan-again/).

    You might notice that you outer joins are not relevant - maybe this SQL is a framework for a more general query - given that the plan shows that they have all been turned away.

    Concerning
    Jonathan Lewis
    http://jonathanlewis.WordPress.com
    Author: core Oracle

  • New search with two different database Page

    Hi all

    I got a new work in which I design a page using OFA where, in two fields (2 boxes) are present that references on behalf of the Organization and values such as LPN...

    ----------------------------------------------------------------------------------------
    Name of organization: (text box with LOV icon)

    LPN values:---(zone de texte avec icône LOV)

    Go cancel


    Table of results

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


    In this the is organization name text box refers to a database and the Lpn to the other databases values text box...

    In case of employee exercise research I got the name of the employee and the employee number in the same database... But here its different... How do I get this resolved? Is it possible to do so in the OPS?

    Ganesh

    Then no problem. Create two different VO and create messageLovInputs based on these VO. Let us know if you face any problems with it.

    Thank you
    AJ

  • How to create views of data from different databases tables in2

    Using Oracle 10.2 g

    I have 2 databases Gus and the haggis on schema Comqdhb.

    Glink indicates a link of database between Haggis and Gus

    In Gus, there is school that contains columns with same name upn, grade, subject, student of tables...

    STUDENT
    UPN
    academicYear

    Object

    Object

    GRADE
    examlevel
    grade

    SCHOOL
    SN

    In HAGGIS raising tables, grade, teacher containing columns upn... desc below.

    STUDENT
    UPN

    GRADE
    grade
    UPN
    academicyear
    level



    Create views in your database HAGGIS who join their all the qualities of the review. You should have a point of view that will produce the following relationship:
    examGrade (upn, subject, examlevel, sn, rank, academicYear)

    So I need to create a view that gets the data from the tables in the databases.

    create view as examGrade (upn, subject, examlevel, sn, rank, academicYear) like some s.upn


    But I don't get the selection of a column of 2 tables in different databases

    I mean if I said

    Select the UPN in comqdhb.student@glink,comqdhb.student;
    Select the upn name in comqdhb.student@glink,comqdhb.student
    *
    ERROR on line 1:
    ORA-00918: column ambiguously defined

    Help me, thank you.

    Hello

    Rider wrote:
    The issue is that I can't understand that I should create the view by the union of the haggis and the two gus data or only haggis.
    the reason I believe I need to combine the two is mentioned * "" create views in your database schema HAGGIS who join their all the qualities of the review. ". *
    By the mention of creating views and who join their all the qualities of the review, it probably means to obtain the data of the GUS and HAGGIS.

    This is my interpretation of the assignment, too.
    If you ask just the tables on Gus, you will get the ranks of three of the four schools: it's not all examination classes.
    If you ask just the tables on Haggis, you will get the ranks of any of the four schools: it's not all examination classes.

    2nd prob is that if have decided to create a view that gets the data from these two gus and therer haggis would be a lot of duplication involved due to the cross product

    Why would there be "repetition involved due to the cross-product"?
    If the quuery of Gus produces 100 lines, the request of product Haggis 30 rows, then the UNION of the two will have 100 + 30 = 130 lines (assuming, as you say, each student is at school only one).

    the query I wrote is

    Create view examGrade (upn, subject, examlevel, sn, rank, academicYear)
    as
    Select distinct s.upn as upn, g.subject as topic,
    g."LEVEL" as examlevel, g.grade as rank, to_number (g.academicyear) as academicyear
    of s comqdhb.student, comqdhb.grade g
    s.UPN, sb.subject, g.elevel, g.grade, s.acyr select Union
    of comqdhb.subject@glink sb,comqdhb.student@glink s,comqdhb.gradevalues@glink g;

    You should not write, not to mention not formatted zip code. I have a little time I can devote to answering questions in the forum. Do you want me
    b spend this time formatting your code, so I can understand the question, and no time to answer, or
    b spend only a little time reading understanding your code and spend most of my time to help you?
    I would prefer (b), but the choice is yours.
    See the statement that I posted in my last post for an example of the formatted code. You see how it appears in a box with a police fixed-width, and multiple spaces are printed? This is because I typed {code} (all small letters), before and after the section I wanted formatted.

    At least put each table in the FROM clause on a separate line, so it is easy to know if you have enough join conditions.
    If you have N tables in the FROM clause, you almost always have at least N-1 join conditions that specify how the tables are linked together. For example, if talk you about two tables, quality and student, you expect to see a join condition that tells you when you have data in a table, how to find related data in the other table, such as

    g_gus.upn = s_gus.upn

    No no no join conditions will cause "repetition involved due to the cross product.

    I downloaded my info here
    http://www.upload4free.com/download.php?file=44201983-School_ExamGrades.PDF


    http://www.upload4free.com/download.php?file=184648736-ExamGrades_Case_Study_2008FINAL.PDF

    Sorry, if there is data as long as you can't post here, there is much too much for me to read.
    Make a sample set, containing a few (maybe five) students and a few shades of each student. It is fine to copy a few lines of your actual data.

    That's all the time I have for today. I can't wait to get the data and formatted requests.

  • I tried for AN HOUR to find a way to put the two different fonts on the same line

    Pages is crap. I tried for AN HOUR to find a way to put the two fonts on the same line, even if I highlight 1 WORD, the whole line changes (if you know how to do that please tell me, I'll me CRAZY!). Wouldn't recommend, that Word is 100 x better and easier to use

    < published by host >

    Hi varn,.

    Seems to work here (Pages of screen capture):

    Select (highlight) the text you want to change. Click on the Format brush, and then click Style. Choose the font you want to use.

    The example above is in the text layer. I also tried in a text box and a table cell.

    I also tried to change the font for a single word of a line of text in Pages for iOS. The police has changed to the selected word, while the rest of the line remained in the police, he had previously.

    Cannot test it in 5 Pages, because I have not installed. The above example is Pages ' 09.

    It is possible that you have applied to a paragraph Style, what would change everything in the paragraph containing the insertion point.

    Kind regards

    Barry

    PS: MS Word is available for OS X, if you feel the need to switch.

    B

  • Scroll the two indicators in table at the same time

    How to scroll the scroll bar of the two table flag simultaneously?

    Thanks in advance

    Try this minor mod to allow either scroll to be active - and like NIquist said-controller to the bottom of the loop

  • A VCS - C with two clients of course to the two different VCS - E (traversal servers)

    Hello

    Can I have a WHAT VCS - C connected to two different VCS-E?

    So, I will configure two 'route customers' VCS - C each pointing to VCS - E, and each VCS-E will have a 'crossing server' set up.

    Hello Jose,.

    Yes, it is possible, you can have several customer experience (and also servers traversal) on each VCS.

    Jens: there is an abundance of deployments where this would be wise. A cluster can have meaning where you need a logic of instance, which is be of multiple physical boxes.

    We have customers who need an environment safe, so that they have a VCS - E for outbound communications, generic endpoints and then VCS-control a VCS-E for another network to terminate VPN connections internal who couldn't talk directly inside.

    There was one other poster here recently where a company had a VCS - E + C Setup, the other

    C only, so that they could use a VCS-E talk to each other.

    But even in the same network where you want to cluster, but you cannot due to

    various geolocations with much delay between the sites...

    And so now ;-)

  • To connect two different database instance, what configuration in web cleint is necessary?


    Hi all

    We had two P6 database instance as a DEV and PROD

    We want to configure the web client so that the user can select either DEV or PROD according to the requirement by the same URL.

    Can you please tell me what I need to do in the web to work with two DB instance client?

    Normally, changes are reflected without bouncing the middle tier (weblogic Server). If t is not then rebound / restart the server managed by admin / when P6 application is deployed.

    Kind regards

    Sachin Gupta

  • Get the count of the two different statuses in SQL query

    Hi Experts,
    ALTER TABLE EMP ADD STATUS INTEGER DEFAULT 1 NOT NULL;
UPDATE EMP SET STATUS=2 WHERE EMPNO > 7700
SELECT COUNT(*) OVER() TOTALRECORDS,EMP.DEPTNO,EMP.EMPNO FROM EMP,DEPT WHERE EMP.DEPTNO=EMP.DEPTNO
    The Select query will return the total number of the EMP, DEPT tables (the two status with 1 and 2).
    But I need to get the number of 1 and 2 separately.

    Is this possible with changes in an existing SQL query?

    Thank you
    Dharan V 
    ALTER TABLE EMP ADD STATUS INTEGER DEFAULT 1 NOT NULL;
UPDATE EMP SET STATUS=2 WHERE EMPNO > 7700
SELECT COUNT(*) OVER() TOTALRECORDS,EMP.DEPTNO,EMP.EMPNO FROM EMP,DEPT WHERE EMP.DEPTNO=EMP.DEPTNO

    change this option like this

    SELECT COUNT(decode(status,1,1,null)) OVER() RECORDS_1,
       COUNT(decode(status,2,2,null)) over() RECORDS_2,
       EMP.DEPTNO,EMP.EMPNO
  FROM EMP,DEPT WHERE EMP.DEPTNO=EMP.DEPTNO

  • How to check the existence of database table?

    I want to check if a certain database table exists, if so run the code / display message etc.
    not if the table contains data or not, but if it's in the database.

    Any idea?

    Thank you!

    find a way to query the system tables, assuming that you have permission to do so. The details are specific to db.

  • How to consolidate the two different versions of the same album on a Walkman?

    I have two files "Worlds Torn Asunder" and "Worlds Torn Asunder [+ Digital Booklet] the first to 8 of the 10 songs while the latter contains the other two. When I open my list on the player, I have an option for each file and cannot read the album in its entirety in a single race because of this. I tried to copy and paste the two DB Edition to the standard edition, but the player just puts copies in the DB folder, even if they are in the standard folder on my computer.

    (Sorry for posting in the wrong section, but I cannot click on the options available in the menu "show all".)

    Hello Christopher,

    Welcome to the community of Sony.

    Try to copy the files on your computer and remove the Walkman player. After that, create a unique folder with all 10 songs on your computer. Connect the Walkman player to your computer and transfer the new folder with all 10 songs. Check if this workaround works.

    If my post answered your question, please mark it as an "accepted Solution".

  • The size of a difference in performance between the two different graphics cards

    Hey, I'm in the middle of upgrading my system and I try to spend my tax return on0 graphics cards. I'll run an SLI with Nvidia GTX 660 or 680 GTX. Now I realize the 680 is high the hand better than 660 I want to know is, it is better to the difference in price proformance wise. I intend to get two of them and SLI them, here are the two that I'm looking

    http://www.newegg.com/Product/Product.aspx?Item=N82E16814127699 - GTX 660

    http://www.newegg.com/Product/Product.aspx?Item=N82E16814127723 - GTX 680

    I'm running CS6 if I want to stay in the 600 series of Nvidia cards that are on the whitelist for CS6. I want to choose between these two cards because I'm under eyefinity right now and I can't go back, these Nvidia Surround support out of the box with any necessary adapters. MSI heatsinks are also fantastic with these cards.

    So basically what I'm asking, is the proformance go with 2 of the 680 years is worth the $500 price difference?

    Here is my system in its present form:

    Processor: AMD Phenom II X 6 3.2 GHz-> go to AMD 9590 x 8 5 GHz after I buy graphics cards

    RAM 16 GB Corsair Dominator 8-8-8-20

    Samsung 840 EVO 250 GB SSD (drive)

    Corsair 64 GB SSD as a scratch disk

    2 TB WD Black HDD as mass storage

    AMD Radion 6790-> will upgrading to one of the above cards

    Windows 8.1

    For After Effects, there is no reason to spend the extra money, unless you use a specific feature: the 3D rendering engine traced to the RADIUS. If you do not use this feature, and your focus is After Effects, then spend your extra money on RAM and SSD.

    See this page for more information about how After Effects uses the GPU:

    http://blogs.Adobe.com/AfterEffects/2012/05/GPU-CUDA-OpenGL-features-in-after-effects-CS6. HTML

    See this page for more information on material for Premiere Pro and Adobe After Effects: http://adobe.ly/pRYOuk

Maybe you are looking for

  • Error message with gobbledygook window at startup - Mac

    For the last 6 months or more, at startup to keep get this window error message when I start my iMac. A gibberish in it: "Bookmark88" (then symbols/gibberish).Below this line: "ApplicationsThunderbird.app" (and then the symbols/gibberish).Below this

  • Login Skype error

    Gives an error when I connect to my account, and if you leave the account cannot enter more need to restart the PC to connect to my account.

  • Assembly of an ssd on y580

    Hello I have a y580 without SSD. Have the possibility to install a separate DSS on this subject?And if possible how?& one last question, intel rapid begins work on without ssd systems? Thank you.

  • HP Compaq 6910p: empty Slot memory HP Compaq 6910p in

    Hello I'm working on a laptop HP Compaq 6910p for a friend. I removed the cover of the memory to make a larger version of the XP license copy # and I was surprised to find there is no memory in the memory slot. I went into the BIOS, and it shows that

  • Run the defragmentation at the next startup tool

    My Defragmenter is scheduled by default to defragment my hard drive a week.  Sometimes, my computer is off at the agreed time.  How can I get the defragment to run automatically when the next power?  Thank you.