Using plans based on transaction grouping

Transaction grouping can produce a number of midsize independent plans, where a plan switch can occur if required.

It is often possible to define such groups of programs, where the programs inside a group are closely related. That means that they are often executed in the same transaction, or in different transactions being executed consecutively. One separate plan should then be used for each group.

In the example in Figure 1 two plans could be built:
  • PLAN1 for (TRX0) using the DBRMs from programs P0, P1, P2, and P3.
  • PLANA for (TRXA) using the DBRMs from programs PA, PB, PC, and PD.

However, program P3 can transfer control to program PB. A plan switching technique could then be used. It is recommended that plan switching is an exception and not the normal case, mainly due to additional processor overhead.

In this case, the result of the transaction grouping technique matches the result for the technique of using many small plans. This is because of the simplicity of the example used. Normally the transaction grouping technique produces a larger plan.



dfhtk74.html | Timestamp icon Last updated: Monday, 5 June 2017