Plan amendment

Hello. Can you help me how to change my subscription to pay only for Illustrator? I have paid for the cc annual adobe for 13 months and would like to keep only Illustrator now. I started seriously upset because there is no help at all. Thank you.

Cancel your membership creative cloud

To the link below, click on the still need help? option in the blue box below and choose the option to chat or by phone...
Make sure that you are logged on the Adobe site, having cookies enabled, clearing your cookie cache.  If he continues to not try to use a different browser.

https://helpx.Adobe.com/contact.html?step=CCSN_membership-account-payment_cancel-your-memb ership_stillNeedHelp

Tags: Adobe

Similar Questions

  • How to find why the plan amended

    We are using Oracle 11.2.0.3. In our production system, one of the SQL started using different plan_hash_value afternoon today. This increase has elapsed time to 1 + minutes rather than the second. There was no change of system at the time. After rinsing shared_pool, the query takes again an optimal plan.

    V $ sql_shared_cursor, I have found no difference between the two cursor:

    Right when the plan has been slow:

    child cursor 0 during the performance was slow:

    < ChildNode > < ChildNumber > 0 < / ChildNumber > < ID > 34 < /ID > < reason > Rolling Invalidate window Exceeded (3) < / reason > < size > 2 x 4 < / size > < invalidation_window > 1452265834 < / invalidation_window > < ksugctm > 1452265953 < / ksugctm > < / ChildNode > < ChildNode > < ChildNumber > 0 < / ChildNumber > < ID > 34 < /ID > < reason > Rolling Invalidate window Exceeded) (3) < / reason > < size > 2 x 4 < / size > < invalidation_window > 1451915636 < / invalidation_window > < ksugctm > 1451915677 < / ksugctm > < / ChildNode > < ChildNode > < ChildNumber > 0 < / ChildNumber > < ID > 34 < /ID > < reason > Rolling Invalidate window Exceeded (2) < / reason > < size > 0 x 0 < / size > < details > already_processed < / details > < / ChildNode >

    v$ sql_shared_cursor. Reason when the plan was good:

    < ChildNode > < ChildNumber > 1 < / ChildNumber > < ID > 34 < /ID > < reason > Rolling Invalidate window Exceeded (3) < / reason > < size > 2 x 4 < / size > < invalidation_window > 1452529290 < / invalidation_window > < ksugctm > 1452529356 < / ksugctm > < / ChildNode > < ChildNode > < ChildNumber > 1 < / ChildNumber > < ID > 34 < /ID > < reason > Rolling Invalidate window Exceeded) (3) < / reason > < size > 2 x 4 < / size > < invalidation_window > 1451923704 < / invalidation_window > < ksugctm > 1451923763 < / ksugctm > < / ChildNode >

    Y at - it other reviews or newspapers that I can check to find out why an expensive plan chose?

    Is there an easy way that I can reproduce the expensive plan in lower environment.

    Thank you.

    This isn't a detail, I looked closely (yet), but it seems to me that if the information contained in the reason said you that the cursor was invalidated and re-optimized because someone (or automatic labor) had collected stats with the option "disable-online auto" and the window for rolling invalidation had finally expired. This suggests that (a) you is perhaps no chance with the particular game of the variable bind used immediately after the cursor has been invalidated or (b) your collection of statistics came to use a (particularly relevant for histograms) unlucky sample and your plans could change semi randomly each time you collect statistics.

    If it's (b) then rinse the shared pool and forcing re-optimizing would probably give you the wrong plan again.

    If it is (a) then rinse the shared pool (after throwing a bind variable) will allow you to link different test values and see if you get different plans.

    Step 1: get some peeked binds to both good and bad

    Solution temporary possible (if it's unlucky stats) - you could draw the previous set of stats history back to whatever the table in the query have their stats together very recently.  (Invalidation_window entry is PROBABLY the time-out period of cancellation in seconds since January 1, 1970 GMT; this, I think, will be 5 hours after the time of collecting stats (local) or possibly time to collecting statistics - I guess that 5 hours, but maybe it's that the invalidation of rolling decided to strike these sliders only one or two minutes after collection - but I don't know exactly what these numbers and why there are) differences of days between the two sliders).

    Concerning

    Jonathan Lewis

  • Help in the optimization of a query update

    Hi gurus,

    I'm trying to optimize the query update on a large TT_TERM_HIST table below (table size is 13 GB).

    The update statement is supposed to update the lines ~ 7 M. Total number of lines are ~ 9 M.

    The TT_TERM table is also large (table size is 9.5 GB) and PK on column DEAL_NUM.

    UPDATE  tt_term_hist hist
       SET LOCAL_BANKING_SYSTEM19 =
              (SELECT LOCAL_BANKING_SYSTEM19
                 FROM tt_term tt
                WHERE tt.deal_num = hist.deal_num)
    WHERE hist.deal_num IN
              (SELECT deal_num
                 FROM tt_term
                WHERE SUBSTR (LOCAL_BANKING_SYSTEM19, 1, 5) IN
                         ('FT7FC', 'FT7MC', 'FT7TM')) ;
    

    Performance plan is as follows:

    
    -----------------------------------------------------------------------------------------------
    | Id  | Operation                    | Name           | Rows  | Bytes | Cost (%CPU)| Time     |
    -----------------------------------------------------------------------------------------------
    |   0 | UPDATE STATEMENT             |                |   266K|  6763K|  1756K (16)| 05:51:23 |
    |   1 |  UPDATE                      | TT_TERM_HIST   |       |       |            |          |
    |   2 |   NESTED LOOPS               |                |   266K|  6763K|   691K  (1)| 02:18:16 |
    |*  3 |    TABLE ACCESS FULL         | TT_TERM        | 44729 |   742K|   333K  (1)| 01:06:41 |
    |*  4 |    INDEX RANGE SCAN          | IRTERM_HIST_PK |     6 |    54 |     2   (0)| 00:00:01 |
    |   5 |   TABLE ACCESS BY INDEX ROWID| TT_TERM        |     1 |    17 |     3   (0)| 00:00:01 |
    |*  6 |    INDEX UNIQUE SCAN         | IRTERM_PK      |     1 |       |     2   (0)| 00:00:01 |
    -----------------------------------------------------------------------------------------------
    
    
    Predicate Information (identified by operation id):
    ---------------------------------------------------
    
    
       3 - filter(SUBSTR("LOCAL_BANKING_SYSTEM19",1,5)='FT7FC' OR
                  SUBSTR("LOCAL_BANKING_SYSTEM19",1,5)='FT7MC' OR
                  SUBSTR("LOCAL_BANKING_SYSTEM19",1,5)='FT7TM')
       4 - access("HIST"."DEAL_NUM"="DEAL_NUM")
       6 - access("TT"."DEAL_NUM"=:B1)
    

    Then, I created a function-based index table TT_TERM using the function 'SUBSTR (LOCAL_BANKING_SYSTEM19, 1, 5)' and the plan amended as follows:

    -------------------------------------------------------------------------------------------------
    | Id  | Operation                      | Name           | Rows  | Bytes | Cost (%CPU)| Time     |
    -------------------------------------------------------------------------------------------------
    |   0 | UPDATE STATEMENT               |                | 89688 |  2364K|   480K (19)| 01:36:06 |
    |   1 |  UPDATE                        | TT_TERM_HIST   |       |       |            |          |
    |   2 |   NESTED LOOPS                 |                | 89688 |  2364K|   121K  (1)| 00:24:21 |
    |   3 |    INLIST ITERATOR             |                |       |       |            |          |
    |   4 |     TABLE ACCESS BY INDEX ROWID| TT_TERM        | 15060 |   264K|  1225   (0)| 00:00:15 |
    |*  5 |      INDEX RANGE SCAN          | CS_TERM_LBS19  |  6024 |       |    17   (0)| 00:00:01 |
    |*  6 |    INDEX RANGE SCAN            | IRTERM_HIST_PK |     6 |    54 |     2   (0)| 00:00:01 |
    |   7 |   TABLE ACCESS BY INDEX ROWID  | TT_TERM        |     1 |    17 |     3   (0)| 00:00:01 |
    |*  8 |    INDEX UNIQUE SCAN           | IRTERM_PK      |     1 |       |     2   (0)| 00:00:01 |
    -------------------------------------------------------------------------------------------------
    
    
    Predicate Information (identified by operation id):
    ---------------------------------------------------
    
    
       5 - access(SUBSTR("LOCAL_BANKING_SYSTEM19",1,5)='FT7FC' OR
                  SUBSTR("LOCAL_BANKING_SYSTEM19",1,5)='FT7MC' OR
                  SUBSTR("LOCAL_BANKING_SYSTEM19",1,5)='FT7TM')
       6 - access("HIST"."DEAL_NUM"="DEAL_NUM")
       8 - access("TT"."DEAL_NUM"=:B1)
    

    Try to use the index PARALLEL is shooting to the high cost in Millions.

    UPDATE /*+ PARALLEL */ tt_term_hist hist
       SET LOCAL_BANKING_SYSTEM19 =
              (SELECT LOCAL_BANKING_SYSTEM19
                 FROM tt_term tt
                WHERE tt.deal_num = hist.deal_num)
    WHERE hist.deal_num IN
              (SELECT deal_num
                 FROM tt_term
                WHERE SUBSTR (LOCAL_BANKING_SYSTEM19, 1, 5) IN
                         ('FT7FC', 'FT7MC', 'FT7TM')) ;
    

    ----------------------------------------------------------------------------------------------------------------------------------
    | Id  | Operation                           | Name          | Rows  | Bytes | Cost (%CPU)| Time     |    TQ  |IN-OUT| PQ Distrib |
    ----------------------------------------------------------------------------------------------------------------------------------
    |   0 | UPDATE STATEMENT                    |               |  6096K|   156M|    24M (25)| 81:18:18 |        |      |            |
    |   1 |  UPDATE                             | TT_TERM_HIST  |       |       |            |          |        |      |            |
    |   2 |   PX COORDINATOR                    |               |       |       |            |          |        |      |            |
    |   3 |    PX SEND QC (RANDOM)              | :TQ10002      |  6096K|   156M|  4482   (1)| 00:00:54 |  Q1,02 | P->S | QC (RAND)  |
    |*  4 |     HASH JOIN BUFFERED              |               |  6096K|   156M|  4482   (1)| 00:00:54 |  Q1,02 | PCWP |            |
    |   5 |      BUFFER SORT                    |               |       |       |            |          |  Q1,02 | PCWC |            |
    |   6 |       PX RECEIVE                    |               |  1023K|    17M|  1225   (0)| 00:00:15 |  Q1,02 | PCWP |            |
    |   7 |        PX SEND HASH                 | :TQ10000      |  1023K|    17M|  1225   (0)| 00:00:15 |        | S->P | HASH       |
    |   8 |         INLIST ITERATOR             |               |       |       |            |          |        |      |            |
    |   9 |          TABLE ACCESS BY INDEX ROWID| TT_TERM       |  1023K|    17M|  1225   (0)| 00:00:15 |        |      |            |
    |* 10 |           INDEX RANGE SCAN          | CS_TERM_LBS19 |  6024 |       |    17   (0)| 00:00:01 |        |      |            |
    |  11 |      PX RECEIVE                     |               |  9007K|    77M|  3257   (1)| 00:00:40 |  Q1,02 | PCWP |            |
    |  12 |       PX SEND HASH                  | :TQ10001      |  9007K|    77M|  3257   (1)| 00:00:40 |  Q1,01 | P->P | HASH       |
    |  13 |        PX BLOCK ITERATOR            |               |  9007K|    77M|  3257   (1)| 00:00:40 |  Q1,01 | PCWC |            |
    |  14 |         TABLE ACCESS FULL           | TT_TERM_HIST  |  9007K|    77M|  3257   (1)| 00:00:40 |  Q1,01 | PCWP |            |
    |  15 |   TABLE ACCESS BY INDEX ROWID       | TT_TERM       |     1 |    17 |     3   (0)| 00:00:01 |        |      |            |
    |* 16 |    INDEX UNIQUE SCAN                | IRTERM_PK     |     1 |       |     2   (0)| 00:00:01 |        |      |            |
    ----------------------------------------------------------------------------------------------------------------------------------
    
    
    Predicate Information (identified by operation id):
    ---------------------------------------------------
    
    
       4 - access("HIST"."DEAL_NUM"="DEAL_NUM")
      10 - access(SUBSTR("LOCAL_BANKING_SYSTEM19",1,5)='FT7FC' OR SUBSTR("LOCAL_BANKING_SYSTEM19",1,5)='FT7MC' OR
                  SUBSTR("LOCAL_BANKING_SYSTEM19",1,5)='FT7TM')
      16 - access("TT"."DEAL_NUM"=:B1)
    

    The Pb, I train of CARS with 2 nodes. DB version details are as follows:

    SQL> select banner from v$version;
    Oracle Database 11g Enterprise Edition Release 11.2.0.4.0 - 64bit Production
    PL/SQL Release 11.2.0.4.0 - Production
    CORE    11.2.0.4.0      Production
    TNS for Linux: Version 11.2.0.4.0 - Production
    NLSRTL Version 11.2.0.4.0 - Production
    

    Please let know us your opinion on how to optimize the query. Please let me know in case you need other inputs.

    Hello

    "The update statement is supposed to update the lines ~ 7 M." "Total number of lines are ~ 9 M."
    Could specify total number by each table? It makes sense to use "hash join" to join table?
    Try to replace 'in' also exists.

    You can try to update the join, it might help to exclude a single step to join as:

    UPDATE ( SELECT HIST.LOCAL_BANKING_SYSTEM19 OLD_VAL , TT.LOCAL_BANKING_SYSTEM19 NEW_VAL
               FROM TT_TERM_HIST HIST, TT_TERM TT
              WHERE TT.DEAL_NUM = HIST.DEAL_NUM
                AND SUBSTR (LOCAL_BANKING_SYSTEM19, 1, 5) IN ('FT7FC', 'FT7MC', 'FT7TM')
           )
    SET OLD_VAL = NEW_VAL
    ;
    

    ! WARNING! It is just not tested sample.

    WBR,

  • 12 c parallel execution Plans

    Hello world

    I have a little a problem of performance on 12 c that gives me a little trouble at the head. I moved from 11 to 12 databases and no amendment of the application have been made. Our requests are generated somewhat dynamically, so that they are the same thing every time.

    Let's start with the execution plan I get:

    SQL > select * from table (dbms_xplan.display ());


    PLAN_TABLE_OUTPUT

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

    Hash value of plan: 3567104424

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

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

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

    |   0 | SELECT STATEMENT |                       |    55.  7095 |  3764 (1) | 00:00:01 |        |      |            |

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

    |   2.   PX SEND QC (ORDER). : TQ10006 |    55.  7095 |  3764 (1) | 00:00:01 |  Q1, 06 | P > S | QC (ORDER).

    |   3.    SORT ORDER BY |                       |    55.  7095 |  3764 (1) | 00:00:01 |  Q1, 06 | SVCP |            |

    |   4.     PX RECEIVE                                       |                       |    55.  7095 |  3763 (1) | 00:00:01 |  Q1, 06 | SVCP |            |

    |   5.      RANGE OF SEND PX | : TQ10005 |    55.  7095 |  3763 (1) | 00:00:01 |  Q1, 05 | P > P | RANGE |

    |   6.       UNIQUE FATE |                       |    55.  7095 |  3763 (1) | 00:00:01 |  Q1, 05 | SVCP |            |

    |*  7 |        HASH JOIN                                     |                       |    55.  7095 |  3762 (1) | 00:00:01 |  Q1, 05 | SVCP |            |

    |   8.         PX RECEIVE                                   |                       |   801 | 50463 |  3696 (1) | 00:00:01 |  Q1, 05 | SVCP |            |

    |   9.          PX SEND HASH | : TQ10003 |   801 | 50463 |  3696 (1) | 00:00:01 |  Q1, 03 | P > P | HASH |

    | * 10 |           HASH JOIN                                  |                       |   801 | 50463 |  3696 (1) | 00:00:01 |  Q1, 03 | SVCP |            |

    |  11.            RECEIVE PX |                       |   801 | 40851 |  2333 (1) | 00:00:01 |  Q1, 03 | SVCP |            |

    |  12.             PX SEND BROADCAST | : TQ10002 |   801 | 40851 |  2333 (1) | 00:00:01 |  Q1, 02 | P > P | BROADCAST |

    |  13.              NESTED LOOPS |                       |   801 | 40851 |  2333 (1) | 00:00:01 |  Q1, 02 | SVCP |            |

    |  14.               KIND OF BUFFER.                       |       |       |            |          |  Q1, 02 | ISSUE |            |

    |  15.                RECEIVE PX |                       |       |       |            |          |  Q1, 02 | SVCP |            |

    |  16.                 PX SEND HASH | : TQ10000 |       |       |            |          |        | S > P | HASH |

    |  17.                  NESTED LOOPS |                       |   823. 31274 |  1509 (1) | 00:00:01 |        |      |            |

    | * 18.                   TABLE ACCESS BY ROWID INDEX BATCH | PAGED_LOOKUP_PKS |   500 |  9500 |     3 (0) | 00:00:01 |        |      |            |

    | * 19.                    INDEX RANGE SCAN | PAGED_LOOKUP_PKS_IDX2 |     1.       |     2 (0) | 00:00:01 |        |      |            |

    |  20.                   TABLE ACCESS BY ROWID INDEX BATCH | BILL_ITEM |     2.    38.     4 (0) | 00:00:01 |        |      |            |

    | * 21.                    INDEX RANGE SCAN | BILL_ITEM_FK2 |     4.       |     2 (0) | 00:00:01 |        |      |            |

    | * 22.               INDEX UNIQUE SCAN | PK_INSERTION |     1.    13.     1 (0) | 00:00:01 |  Q1, 02 | SVCP |            |

    |  23.            ITERATOR BLOCK PX |                       |  1548K |    17 M |  1353 (2) | 00:00:01 |  Q1, 03 | ISSUE |            |

    |  24.             FULL RESTRICTED INDEX SCAN FAST | BOOKING_ACCOUNT_1 |  1548K |    17 M |  1353 (2) | 00:00:01 |  Q1, 03 | SVCP |            |

    |  25.         PX RECEIVE                                   |                       | 22037 |  1420K |    65 (2) | 00:00:01 |  Q1, 05 | SVCP |            |

    |  26.          PX SEND HASH | : TQ10004 | 22037 |  1420K |    65 (2) | 00:00:01 |  Q1, 04 | S > P | HASH |

    |  27.           SELECTOR PX |                       |       |       |            |          |  Q1, 04 | SCWC |            |

    |  28.            TABLE ACCESS FULL | CONTACT | 22037 |  1420K |    65 (2) | 00:00:01 |  Q1, 04 | SCWP |            |

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

    Information of predicates (identified by the operation identity card):

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

    7 - access ("ACCOUNT_ID" ="ACCOUNT_ID")

    10 - access ("BOOKING" ="BOOKING")

    18 - filter("T1".") SEQUENCE_NO' < 501 AND "T1". ("' SEQUENCE_NO" > = 1).

    19 - access("T1".") SESSION_ID '= 123456 AND 'T1'.' SEARCH_ID "= 25)

    21 - access("T1".") N1 "=" BILL_ID")

    22 - access ("BOOKING" = "BOOKING" AND "INSERTION_SET" = "INSERTION_SET" AND "INSERT"="INSERT")

    Note

    -----

    -the dynamic statistics used: dynamic sampling (level = 2)

    -This is an adaptation plan

    -2 directives Plan Sql used for this statement

    51 selected lines.

    Elapsed time: 00:00:00.15

    SQL > spool off

    OK, now let's go through the problem:

    1. It's a development running on a virtual server, and which hosts a few other databases, so the parallel execution is not a good thing. parallel_degree_policy is set to MANUAL, parallel_max_servers and all other parallel_ limits are set to 1 and tables have been changed with the settings of NOPARALLEL. So why is the execution plan always generated with all stages of parallel execution? I don't seem to get rid of in 12 c
    2. Next mystery is that the said plan of the explain command is an adaptation plan, and yet I put the true optimizer_adaptive_reproting_only
    3. Now to the problem of effective enforcement, so I'm playing around with all these settings. The query runs for 3-4 seconds, returning around about 500 cases. However, in some cases this same query with the same input variable races for hours and if I can believe the AWR and ASH reports, read a good 180 GB of data. The main wait event is direct path read temp temp and writing.


    This is not isolated to that one query. I have a few queries now that all display the same behavior, one of them running overnight. I don't seem to get to a standard nested loop execution plans.


    The entire base is a database plug-in and I don't know I just missed something in the new features Guide.

    Would appreciate some ideas.

    Thank you

    If you want to disable parallel execution, you must set parallel_max_servers to zero.  Maybe the optimizer thinks he can use a parallel plan because parallel_max_servers is non-zero (even though the number of slaves available means that it will be serialized to a parallel plan).

    Note that you have a ticket saying dynamic stats have been used.  Maybe you have a 11 for optimizer_dynamic_sampling setting, and allowing Oracle to be very inventive with collection of samples and parallelism.

    You have also 2 SQL instructions in game. These are the things that get associated with objects rather than the instructions, then perhaps someone has been playing with parallelism and managed to associate the parallelism with one of the tables in your query (I am not sure 100% that it is possible, just throw a suggestion).  Take a look at the SQL used for education guidelines.

    To give us a little more information, you can:

    Shoot memory execution plan dbms_xplan.display_cursor ({sql_id}, {number of children}, 'ALL'));

    We show all the parallel settings (see setting the parallel)

    Pull on the parameters of the optimizer for query memory (select name, value of V$ sql_optimizer_env where sql_id = {your sql identifier} and child_number = {your child number})

    Concerning

    Jonathan Lewis

  • Wait the response Message to start the Compensation Plan

    Hi all

    I implement a plan of the orchestration of a product, all the functions involved running a process and think that the process has an automated task and this task has a first automator to send a message to a jms queue in WebLogic using the sender of Xquery, and the same automated task has a second automator to receive a response to the request message using a receiver Xquey Automator type of external events.

    When the order arrives at the automated task, send a message and waits for the response with the same correlation request ID and process this response to continue to the next activity.

    If the process comes to the automated task and send a request message and while waiting for the response arrives an amendment to this order, this amendment is not started until the automated task response message arrives.

    Could I start the amendment without waiting the answer comes of the automated task that is currently running process?


    Thanks again.

    AndresG.

    This behavior is controlled by the order lifecycle policy. Life cycle policy order control States authorized order, their transactions to move between States of command, all conditions or roles for these transactions and grace periods for certain order state transitions. For the behavior you want, you must change the default delay setting (the default is to wait indefinitely as the tasks to be performed).

    Specifically, you want to look in control policy, under the State of advancement in State is the change of the process transaction and the tab of the period of grace on the right. This is the operation that controls the State of ongoing change to change an accepted amendment. You can change the duration of waiting indefinitely for a period of time, of a certain value not zero to give him some time to receive the response and complete its work, which is also a known state for the task, or you could it to zero, which will process the amendment immediately and not wait for a response to all your external receiver process and complete the order.

    To decide how to use the grace period settings, it is important to understand that the MSO considers only the tasks completed in its compensation plan for the amendments and all the tasks that are in a State accepted (as yours would be after the message was sent to the external system) at the expiration of the grace period are not considered as completed and therefore are not considered in the compensation plan. This means that these tasks will be performed again (mode of) once the order comes from the state change and return to a State in course, as long as the order remains on the same path in the process after compensation. You'll want to think that in the establishment of your grace period.

    Marc

  • Hyperion Planning metadata via ODI update

    I need to load a structure of the entity from a planning to another application. In the past, I used a juicer contour essbase to extract, and then load via HAL, DIM, or in this case, ODI (I can get this comfortable work).

    My dilemma is that I want to do everything in ODI and rather than overthrow an essbase outline and load planning, I would take a look at the planning which has already been reversed (use it as a source) and then charge to another (new) planning application entities hierarchy. So I'm planning entity Dim of App1 (reversed previously using RKM Planning to SQL I believe)-uses SQL to SQL LKM and then Driver Memory charge as the staging area with the target entity planning Dim for App2 as target using IKM SQL to planning. All the members card accordingly as expected.

    However when I run it, I get a driver not found error. Is it because the low reverse App1 entity cannot serve as a source? or?

    Any help would be appreciated... and my apologies if this has already been answered somewhere: I tried searching because he came but empty. I've seen something on the amendment of the execution of the staging to source but don't could not find the place to go and was not sure that he applied.

    BTW... I also tried to reverse entity dim App1 in text file (and was going to go this text to the target entity for the App2 Dim). Again not luck.

    Thanks in advance for any help.

    Published by: Sardonix on February 19, 2010 13:13

    Hello

    You can extract the metadata planning using an adapter, using adapters, you'll need to extract of essbase to planning.

    See you soon

    John
    http://John-Goodwin.blogspot.com/

  • Upgrade existing iCloud Plan credit?

    When I upgrade my iCloud to a monthly storage, give credit to my current annual payment plan?

    Not sure if she has repaid you but after this article- annual storage iCloud - Apple support plans, it is said it will in proportion.  If you have any questions, you can request assistance from Apple (link in the link I provided).

    Remember, once you give up the annual plan, you can't get it back because they don't offer those more so think carefully before you make your decision.

  • Are there plans to provide upgrades to Pages with more features like MS Word, for example the models?

    Of course the Pages not the functionality of the MS Word has.  Are there plans to provide similar functionality, such as the creation of forms/templates?

    I don't know what you mean. But Pages can create templates very well...

    Pages for Mac: create custom templates

  • plan storage iCloud does not

    I pay for the storage of 50 GB on iCloud plan and my iCloud app shows this amount.

    My iCloud show 39.4 GB of storage is always available, but if I try and download multiple files for a total of more than 3.4 GB I get the message that there is not enough space and to update the plan.

    Anyone have any idea how to solve this problem?

    Thank you

    What size are these several files you are trying to download?

  • Purchase of iCloud - affect the data plan I'm on?

    I was wondering if anyone knew if I upgraded my iCloud storage plan, it would not affect the data plan, I'm on with my carrier? It would affect monthly bills or is it separate? And also, is it possible to pay with a credit from iTunes?

    Use of Wi - Fi instead of your data plan to reduce your costs.

    For iCloud extra storage, you can pay with an iTunes gift card.

  • Is there a reason for not going to the Iphone 7 if on the upgrade plan?

    We arrived the 6s Iphone last year and we pay for the upgrade plan. To be honest, I'm not impressed with the Iphone 7 and still like the 6s. But because I pay more than a month for the upgrade package, it would be stupid not not to upgrade? I suppose that in theory if I have not improved, I would pay the phone is turned off at the time where the 7 fate.

    Sorry if this is a stupid question, how they paid you for the phones now is a little obtuse.

    I see no reason not not to go other than to repay your existing phone and get out from under the need for payments monthly.

    The CPU of the 7 is significantly faster than in the 6s, and water resistance is a big bonus. The best camera is nice, but I'm not good in taking pictures of everything under the Sun...

  • iCloud Legacy Plan

    I'm be renewed and I'm confused. renewal for legacy 25 GB $11.99 annual payment. New monthly 50 GB $0.99 per month. What's the catch? The monthly is an annual rate fixed. Suggestions on what plan I should renew with?

    No plug.

    Apple has simply gone from annual plan to a monthly plan that happens to work on a lot cheaper per month than before.

    You can keep your plan if you wish.

  • When you upgrade a storage iCloud plan you get to keep the free additional 5 GB?

    I am considering the iCloud the total amount of my photos and videos storage options exceeded the franchise of 5 GB.

    My question is - if I update the 50 GB plan, to keep the original free 5GB as well? I actually would have 55 GB of available storage total iCloud?

    I must say that I am very frustrated because as an avid user of Apple, I have 2 x 2 x iPads, iPhones and a MacBook Pro and still only got 5 GB of free storage iCloud to share between all devices. I don't think I should have to pay for additional storage, given the high investment I have with Apple products - it of crazy for me to buy a 128 GB iPhone and have only 5 GB free storage - but I don't see otherwise around having to upgrade and subscribe to a larger storage iCloud plan. Any ideas please.

    Does anyone think that Apple will increase their free storage plans and subscription at some point?

    If you upgrade to 50GB of storage from iCloud, you'll have 50GB.

    Since it is a forum for technical support for a user, we don't are not able to say why Apple made the decisions they did. However, you can send them your thoughts here: Apple - Feedback

    See you soon,.

    GB

  • Family plan for decommissioning

    I would like to know how to move from a family share plan student (apple's music). I recently saw the offer, but I can't find it on my iPhone 6 s more.

    Thanks in advance,

    Bradley

    Hello, eusoubrandley!

    Thank you for joining the communities Support from Apple! It's a big question about the mobving of a family membership to a student one. Read this article on how to get a music Apple student membership. The article will tell you how to manage your music Apple account and go to the student membership. Please make sure you read this section of the article:

    If you are part of a family membership

    If you are already part of a membership of family music Apple, you probably need not a student membership.

    If you're in a sharing of the family group, and you change a student membership, your family Organizer will be charged for your membership to the members of the family of Apple music and student.

    If you are the organizer of a sharing of the family group and you change a student membership, the rest of your group will lose access to music from Apple. The next time they sign music Apple, each Member of the family will see choice to join as an individual Member. If you stay the family Organizer, you will continue to be billed for purchases of iTunes in your group sharing of the family, including memberships and subscriptions.

    See you soon!

  • Protection plan usa in europe

    Hello

    I want to buy a used Apple Watch that was purchased in the USA 2015. He also bought the protection plan here. Is it possible to use the protection plan of the United States in Austria (Europe)?

    Thank you

    Best regards

    Markus

    Hi Markus

    No - the AppleCare service plan benefits + will be available in the United States.

Maybe you are looking for

  • How to stop error notification of closing WAB

    I am running XP with Kaspersky and have this constant notification error when the computer is shut down.  This is the Windows address book and I use Microsoft Outlook 2000, which is closed without problem before I try to shut down the computer.  Any

  • Internet does not connect after you have reinstalled the operating system

    I recently reinstalled VISTA OS on my system, and now my network connections do not work - wired and wireless.  Any ideas on how to trouble shoot this?  I went to Device Manager and it says I have two devices in the network adapters - bluetooth (pers

  • Some fonts are displayed wrong on Windows

    A handful of fonts do not seem to be properly read or restore some sort of default. http://i48.Tinypic.com/29ekky8.jpg Programs that are affected by this problem that I know are iTunes, install the pages, but also the popups of the Avast database upd

  • LR 6.0 - upgrade

    I use LR 6.0 - not the CC version, I bought it. When I try to upgrade (needed for my Sony A7R2 s) I can only spend the CC version, wich dosn´t open, I think, because I don't have a license. What can I do?

  • Strange problem with this SQL

    Hello I'm trying to concatenate the value of SQL_TEXT in multiple lines in a single string using this SQL statement. The problem is that it works fine if I use the PIECE, but if I use SQL_TEXT I get this error ORA-30004: when you use the SYS_CONNECT_