Creating nested loops

Hi!
I would like to list all Combinations of a list A and a list B (each containing 5 integers) in a third list C in order to get 25 combinations. I am intending to use nested loops so that on the first loop the second loop starts and then the result lets say list A + list B are listed in the list C. Is there any other way of doing this with Labview or I am on the right track?
Best Regards,
Hamid

You can use the polymorphic array math to accomplish this. Inside of a single for loop, index Array A and add that to the entire Array B in one shot. At this point, there are numerous ways to take the output. Probably the simpliest is to reshape the output 2D array into a 1D array. For better memory allocation, you can preinitialize a 1D array and replace elements in the for loop but in the end it accomplishes the same task. See attached example (LV7.1.1). Of course everything is dependant on what you are going to do with this, what operations, when and where the numbers come from.
Paul
Paul <--Always Learning!!!
sense and simplicity.
Browse my sample VIs?
Attachments:
arrayMath.vi ‏33 KB

Similar Messages

Building Tree hierarchy Using nested loops and class cl_gui_column_tree

Hello gurus,
I want to create a tree report using custom container and class cl_gui_column_tree. I have read and understood the standard demo report which SAP has provided i.e. SAPCOLUMN_TREE_CONTROL_DEMO. But in this report all the levels nodes are created as constants and hardcoded. I want to create hierarchy using nested loops. For this i took one example of a hierarchy of VBAK-VBELN->VBAP-POSNR Like One sales order has many line items and each line item can have number of line items in billing plan.
I have done some coding for it.
FORM build_tree USING node_table TYPE treev_ntab
                                       item_table TYPE zitem_table.              " i created the zitem_table table type of mtreeitm in SE11.
DATA: node TYPE treev_node,
             item TYPE mtreeitm.
node-node_key = root.
CLEAR node-relatkey.
CLEAR node-relatship.
node-hidden = ' '.
node-disabled = ' '.
CLEAR node-n_image.
CLEAR node-exp_image.
node-isfolder = 'X'.
node-expander = 'X'.
APPEND node TO node_table.
item-node_key = root.
item-item_name = colm1.
item-class = cl_gui_column_tree=>item_class_text.
item-text = 'Root'.
APPEND item TO item_table.
item-node_key = root.
item-item_name = colm2.
item-class = cl_gui_column_tree=>item_class_text.
item-text = 'Amount'.
APPEND item TO item_table.
LOOP AT it_vbeln INTO wa_vbeln.
    node-node_key = wa_vbeln-vbeln.
    node-relatkey = root.
    node-relatship = cl_gui_column_tree=>relat_last_child.
    node-hidden = ' '.
    node-disabled = ' '.
    CLEAR node-n_image.
    CLEAR node-exp_image.
    node-isfolder = 'X'.
    node-expander = 'X'.
    APPEND node TO node_table.
    item-node_key = wa_vbeln-vbeln.
    item-item_name = colm1.
    item-class = cl_gui_column_tree=>item_class_text.
    item-text = wa_vbeln-vbeln.
    APPEND item TO item_table.
    item-node_key = wa_vbeln-vbeln.
    item-item_name = colm2.
    item-class = cl_gui_column_tree=>item_class_text.
    item-text = wa_vbeln-netwr.
    APPEND item TO item_table.
    LOOP AT it_posnr INTO wa_posnr.
    node-node_key = wa_posnr-posnr.
    node-relatkey = wa_vbeln-vbeln.
    node-relatship = cl_gui_column_tree=>relat_last_child.
    node-hidden = ' '.
    node-disabled = ' '.
    CLEAR node-n_image.
    CLEAR node-exp_image.
    node-isfolder = ' '.
    node-expander = ' '.
    APPEND node TO node_table.
    item-node_key = wa_posnr-posnr.
    item-item_name = colm1.
    item-class = cl_gui_column_tree=>item_class_text.
    item-text = wa_posnr-posnr.
    APPEND item TO item_table.
    item-node_key = wa_posnr-posnr.
    item-item_name = colm2.
    item-class = cl_gui_column_tree=>item_class_text.
    item-text = wa_posnr-netpr.
    APPEND item TO item_table.
    ENDLOOP.
ENDLOOP.
ENDFORM.
Now this program compiles fine and runs till there is only one level. That is root->vbeln. But when i add one more loop of it_posnr it gives me runtime error of message type 'X'. The problem i found was uniqueness of item-item_name as all the sales order have posnr = 0010. What could be done? I tried giving item_name unique hierarchy level using counters just like stufe field in prps eg. 10.10.10, 10.10.20,10.20.10,10.20.20,20.10.10 etc.. etc.. but still i am getting runtime error when i add one more hierarchy using nested loop. Plz guide.
Edited by: Yayati6260 on Jul 14, 2011 7:25 AM

Hello all,
Thanks the issue is solved. The node key was not getting a unique identification as nodekey. I resolved the issue by generating unique identification for each level. Thanks all,
Regards
Yayati Ekbote

Too many nested loops in execution plan?

Hi,
i wonder about execution plan not indicating that access to some tables (for join) is in parallel.
Please see this example:
------------------------ snip ------------------------------------
drop table test_a1;
drop table test_a2;
drop table test_b;
drop table test_c;
drop table test_d;
create table test_a1 (
x number,
y number,
z number);
create unique index testa1_pk on test_a1 (x);
create table test_a2 (
x number,
y number,
z number);
create unique index testa2_pk on test_a2 (x);
create table test_b (
x number,
y number,
z number);
create unique index testb_pk on test_b (y);
create table test_c (
x number,
y number,
z number);
create unique index testc_pk on test_b (z);
create table test_d (
x number,
y number,
z number);
create unique index testd_pk on test_d (y);
select
a1.x a1_x,
a1.y a1_y,
a1.z a1_z,
a2.x a2_x,
a2.y a2_y,
a2.z a2_z,
b.x b_x,
b.y b_y,
b.z b_z,
c.x c_x,
c.y c_y,
c.z c_z,
d.x d_x,
d.y d_y,
d.z d_z
from test_a1 a1, test_a2 a2, test_b b, test_c c, test_d d
where a1.x = 100
and a2.x = 200
and b.y = a1.y
and c.z = b.z
and d.y = a1.y;
------------------------ snap ------------------------------------
The execution plan goes like this:
Select Stmt
     nested loops
          nested loops
               nested loops
                    nested loops
                         table access
                              index
                                   access predicate
                                        a2.x = 200
                         table access
                              index
                                   access predicate
                                        a1.x = 100
                    table access
                         index
                              access predicate
                                   d.y = a1.y
               table access
                    index
                         access predicate
                              b.y = a1.y
          table acess
               index
                    acess predicate
                         c.z = b.z
Access to tables a1 and a2 is on the same level (in parallel - i guess).
However, why isn't access to table d and b on the same level?
Both depend on a1. So no need to execute one after the other (no inter-dependency).
Maybe i have just wrong expectation to the output of the execution plan(?!)
- many thanks!
best regards,
Frank

Preservation of identation and spacing is invaluable when it comes to reading an explain plan.
| Id | Operation                       | Name      | Rows | Bytes | Cost (%CPU)| Time     |
|   0 | SELECT STATEMENT                |           |     1 |   195 |     2   (0)| 00:00:01 |
|   1 | NESTED LOOPS                   |           |     1 |   195 |     2   (0)| 00:00:01 |
|   2 |   NESTED LOOPS                  |           |     1 |   156 |     0   (0)| 00:00:01 |
|   3 |    NESTED LOOPS                 |           |     1 |   117 |     0   (0)| 00:00:01 |
|   4 |     NESTED LOOPS                |           |     1 |    78 |     0   (0)| 00:00:01 |
|   5 |      TABLE ACCESS BY INDEX ROWID| TEST_A2   |     1 |    39 |     0   (0)| 00:00:01 |
|* 6 |       INDEX UNIQUE SCAN         | TESTA2_PK |     1 |       |     0   (0)| 00:00:01 |
|   7 |      TABLE ACCESS BY INDEX ROWID| TEST_A1   |     1 |    39 |     0   (0)| 00:00:01 |
|* 8 |       INDEX UNIQUE SCAN         | TESTA1_PK |     1 |       |     0   (0)| 00:00:01 |
|   9 |     TABLE ACCESS BY INDEX ROWID | TEST_D    |    82 | 3198 |     0   (0)| 00:00:01 |
|* 10 |      INDEX UNIQUE SCAN          | TESTD_PK |     1 |       |     0   (0)| 00:00:01 |
| 11 |    TABLE ACCESS BY INDEX ROWID | TEST_B    |    82 | 3198 |     0   (0)| 00:00:01 |
|* 12 |     INDEX UNIQUE SCAN           | TESTB_PK |     1 |       |     0   (0)| 00:00:01 |
|* 13 |   TABLE ACCESS FULL             | TEST_C    |     1 |    39 |     2   (0)| 00:00:01 |
Predicate Information (identified by operation id):
   6 - access("A2"."X"=200)
   8 - access("A1"."X"=100)
10 - access("D"."Y"="A1"."Y")
12 - access("B"."Y"="A1"."Y")
13 - filter("C"."Z"="B"."Z")
Access to tables a1 and a2 is on the same level (in parallel - i guess).
Maybe i have just wrong expectation to the output of the execution plan(?!)You guess wrong, there's nothing parallel going on here.
Execution plan is a tree of parent-child operations.
For example, the NESTED LOOP at operation 4 has two children @ 5 and 7.
Both of these operations- 5 & 7 - have a single child operation.
The execution tree starts with operation 6, using the TESTA2_PK index to identify rows where A2.X=100.
From this list of rowids, we go to the table TEST_A2 operation 5.
The rows from operation five feed into the NESTED LOOP - operation 4.
For each of these rows, we go to TEST_A1 via the index TEST_A1_PK for rows where A1.X=100.
This is really a cartesian join because there's no join condition between the two tables.
etc, etc, etc
Three things in particular to point out.
Firstly, that nothing joins to A2. So there will be a cartesian product - i.e. for every row in the result set between the joined tables A1, B, C and D, these will be multiplied by the number of rows returned by the the A2 rowsource.
Secondly, when everything has got one or zero rows (or the optimizer thinks that it's one or zero rows), you can get very different plans from when there are known/thought to be more rows.
Both depend on a1. So no need to execute one after the other (no inter-dependency).Thirdly, in terms of isolated join operations (ignoring A2 and C for the moment), A1 cannot join to B and D at the same time, you can either join A1 to B and then join the result of that to D, or join A1 to D then B, which is what you've got in your plan (well, actually we have A2 joined to A1 then the result of that joined to D and then the result of that to B).
Edited by: Dom Brooks on Jul 6, 2011 4:07 PM
Corrected typo

Oracle 11g - Nested loops on outer joins

Hello,
I have a select query that was working with no problems. The results are used to insert data into a temp table.
Recently, it would not complete executing. The explain plan shows a cartesian. But, there could be problems with using nested loops on the outer join. Interestingly, when I copy production code and rename the temp table and rename the view, it works.
Can someone take a look at the code and help. Maybe offer a suggestion on tuning too? Thanks.
CREATE TABLE "CT"
( "TN" VARCHAR2(30) NOT NULL ENABLE,
"COL_NAME" VARCHAR2(30) NOT NULL ENABLE,
"CDE" VARCHAR2(5) NOT NULL ENABLE,
"CDE_DESC" VARCHAR2(80) NOT NULL ENABLE,
"CDE_STAT" CHAR(1));
insert into CT (TN, COL_NAME, CDE, CDE_DESC, CDE_STAT)
values ('INDSD', 'STCD', 'U', 'RF', 'A');
insert into CT (TN, COL_NAME, CDE, CDE_DESC, CDE_STAT)
values ('AT', 'TCD', '001', 'RL', 'A');
insert into CT (TN, COL_NAME, CDE, CDE_DESC, CDE_STAT)
values ('AT', 'TCD', '033', 'PFR', 'A');
CREATE TABLE "IPP"
( "IND_ID" NUMBER(9,0) NOT NULL ENABLE,
"PLCD" VARCHAR2(5) NOT NULL ENABLE,
"CBCD" VARCHAR2(5));
insert into IPP (IND_ID, PLCD, CBCD)
values (2007, 'AS', '04');
insert into IPP (IND_ID, PLCD, CBCD)
values (797098, 'AS', '34');
insert into IPP (IND_ID, PLCD, CBCD)
values (797191, 'AS','04');
CREATE TABLE "INDS"
( "OPCD" VARCHAR2(5) NOT NULL ENABLE,
"IND_ID" NUMBER(9,0) NOT NULL ENABLE,
"IND_CID" NUMBER(*,0),
"GFLG" VARCHAR2(1),
"HHID" NUMBER(9,0),
"DOB" DATE,
"DOB_FLAG" VARCHAR2(1),
"VCD" VARCHAR2(5),
"VTDTE" DATE,
"VPPCD" VARCHAR2(4),
"VRCDTE" DATE NOT NULL ENABLE,
"VDSID" NUMBER(9,0),
"VTRANSID" NUMBER(12,0),
"VOWNCD" VARCHAR2(5),
"RCDTE" DATE,
"LRDTE" DATE
insert into INDS (OPCD, IND_ID, IND_CID, GFLG, HHID, DOB, DOB_FLAG, VCD, VTDTE, VPPCD, VRCDTE, VDSID, VTRANSID, VOWNCD, RCDTE, LRDTE)
values ('USST', 2007, 114522319, '', 304087673, to_date('01-01-1980', 'dd-mm-yyyy'), 'F', '2', to_date('06-04-2011 09:21:37', 'dd-mm-yyyy hh24:mi:ss'), '', to_date('06-04-2011 09:21:37', 'dd-mm-yyyy hh24:mi:ss'), 1500016, null, 'USST', to_date('06-04-2011 09:21:37', 'dd-mm-yyyy hh24:mi:ss'), to_date('18-07-2012 21:52:53', 'dd-mm-yyyy hh24:mi:ss'));
insert into INDS (OPCD, IND_ID, IND_CID, GFLG, HHID, DOB, DOB_FLAG, VCD, VTDTE, VPPCD, VRCDTE, VDSID, VTRANSID, VOWNCD, RCDTE, LRDTE)
values ('USST', 304087678, 115242519, '', 304087678, to_date('01-01-1984', 'dd-mm-yyyy'), 'F', '2', to_date('06-04-2011 09:21:39', 'dd-mm-yyyy hh24:mi:ss'), '', to_date('06-04-2011 09:21:39', 'dd-mm-yyyy hh24:mi:ss'), 1500016, null, 'USST', to_date('06-04-2011 09:21:39', 'dd-mm-yyyy hh24:mi:ss'), to_date('18-07-2012 21:52:53', 'dd-mm-yyyy hh24:mi:ss'));
CREATE TABLE "INDS_TYPE"
( "IND_ID" NUMBER(9,0) NOT NULL ENABLE,
"STCD" VARCHAR2(5) NOT NULL ENABLE);
insert into INDS_type (IND_ID, STCD)
values (2007, 'U');
insert into INDS_type (IND_ID, STCD)
values (313250322, 'U');
insert into INDS_type (IND_ID, STCD)
values (480058122, 'U');
CREATE TABLE "PLOP"
( "OPCD" VARCHAR2(5) NOT NULL ENABLE,
"PLCD" VARCHAR2(5) NOT NULL ENABLE,
"PPLF" VARCHAR2(1));
insert into PLOP (OPCD, PLCD, PPLF)
values ('USST', 'SP', 'Y');
insert into PLOP (OPCD, PLCD, PPLF)
values ('PMUSA', 'ST', '');
insert into PLOP (OPCD, PLCD, PPLF)
values ('USST', 'RC', '');
CREATE TABLE "IND_T"
( "OPCD" VARCHAR2(5) NOT NULL ENABLE,
"CID" NUMBER(9,0) NOT NULL ENABLE,
"CBCD" VARCHAR2(5),
"PF" VARCHAR2(1) NOT NULL ENABLE,
"DOB" DATE,
"VCD" VARCHAR2(5),
"VOCD" VARCHAR2(5),
"IND_CID" NUMBER,
"RCDTE" DATE NOT NULL ENABLE
insert into IND_T (OPCD, CID, CBCD,PF, DOB, VCD, VOCD, IND_CID, RCDTE)
values ('JMC', 2007, '04', 'F',to_date('11-10-1933', 'dd-mm-yyyy'), '2', 'PMUSA', 363004880, to_date('30-09-2009 04:31:34', 'dd-mm-yyyy hh24:mi:ss'));
insert into IND_T (OPCD, CID, CBCD,PF, DOB, VCD, VOCD, IND_CID, RCDTE)
values ('JMC', 2008, '04', 'N',to_date('01-01-1980', 'dd-mm-yyyy'), '2', 'PMUSA', 712606335, to_date('05-04-2013 19:36:05', 'dd-mm-yyyy hh24:mi:ss'));
CREATE TABLE "IC"
( "CID" NUMBER(9,0) NOT NULL ENABLE,
"CF" CHAR(1));
insert into IC (CID, CF)
values (2007, 'N');
insert into IC (CID, CF)
values (100, 'N');
insert into IC (CID, CF)
values (200, 'N');
CREATE OR REPLACE FORCE VIEW "INDSS_V" ("OPCD", "IND_ID", "IND_CID", "GFLG", "HHID", "DOB", "DOB_FLAG", "VCD", "VTDTE", "VPPCD", "VRCDTE", "VDSID", "VTRANSID", "VOWNCD", "RCDTE", "LRDTE") AS
SELECT DISTINCT a.OPCD, a.IND_ID, a.IND_CID, a.GFLG, a.HHID,
a.DOB, a.DOB_flag, a.VCD, a.VTDTE,
a.VPPCD, a.VRCDTE, a.VDSID, a.VTRANSID,
a.VOWNCD, a.RCDTE, a.LRDTE
FROM INDS a, INDS_type b
WHERE a.IND_ID = b.IND_ID
AND b.STCD in (select CDE
from CT --database link
where TN = 'INDSD'
and COL_NAME = 'STCD'
and CDE_STAT = 'A') ;
--insert /*+ parallel(IND_T,2) */ into IND_T
select /*+ parallel(a,4) */
a.OPCD as OPCD
, a.IND_ID as CID
, b.CBCD as CBCD
, NULL as BFCD
, 'N' as PF
, a.DOB as DOB
, a.VCD as VCD
, a.VOWNCD as VOCD
, a.IND_CID as IND_CID
, a.RCDTE as RCDTE
from INDSS_V a
, (select /*+ parallel(IPP,4) */ * from IPP IPP , PLOP PLO
where plo.PLCD = ipp.PLCD
and PPLF='Y') b
, IC c
where a.IND_ID = b.IND_ID (+)
and a.OPCD = b.OPCD (+)
and a.IND_ID = c.CID
and c.CF = 'N';

Please consult
HOW TO: Post a SQL statement tuning request - template posting
Also format your code and post it using the [ code ] and [ /code ] tags. (Leave out the extra space after [ and before ])
Sybrand Bakker
Senior Oracle DBA
Edited by: sybrand_b on 10-apr-2013 17:57

Partition pruning, Nested loops

Hi,
I am having a problem with getting partition pruning in a query. I've managed to dumb down the problem to two tables and a minimal query (see below).
Basically, I have a partitioned table "Yearly Facts", and a helper table "Current Year" that always contain 1 row. The sole purpose of this one row is to tell what the curent year is, what the previous year was and what the next year will be. (In the real problem, there are non-standard timeperiods, so one cannot just calculate previous and next by adding/subtracting 1 as would be possible in this example).
The following query is executed the way I want.
It performs a scan on current_year, and then nested loop into the facts. And partition pruning was happening.
select sum(decode(a.year_key, b.curr_year, some_measure)) as curr_year_measure
from yearly_fact_t a
      ,current_year b
where a.year_key = b.curr_year;
| Id | Operation                  | Name          | Rows | Bytes | Cost (%CPU)| Time     | Pstart| Pstop |
|   0 | SELECT STATEMENT           |               |     1 |    39 |     4   (0)| 00:00:01 |       |    |
|   1 | SORT AGGREGATE            |               |     1 |    39 |            |          |       |    |
|   2 |   NESTED LOOPS             |               |     1 |    39 |     4   (0)| 00:00:01 |       |    |
|   3 |    INDEX FAST FULL SCAN    | SYS_C00247890 |     1 |    13 |     2   (0)| 00:00:01 |       |    |
|   4 |    PARTITION RANGE ITERATOR|               |     1 |    26 |     2   (0)| 00:00:01 |   KEY |   KEY |
|* 5 |     TABLE ACCESS FULL      | YEARLY_FACT_T |     1 |    26 |     2   (0)| 00:00:01 |   KEY |   KEY |
Predicate Information (identified by operation id):
   5 - filter("A"."YEAR_KEY"="B"."CURR_YEAR")The following query is where I have my problem.
The basic xplan is the same, but for some reason the cbo gave up and decide to scan all partitions, which was not very scalable on production data :)
I would have thought that the plan would be the same.
select sum(decode(a.year_key, b.curr_year, some_measure)) as curr_year_measure
      ,sum(decode(a.year_key, b.prev_year, some_measure)) as prev_year_measure
from yearly_fact_t a
      ,current_year b
where a.year_key = b.curr_year
    or a.year_key = b.prev_year;
| Id | Operation             | Name          | Rows | Bytes | Cost (%CPU)| Time     | Pstart| Pstop |
|   0 | SELECT STATEMENT      |               |     1 |    52 |    13   (0)| 00:00:01 |       |       |
|   1 | SORT AGGREGATE       |               |     1 |    52 |            |          |       |       |
|   2 |   NESTED LOOPS        |               |     4 |   208 |    13   (0)| 00:00:01 |       |       |
|   3 |    TABLE ACCESS FULL | CURRENT_YEAR |     1 |    26 |     4   (0)| 00:00:01 |       |       |
|   4 |    PARTITION RANGE ALL|               |     4 |   104 |     9   (0)| 00:00:01 |     1 |     6 |
|* 5 |     TABLE ACCESS FULL | YEARLY_FACT_T |     4 |   104 |     9   (0)| 00:00:01 |     1 |     6 |
Predicate Information (identified by operation id):
   5 - filter("A"."YEAR_KEY"="B"."CURR_YEAR" OR "A"."YEAR_KEY"="B"."PREV_YEAR")
-- drop table yearly_fact_t purge;
-- drop table current_year purge;
create table current_year(
   curr_year number(4) not null
,prev_year number(4) not null
,next_year number(4) not null
,primary key(curr_year)
,unique(prev_year)
,unique(next_year)
insert into current_year(curr_year, prev_year, next_year) values(2010, 2009, 2011);
commit;
create table yearly_fact_t(
   year_key     number(4) not null
,some_dim_key number    not null
,some_measure number    not null
partition by range(year_key)(
   partition p2007 values less than(2008)
,partition p2008 values less than(2009)
,partition p2009 values less than(2010)
,partition p2010 values less than(2011)
,partition p2011 values less than(2012)
,partition pmax values less than(maxvalue)
insert into yearly_fact_t(year_key, some_dim_key, some_measure) values(2007,1, 10);
insert into yearly_fact_t(year_key, some_dim_key, some_measure) values(2008,1, 20);
insert into yearly_fact_t(year_key, some_dim_key, some_measure) values(2009,1, 30);
insert into yearly_fact_t(year_key, some_dim_key, some_measure) values(2010,1, 40);
commit; What can I do to get partition pruning to happen in the second query?
Or even better, what is it in my query that prevents it from happening?
We're running Oracle Database 10g Enterprise Edition Release 10.2.0.4.0 - 64bit.
Best regards
Ronnie

Hi Ronnie,
Check whether your statistics are up to date.
SQL> set autotrace traceonly exp
SQL> select sum(decode(a.year_key, b.curr_year, some_measure)) as curr_year_measure
2        ,sum(decode(a.year_key, b.prev_year, some_measure)) as prev_year_measure
3    from yearly_fact_t a
4        ,current_year b
5   where a.year_key = b.curr_year
6      or a.year_key = b.prev_year;
Execution Plan
Plan hash value: 229094315
| Id | Operation             | Name          | Rows | Bytes | Cost (%CPU)| Time     | Pstart| Pstop |
|   0 | SELECT STATEMENT      |               |     1 |    52 |    10   (0)| 00:00:01 |       |       |
|   1 | SORT AGGREGATE       |               |     1 |    52 |            |          |       |       |
|   2 |   NESTED LOOPS        |               |     4 |   208 |    10   (0)| 00:00:01 |       |       |
|   3 |    TABLE ACCESS FULL | CURRENT_YEAR |     1 |    26 |     3   (0)| 00:00:01 |       |       |
|   4 |    PARTITION RANGE ALL|               |     4 |   104 |     7   (0)| 00:00:01 |     1 |     6 |
|* 5 |     TABLE ACCESS FULL | YEARLY_FACT_T |     4 |   104 |     7   (0)| 00:00:01 |     1 |     6 |
Predicate Information (identified by operation id):
   5 - filter("A"."YEAR_KEY"="B"."CURR_YEAR" OR "A"."YEAR_KEY"="B"."PREV_YEAR")
Note
   - dynamic sampling used for this statement
SQL> set autotrace off
SQL> exec dbms_stats.gather_table_stats(user, 'current_year', estimate_percent=>100, cascade=>true, method_opt
=>'for all columns size 1');
PL/SQL procedure successfully completed.
SQL>
SQL> exec dbms_stats.gather_table_stats(user, 'yearly_fact_t', estimate_percent=>100, cascade=>true, method_op
t=>'for all columns size 1');
PL/SQL procedure successfully completed.
SQL> set autotrace traceonly exp
SQL> select sum(decode(a.year_key, b.curr_year, some_measure)) as curr_year_measure
2        ,sum(decode(a.year_key, b.prev_year, some_measure)) as prev_year_measure
3    from yearly_fact_t a
4        ,current_year b
5   where a.year_key = b.curr_year
6      or a.year_key = b.prev_year;
Execution Plan
Plan hash value: 2253546831
| Id | Operation                   | Name          | Rows | Bytes | Cost (%CPU)| Time     | Pstart| Pstop |
|   0 | SELECT STATEMENT            |               |     1 |    15 |     8   (0)| 00:00:01 |       |       |
|   1 | SORT AGGREGATE             |               |     1 |    15 |            |          |       |       |
|   2 |   CONCATENATION             |               |       |       |            |          |       |       |
|   3 |    NESTED LOOPS             |               |     1 |    15 |     4   (0)| 00:00:01 |       |       |
|   4 |     TABLE ACCESS FULL       | CURRENT_YEAR |     1 |     8 |     3   (0)| 00:00:01 |       |       |
|   5 |     PARTITION RANGE ITERATOR|               |     1 |     7 |     1   (0)| 00:00:01 |   KEY |   KEY |
|* 6 |      TABLE ACCESS FULL      | YEARLY_FACT_T |     1 |     7 |     1   (0)| 00:00:01 |   KEY |   KEY |
|   7 |    NESTED LOOPS             |               |     1 |    15 |     4   (0)| 00:00:01 |       |       |
|   8 |     TABLE ACCESS FULL       | CURRENT_YEAR |     1 |     8 |     3   (0)| 00:00:01 |       |       |
|   9 |     PARTITION RANGE ITERATOR|               |     1 |     7 |     1   (0)| 00:00:01 |   KEY |   KEY |
|* 10 |      TABLE ACCESS FULL      | YEARLY_FACT_T |     1 |     7 |     1   (0)| 00:00:01 |   KEY |   KEY |
Predicate Information (identified by operation id):
   6 - filter("A"."YEAR_KEY"="B"."PREV_YEAR")
10 - filter("A"."YEAR_KEY"="B"."CURR_YEAR" AND LNNVL("A"."YEAR_KEY"="B"."PREV_YEAR"))
SQL> set autotrace off
SQL>Asif Momen
http://momendba.blogspot.com

Nested Loop Help

Hello,
I have generated a simple VI, to make multiplication and division operations. I have the following operation performed with the following inputs.
A1 has a value range from 1 -10 fixed
A2 has an input range of 1 - 5
A3,A4 are constants.
so Result = (A1*A3 ) / (A4*A2)*100 ,
I want to plot "Result Vs. A1" with a current value of A2, increment A2 and repeat the procedure. So I generate 5 graphs and display it in only one. I need to write a nested loop to perform this operation.however I am able to do it only once.
I am trying to use for loop structure in one another but havent gone ahead in this.Any help will be appreciable..Thanks in advance.

altenbach wrote:
Dravi99 wrote:
The Problem is that I want to plot the division result vs. the # of array out elements and i am unsuccessful at it. May be i am missing on the waveform graph properties.
You should make the current values default before saving so we have some typical data to play with.
Currently, your code makes very little sense, because the inner loop has no purpose.
If you plot the division result versus array index (I assume that's what you want, I don't understand what you mean by "the # of array out elements "), you only have one plot. What should be on the other plots???
Please explain or even attach an image of the desired output. Thanks!
Thanks Altenbach for the inputs.
I have made the values default. Srry for the previous one.
Now the inner loop was placed so that i can create a 2D array.
I need to plot the division result vs. the value of the element in the arry out. i.e. currently my array out has 0.0...,0.3 I want that to be the X axis.
The graph plotted is for 1st value of "in", this value will change like from 4.5 to 4.7 to 4.9, not necesarily in steps.
Thus my one graph should have multiple plots of "in" which has the above mentioned axis.
Hope this time i was clear in my msg. I have attached the modified VI.
Attachments:
For_loop_prob.vi ‏17 KB

Need nested loop's solution....

hi..
i have done following coding for my one senario..i've used nested loop.but can anyone pls give me other solution than nested loop statement?
i dont wnat to use nested loop...
SELECT WI_ID WI_STAT WI_CD WI_AAGENT FROM SWWWIHEAD "FETCHING WORK ITEM DATA FROM THE SWWWIHEAD
 INTO TABLE IT_SWWWIHEAD
 WHERE WI_CD IN SO_WI_CD.
SORT IT_SWWWIHEAD.
IF SY-SUBRC = 0.
 LOOP AT IT_SWWWIHEAD INTO WA_SWWWIHEAD.
 CALL FUNCTION 'SWI_GET_DEPENDENT_WORKITEMS' "FUNCTION MODULE TO GET DEPENDENT WORK ITEM ID, IF ANY.
 EXPORTING
 WI_ID = WA_SWWWIHEAD-WI_ID
 TABLES
 DEPENDENT_WIS = IT_SWWWIHEAD_D.
 IF IT_SWWWIHEAD_D IS NOT INITIAL.
 DELETE IT_SWWWIHEAD_D WHERE WI_TYPE <> 'W'.
 SORT IT_SWWWIHEAD_D.
 LOOP AT IT_SWWWIHEAD_D INTO WA_SWWWIHEAD_D.
 CALL FUNCTION 'SAP_WAPI_READ_CONTAINER' "FUNCTION MODULE TO GET DATA FROM EVERY DEPENDENT ID.
 EXPORTING
 WORKITEM_ID = WA_SWWWIHEAD_D-WI_ID
 LANGUAGE = SY-LANGU
 USER = SY-UNAME
 IMPORTING
 RETURN_CODE =
 IFS_XML_CONTAINER =
 IFS_XML_CONTAINER_SCHEMA =
 TABLES
 SIMPLE_CONTAINER = IT_SIM_CONT
 MESSAGE_LINES =
 MESSAGE_STRUCT =
 SUBCONTAINER_BOR_OBJECTS =
 SUBCONTAINER_ALL_OBJECTS = IT_SUBCONTAINER
 READ TABLE IT_SIM_CONT
 INTO WA_SIM_CONT WITH KEY ELEMENT = '_WI_RESULT'. "getting the result(approved or rejected).
 IF SY-SUBRC = 0.
 IF wa_sim_cont-value = '0001'.
 WA_FINAL-WI_STAT = 'APPROVED'.
 ELSEIF WA_SIM_CONT-VALUE = '0002'.
 WA_FINAL-WI_STAT = 'REJECTED'.
 ENDIF.
 ENDIF.
 READ TABLE IT_SUBCONTAINER
 INTO WA_SUBCONTAINER WITH KEY ELEMENT = 'SODATA'. "getting SO DOCUMENT for this workitem.
 IF SY-SUBRC = 0.
 WA_FINAL-WI_AAGENT = WA_SWWWIHEAD_D-WI_AAGENT.
 ENDIF.
 WA_FINAL-WI_ID = WA_SWWWIHEAD-WI_ID.
 WA_FINAL-WI_ID_D = WA_SWWWIHEAD_D-WI_ID.
 WA_FINAL-WI_CD = WA_SWWWIHEAD-WI_CD.
 WA_FINAL-WI_SO = wa_subcontainer-value+0(10).
 WA_FINAL-WI_RESULT = WA_SIM_CONT-VALUE.
 SELECT SINGLE VKORG MAHDT FROM VBAK
 INTO (VKORG, MAHDT)
 WHERE VBELN = WA_FINAL-WI_SO.
 IF SY-SUBRC = 0.
 WA_FINAL-WI_VKORG = VKORG.
 IF MAHDT <> '00000000'.
 WA_FINAL-WI_FINAL_RESULT = 'OK'.
 ELSE.
 WA_FINAL-WI_FINAL_RESULT = 'PENDING'.
 ENDIF.
 ENDIF.
 APPEND WA_FINAL TO IT_FINAL.
 CLEAR WA_FINAL.
 ENDLOOP.
 CLEAR IT_SWWWIHEAD_D[].
 CLEAR IT_SIM_CONT[].
 ENDIF.
 ENDLOOP. ENDIF.

hi sagar,
Pls go through the following explanations for understanding abt control level processing.
Control level processing is allowed within a LOOP over an internal table. This means that you can divide sequences of entries into groups based on the contents of certain fields.
Internal tables are divided into groups according to the sequence of the fields in the line structure. The first column defines the highest control level and so on. The control level hierarchy must be known when you create the internal table.
The control levels are formed by sorting the internal table in the sequence of its structure, that is, by the first field first, then by the second field, and so on. Tables in which the table key occurs at the start of the table are particularly suitable for control level processing.
The following diagram illustrates control level processing in a sorted table, where different field contents in the first three fields are indicated by different colors:
Each change of color in a column indicates a control level change in the corresponding hierarchy level. Within the processing block of a loop, you can use the control level statement AT to react to a control level change. This enables you to restrict statements to a certain set of lines. You can thus use the SUM statement to calculate totals from subsets of all lines.
The AT statement introduces a statement block that you end with the ENDAT statement.
AT <level>.
<statement block>
ENDAT.
You can react to the following control level changes:
<level>
Meaning
FIRST
First line of the internal table
LAST
Last line of the internal table
NEW <f>
Beginning of a group of lines with the same contents in the field <f> and in the fields left of <f>
END Of <f>
End of a group of lines with the same contents in the field <f> and in the fields left of <f>
You can use control level statements to react to control breaks in internal tables instead of programming them yourself with logical expressions. Within the loop, you must order the AT-ENDAT statement blocks according to the hierarchy of the control levels. If the internal table has the columns <f1>, <f 2>, ...., and if it is sorted by these columns, you must program the loop as follows:
LOOP AT <itab>.
AT FIRST. ... ENDAT.
 AT NEW <f1>. ...... ENDAT.
 AT NEW <f2 >. ...... ENDAT.
 <single line processing>
 AT END OF <f2>. ... ENDAT.
 AT END OF <f1>. ... ENDAT.
AT LAST. .... ENDAT.
ENDLOOP.
The innermost hierarchy level <single line processing> processes the table lines that do not correspond to a control level change. You do not have to use all control level statements. But you must place the used ones in the above sequence. You should not use control level statements in loops where the line selection is restricted by WHERE or FROM and TO. Neither should the table be modified during the loop.
If a control level field <fi> is not known until runtime, you can specify it dynamically as (<n i>) where <n i> contains the field of <f i>. If <n i> is empty at runtime, the criterion for changing the control level is ignored. You can restrict the search to partial fields by specifying offset and length.
If you are working with a work area <wa>, it does not contain the current line in the AT... ENDAT statement block. All character fields to the right of the current group key are filled with asterisks (*). All other fields to the right of the current group key contain their initial value.
Within an AT...ENDAT block, you can calculate the contents of the numeric fields of the corresponding control level using the SUM statement.
SUM.
You can only use this statement within a LOOP. If you use SUM in an AT - ENDAT block, the system calculates totals for the numeric fields of all lines in the current line group and writes them to the corresponding fields in the work area (see example in ). If you use the SUM statement outside an AT - ENDAT block (single entry processing), the system calculates totals for the numeric fields of all lines of the internal table in each loop pass and writes them to the corresponding fields of the work area. It therefore only makes sense to use the SUM statement in AT...ENDAT blocks.
If the table contains a nested table, you cannot use the SUM statement. Neither can you use it if you are using a field symbol instead of a work area in the LOOP statement.
Examples
DATA: BEGIN OF LINE,
 COL1 TYPE C,
 COL2 TYPE I,
 COL3 TYPE I,
 END OF LINE.
DATA ITAB LIKE HASHED TABLE OF LINE
 WITH UNIQUE KEY COL1 COL2.
LINE-COL1 = 'A'.
DO 3 TIMES.
LINE-COL2 = SY-INDEX.
LINE-COL3 = SY-INDEX ** 2.
INSERT LINE INTO TABLE ITAB.
ENDDO.
LINE-COL1 = 'B'.
DO 3 TIMES.
LINE-COL2 = 2 * SY-INDEX.
LINE-COL3 = ( 2 * SY-INDEX ) ** 2.
INSERT LINE INTO TABLE ITAB.
ENDDO.
SORT ITAB.
LOOP AT ITAB INTO LINE.
WRITE: / LINE-COL1, LINE-COL2, LINE-COL3.
AT END OF COL1.
 SUM.
 ULINE.
 WRITE: / LINE-COL1, LINE-COL2, LINE-COL3.
 SKIP.
ENDAT.
AT LAST.
 SUM.
 ULINE.
 WRITE: / LINE-COL1, LINE-COL2, LINE-COL3.
ENDAT.
ENDLOOP.
The output is:
A 1 1
A 2 4
A 3 9
A 6 14
B 2 4
B 4 16
B 6 36
B 12 56
 18 70
The program creates a hashed table ITAB, fills it with six lines, and sorts it. In the LOOP - ENDLOOP block, the work area LINE is output for each loop pass. The first field of the table key, COL1, is used for control level processing. The total for all numeric fields is always calculated when the contents of COL1 change and when the system is in the last loop pass.
DATA: BEGIN OF LINE,
 CARRID TYPE SBOOK-CARRID,
 CONNID TYPE SBOOK-CONNID,
 FLDATE TYPE SBOOK-FLDATE,
 CUSTTYPE TYPE SBOOK-CUSTTYPE,
 CLASS TYPE SBOOK-CLASS,
 BOOKID TYPE SBOOK-BOOKID,
 END OF LINE.
DATA ITAB LIKE SORTED TABLE OF LINE WITH UNIQUE KEY TABLE LINE.
SELECT CARRID CONNID FLDATE CUSTTYPE CLASS BOOKID
 FROM SBOOK INTO CORRESPONDING FIELDS OF TABLE ITAB.
LOOP AT ITAB INTO LINE.
AT FIRST.
 WRITE / 'List of Bookings'.
 ULINE.
ENDAT.
 AT NEW CARRID.
 WRITE: / 'Carrid:', LINE-CARRID.
 ENDAT.
 AT NEW CONNID.
 WRITE: / 'Connid:', LINE-CONNID.
 ENDAT.
 AT NEW FLDATE.
 WRITE: / 'Fldate:', LINE-FLDATE.
 ENDAT.
 AT NEW CUSTTYPE.
 WRITE: / 'Custtype:', LINE-CUSTTYPE.
 ENDAT.
 WRITE: / LINE-BOOKID, LINE-CLASS.
 AT END OF CLASS.
 ULINE.
 ENDAT.
ENDLOOP.
In this example, the sorted internal table ITAB is filled with data from the database table SBOOK using the Open SQL statement SELECT. The sequence of the columns in the internal table defines the control level hierarchy. Since the table key is the entire line, the sort sequence and the control level hierarchy are the same. The sequence of the AT-ENDAT blocks within the LOOP and ENDLOOP statements is important.
The output is as follows:
List of Bookings
Carrid: AA
Connid: 0017
Fldate: 1998/11/22
Custtype: B
00063509 C
00063517 C
00063532 F
00063535 F
Custtype: P
00063653 C
00063654 C
00063668 F
00063670 F
Fldate: 1998/29/11
Custtype: B
00064120 C
00064121 C
and so on.
pls reward if helpful.

Help with my nested loop...

this application allows a user to enter two int values, rows(height) and columns(length), that are used to create a box of asterisks.
my createBox() does not work correctly, only prints first line, loops infinitely, or doesnt loop. can someone help me out please?
import java.io.*;
public final class AsteriskBox
/****InstanceVariables****/
public static int row;
public static int col;
/****Constructor()****/
public AsteriskBox()
/****Access()'s****/
public void createBox(int x, int y)
if((x > 0) && (y > 0))
for(int i = x; i > 0; i--)
for(i = y; i > 0; i--)
System.out.print("*");
System.out.println();
} // createBox()
public void getInput() throws IOException
BufferedReader input = new BufferedReader
(new InputStreamReader(System.in));
System.out.print("Enter a number of rows: ");
String inputString = input.readLine();
row = convertStringToInteger(inputString);
System.out.print("Enter a number of columns: ");
inputString = input.readLine();
col = convertStringToInteger(inputString);
} // getInput()
/****Helper()****/
private int convertStringToInteger(String s)
Integer intObject = Integer.valueOf(s);
return intObject.intValue();
} // convertStringToInt()
} // AsteriskBox class
import java.io.*;
public class AsteriskBoxUser
public static void main(String args[]) throws IOException
AsteriskBox box = new AsteriskBox();
System.out.println("This program creates a box made of asterisks with values given by you!");
System.out.println();
box.getInput();
box.createBox(AsteriskBox.row, AsteriskBox.col);
}

You will never break out of the first loop because you are using the same index variable i for both of your nested loops. Use a different variable, say j for your inner loop.
Incidentally, your row and col variables are mislabeled. If you use the static modifier, they are class variables, not instance variables. This could cost you points on your assignment since it would imply that you don't know the difference.

Bulk collect with Nested loops

Hi I've a requirement like this
I need to pull request nos from table a(Master table)
For every request no I need to pull request details from table b(Detail Table)
For every request no I need to pull contact details from table c
For every request no I need to pull customer data table d and I need to create a flat file with that data so I'm using utl_file in normal query criterion because of nested loops it's taking lot of time so I want to use bulk collect with dynamic query option:
Sample code
=======
create or replace procedure test(region varchar2) as
type tablea_request_typ is table of varchar2(10);
tablea_data tablea_request_typ;
type tableb_request_typ is table of varchar2(1000);
tableb_data tableb_request_typ;
type tablec_request_typ is table of varchar2(1000);
tablec_data tablec_request_typ;
type tabled_request_typ is table of varchar2(1000);
tabled_data tabled_request_typ;
stmta varchar2(32000);
stmtb varchar2(32000);
stmtc varchar2(32000);
stmtd varchar2(32000);
rcura SYS_REFCURSOR;
rcurb SYS_REFCURSOR;
rcurc SYS_REFCURSOR;
rcurd SYS_REFCURSOR;
begin
stmta:='select request_no from tablea where :region'||'='NE';
stmtb:='select request_no||request_detail1||request_detail2 stringb from table b where :region'||'='NE';
stmtc:='select contact1||contact2||contact3||contact4 stringc from table c where :region'||'='NE';
stmtd:='select customer1||customer2||customer3||customer4 stringd from table c where :region'||'='NE';
OPEN rcura for stmta;
LOOP
FETCH rcura BULK COLLECT INTO request_no
LIMIT 1000;
FOR f in 1..request_no.count
LOOP
--Tableb
    OPEN rcurb for stmtb USING substr(request_no(f),1,14);
LOOP
FETCH rcurb BULK COLLECT INTO tableb_data
for i in 1..tableb_data.count
LOOP
utl_file(...,tableb_data(i));
END LOOP;
    EXIT WHEN rcurb%NOTFOUND;
END LOOP;
-- Tablec
OPEN rcurc for stmtc USING substr(request_no(f),1,14);
LOOP
FETCH rcurb BULK COLLECT INTO tablec_data
for i in 1..tablec_data.count
LOOP
utl_file(...,tablec_data(i));
END LOOP;
    EXIT WHEN rcurc%NOTFOUND;
END LOOP;
-- Tabled
OPEN rcurd for stmtd USING substr(request_no(f),1,14);
LOOP
FETCH rcurd BULK COLLECT INTO tabled_data
for i in 1..tabled_data.count
LOOP
utl_file(...,tabled_data(i));
END LOOP;
    EXIT WHEN rcurd%NOTFOUND;
END LOOP;
END LOOP;
    EXIT WHEN rcura%NOTFOUND;
END LOOP;
exception
when other then
dbms_output.put_line(sqlerrm);
end;I 'm using code mentioned above but request nos are repeating as if it's an infinete loop ?for ex if request no is 222 It should run once but here it's running more than once?
How to pass bind parameters say in my case region?
Are there any alternate solutions to run it faster apart from using bulk collect?
Right now I'm using explicit cursor with for loop which is taking lot of time ?so is this better sol?
Thanks,
Mahender
Edited by: BluShadow on 24-Aug-2011 08:52
added {noformat}{noformat} tags. Please read {message:id=9360002} to learn to format your code/data yourself.

    Use Parameterized cursor :
CREATE OR REPLACE PROCEDURE test(region varchar2)
AS
type tablea_request_typ is table of varchar2(10);
type tableb_request_typ is table of varchar2(1000);
type tablec_request_typ is table of varchar2(1000);
type tabled_request_typ is table of varchar2(1000);
tablea_data tablea_request_typ;
tableb_data tableb_request_typ;
tablec_data tablec_request_typ;
tabled_data tabled_request_typ;
   CURSOR rcura(v_region VARCHAR2(100))
   IS
   select request_no from tablea where region = v_region;
   CURSOR rcurb(v_input VARCHAR2(100))
   IS
   select request_no||request_detail1||request_detail2 stringb from table b where request_num = v_input;
   CURSOR rcurc(v_input VARCHAR2(100))
   IS
   select select contact1||contact2||contact3||contact4 stringc from table c where request_num = v_input;
   CURSOR rcurd(v_input VARCHAR2(100))
   IS
   select select customer1||customer2||customer3||customer4 stringd from table c where request_num = v_input;
BEGIN
OPEN rcura('NE');
LOOP
    FETCH rcura BULK COLLECT INTO request_no LIMIT 1000;
    FOR f in 1..request_no.count
    LOOP
       --Tableb
       OPEN rcurb(substr(request_no(f),1,14));
       LOOP
          FETCH rcurb BULK COLLECT INTO tableb_data
          for i in 1..tableb_data.count
          LOOP
              utl_file(...,tableb_data(i));
          END LOOP;
          EXIT WHEN rcurb%NOTFOUND;
       END LOOP;
       -- Tablec
       OPEN rcurc (substr(request_no(f),1,14));
       LOOP
          FETCH rcurb BULK COLLECT INTO tablec_data
          for i in 1..tablec_data.count
          LOOP
             utl_file(...,tablec_data(i));
          END LOOP;
          EXIT WHEN rcurc%NOTFOUND;
       END LOOP;
       -- Tabled
       OPEN rcurd ( substr(request_no(f),1,14) );
       LOOP
          FETCH rcurd BULK COLLECT INTO tabled_data
          for i in 1..tabled_data.count
          LOOP
           utl_file(...,tabled_data(i));
          END LOOP;
          EXIT WHEN rcurd%NOTFOUND;
       END LOOP;
END LOOP;
EXIT WHEN rcura%NOTFOUND;
END LOOP;
EXCEPTION
WHEN OTHERS THEN
   dbms_output.put_line(dbms_utility.format_error_backtrace);
END;
/Hope this helps. If not, post your table structures...

@@FETCH_STATUS in nested loops

Does fetch status in nested loops conflict?
I have a script that should output a cluster record line and for each cluster record it must create a line for each household in the cluster. All the data is pulled from one table, 'LFS_APRIL_2015.dbo.LISTING'.
This is the script:
--VARIABLE DECLARATION
DECLARE @CLUSTER FLOAT, @HOUSEHOLD_NUMBER FLOAT, @FULL_ADDRESS CHAR(50), @HEAD_NAME CHAR(24)--CLUSTER LOOP
DECLARE CLUSTER_CURSOR CURSOR FOR
SELECT [LFS_APRIL_2015].[dbo].[LISTING].CLUSTER
from [LFS_APRIL_2015].[dbo].[LISTING] where CLUSTER IS NOT NULL and DISTRICT = 1
OPEN CLUSTER_CURSOR
FETCH NEXT FROM CLUSTER_CURSOR INTO @CLUSTER
WHILE @@FETCH_STATUS = 0
BEGIN--OUTPUT THE CLUSTER RECORD
PRINT STR(@CLUSTER,3) + STR(1,1) + STR(24,3)
--HOUSEHOLD LOOP
DECLARE HOUSEHOLD_CURSOR CURSOR FOR
SELECT [LFS_APRIL_2015].[dbo].[LISTING].HOUSEHOLD_NUMBER, FULL_ADDRESS, HEAD__INSTITUTION__BUSINESS_NAME
from [LFS_APRIL_2015].[dbo].[LISTING] where CLUSTER IS NOT NULL AND IS_HOUSEHOLD = 1 AND CLUSTER = @CLUSTER
OPEN HOUSEHOLD_CURSOR
FETCH NEXT FROM HOUSEHOLD_CURSOR INTO @HOUSEHOLD_NUMBER, @FULL_ADDRESS, @HEAD_NAME
WHILE @@FETCH_STATUS = 0
BEGIN
--OUTPUT THE HOUSEHOLDS IN THE CLUSTER
PRINT right('000'+cast(@CLUSTER as varchar(10)),3) + STR(2,1) + STR(@HOUSEHOLD_NUMBER,2) + @FULL_ADDRESS + @HEAD_NAME + '000' + ' ' + STR(0,1)
FETCH NEXT FROM HOUSEHOLD_CURSOR INTO @HOUSEHOLD_NUMBER, @FULL_ADDRESS, @HEAD_NAME
END
CLOSE HOUSEHOLD_CURSOR
DEALLOCATE HOUSEHOLD_CURSOR
FETCH NEXT FROM CLUSTER_CURSOR INTO @CLUSTER
END
CLOSE CLUSTER_CURSOR
DEALLOCATE CLUSTER_CURSOR
It appears however that the clusters are being repeated.
Where have I gone wrong!

>> I have a script that should output a cluster record [sic] [sic] line and for each cluster record [sic] it must create a line for each household in the cluster. All the data is pulled from one table, 'LFS_APRIL_2015.dbo.LISTING'.<<
Please follow the basic Netiquette of all SQL forums. Post DDL that follows ISO-11179 rules for data element names. Use ISO-8601 formats for temporal data. Use induSTRy standard encodings (ISBN, UPC, GTIN, etc) and avoid needless dialect. Give clear specifications.
Give sample data.
If you do not know that rows are not records, fields are not columns and tables are not files, then you should not be posting. SQL is a declarative language, so we hate cursors. We hate local variables, too.
Using upper case letters is a code smell that says your mindset is still in punch cards and sequential processing. And finally you used a date in a data STRuctured name! Back in the 1960's, this is how we named magnetic tapes. In RDBMS, we name tables for the
set of entities they model.
Why are you using FLOAT? Is there really household number like 3.141592653 in your data model? But if it is really an integer, you still screwed up. What math do you do with it?
The USPS standards use 5 lines of VARCHAR(35) for a Street address. But you pack all of that in CHAR(50). Think about how vague “cluster” is – Size? Name? Location? WHAT??
The purpose of PRINT in T-SQL is debugging and not output. The purpose of SQL is to handle the data, not to format and display data, like you are doing. Learn what a “presentation layer” in RDBMS is.
Follow the rules, and post that DDL, then we will try to help you. All you can get is a stinking kludge with this posting.
--CELKO-- Books in Celko Series for Morgan-Kaufmann Publishing: Analytics and OLAP in SQL / Data and Databases: Concepts in Practice Data / Measurements and Standards in SQL SQL for Smarties / SQL Programming Style / SQL Puzzles and Answers / Thinking
in Sets / Trees and Hierarchies in SQL

When does oracle use a complete nested loop join?

Hi!
Does Oracle Database use a complete nested loop join? I mean, imagine 2 tables without any indexes.. is there any case where for each row in the outer table Oracle does a complete scan in the inner table? I know that this is the original algorithm for the nested loop join, but some data bases prefer to make a temp table to autoindex the inner table and never makes the complete scan in the inner table..
thanks!!

user12040235 wrote:
If the table do not have indexes.. some data bases prefer to scan one time the inner table, to index all values, and than, for every row in the outter loop table, it will do a index search.
I just like to know oracle does the same thing, or it does the complete scan..If you have two tables without indexes, Oracle may consider scanning one table, extracting the smallest data set it can get away with, and then building a hash table of that data set (rather than creating an in-memory copy with index). At this point Oracle can then do a nested loop join into the in-memory hash table.
However, this is called a hash join, and the order of tables will appear to be reversed, viz:
nested loop
    table scan full ABC
    table scan full XYZ
{code]
becomeshash join
table scan full XYZ
table scan full ABC
See: http://jonathanlewis.wordpress.com/2010/08/02/joins/ as a starting point if you want to read more on this topic.
Regards
Jonathan Lewis

How to get (old)previous date and create a loop?

Hi!!!
I am using java.util.date object.
I need to get the 2 months back date,i.e. 60 days back date and to create a loop from that date till today and add it to combobox.
Suppose today's date=3-12-2001
x=date-60=3-10-2001
and wants to create a loop from 3-10-2001 till today to display it in a combobox.
Please tell me how can I do it?

try the below which will print the date form 60 days before(from today) to todays date
import java.util.Calendar;
import java.util.Date;
public class RandomNumber
 public static void main(String args[])
 RandomNumber rn = new RandomNumber();
 rn.printDate();
 public void printDate()
 Date todayDate = new Date(System.currentTimeMillis());
 Calendar calendar_ = Calendar.getInstance();
 calendar_.setTime(todayDate);
 calendar_.add(Calendar.DAY_OF_YEAR, -60);
 for(int i=0;i<60;i++)
 System.out.println(calendar_.getTime());
 calendar_.add(Calendar.DAY_OF_YEAR, 1);

Problem with Nested loop in Fox-Formula

Dear Experts,
Let s share the scenario :
MaterialGroups with following Keys for Example AAAA, BBBB, CCCC..., Materialgroups are selected in the 1st input ready query, which is assigned to DataProvider DP_1 in a webtemplate.
every Materialgroup has several Materials, for instance:
Materialgroup AAAA has following Materials: AAAA10, AAAA11, AAAA12, AAAA13...
Materials are selected in a second input ready Query, which is assigned to a second DataProvider DP_2 in the Same Webtemplate as the query 1.
Both Materialgroup and Material are based on the same Aggreagtion level and same real time cube.
I want to copy the input values for every MaterialGroup ( 1st query, DP_1) only to it s own Materials (2cond Query, DP_2).
To resolve this Issue i wrote the following Fox Formula code with a nested loop, however it does not work properly. when I m debugging the code, i could release that the second Loop was ignored.but wehn i replace the second loop (nested loop) with a fixed value it s seems to work properly
DATA MG1 TYPE MATG.<------ MaterialGroup
DATA MT1 TYPE MAT.<----
Material
DATA S1 TYPE STRING.
DATA S2 TYPE STRING.
DATA S3 TYPE STRING
DATA K TYPE F.
DATA Z TYPE F.
FOREACH MG1.
To check Materialgroup in debugger
S1= MG1.
BREAK-POINT.
K = {KEYfIG, #, MG1}.
BREAK-POINT.
FOREACH MT1. <----- if i set MT1 to a fixed value like AAAA11 then S3 get the wished value namely AAAA
S2 = MT1.
BREAK-POINT.
S3 = SUBSTR (MT1, 0, 4).
BREAK-POINT.
IF S1 = S3.
{KEYFIG, MT1, #} = K.
following Statement is only used To check in debugger if Material has become the same Materialgroup value
Z = {KEYFIG, MT1, #}.
BREAK-POINT.
ENDIF.
ENDFOR.
ENDFOR.
Thakns for any help
Frank
Edited by: FRYYYBM on Mar 17, 2011 10:54 PM
Edited by: FRYYYBM on Mar 17, 2011 11:06 PM

Hi,
Please try this way.
DATA MG1 TYPE MATG.<------ MaterialGroup
DATA MT1 TYPE MAT.<----
Material
DATA S1 TYPE STRING.
DATA S2 TYPE STRING.
DATA S3 TYPE STRING
DATA K TYPE F.
DATA Z TYPE F.
FOREACH MT1.
FOREACH MG1.
To check Materialgroup in debugger
S1= MG1.
BREAK-POINT.
K = {KEYfIG, #, MG1}.
BREAK-POINT.
FOREACH MT1. <----- if i set MT1 to a fixed value like AAAA11 then S3 get the wished value namely AAAA
S2 = MT1.
BREAK-POINT.
S3 = SUBSTR (MT1, 0, 4).
BREAK-POINT.
IF S1 = S3.
{KEYFIG, MT1, #} = K.
following Statement is only used To check in debugger if Material has become the same Materialgroup value
Z = {KEYFIG, MT1, #}.
BREAK-POINT.
ENDIF.
ENDFOR.
ENDFOR.
ENDFOR.
Thanks.
With regards,
Anand Kumar

XML nested Loop?

hi all.
I´ve just completed a little test for making a tree
component with custom
icons / bransch.
However, i can only get my first branch to show custom
icons.(links -
document) I figure I need to make a nested loop to Iterate
over
nextSibling?. I tried ALOT, but i guess I´m doing
something completely
wrong.
here is code for my tree so far:
my_xml = new XML();
my_xml.ignoreWhite = true;
my_xml.load("tree.xml");
my_xml.onLoad = function(){
myTree.dataProvider = this.firstChild;
var folders = my_xml.firstChild.firstChild;
var docs = folders.childNodes;
for (var i=0; i < docs.length; i++){
currDoc = docs
trace(docs);
var docIcon = currDoc.attributes.pic;
switch(docIcon){
case "pdf":
myTree.setIcon(currDoc, "pdfIcon");
break;
case "word":
myTree.setIcon(currDoc, "wordIcon");
break;
case "excel":
myTree.setIcon(currDoc, "excelIcon");
break;
case "ie":
myTree.setIcon(currDoc, "ieIcon");
break;
}//switch
} //for
};//onLoad
And here is the XML I used:
<node label="» Dokument typer">
<node label="» links - document">
<node label="test.url" url="
http://www." pic="ie" info="test text" />
<node label="test.doc" url="test.doc" pic="word"
info="test text" />
<node label="test.excel" url="test.xls" pic="excel"
info="test text" />
<node label="test.pdf" url="test.pdf" pic="pdf"
info="test text." />
</node>
<node label="» Links - document">
<node label="test URL" url="
http://www." pic="ie" info="test text."
/>
<node label="test URL" url="
http://www." pic="ie" info="test text."
/>
</node>
</node>

Solved it ..works nicely :D
ty anyways.
//cleaner
"cLeAnEr" <[email protected]> skrev i meddelandet
news:ekm1vc$r8h$[email protected]..
> hi all.
>
> I´ve just completed a little test for making a tree
component with custom
> icons / bransch.
> However, i can only get my first branch to show custom
icons.(links -
> document) I figure I need to make a nested loop to
Iterate over
> nextSibling?. I tried ALOT, but i guess I´m doing
something completely
> wrong.
>
>
> here is code for my tree so far:
>
> my_xml = new XML();
> my_xml.ignoreWhite = true;
> my_xml.load("tree.xml");
>
> my_xml.onLoad = function(){
> myTree.dataProvider = this.firstChild;
>
>
> var folders = my_xml.firstChild.firstChild;
> var docs = folders.childNodes;
>
> for (var i=0; i < docs.length; i++){
> currDoc = docs
> trace(docs);
>
> var docIcon = currDoc.attributes.pic;
>
> switch(docIcon){
> case "pdf":
> myTree.setIcon(currDoc, "pdfIcon");
> break;
> case "word":
> myTree.setIcon(currDoc, "wordIcon");
> break;
> case "excel":
> myTree.setIcon(currDoc, "excelIcon");
> break;
> case "ie":
> myTree.setIcon(currDoc, "ieIcon");
> break;
> }//switch
> } //for
> };//onLoad
>
>
> And here is the XML I used:
>
> <node label="» Dokument typer">
> <node label="» links - document">
> <node label="test.url" url="
http://www." pic="ie" info="test text" />
> <node label="test.doc" url="test.doc" pic="word"
info="test text" />
> <node label="test.excel" url="test.xls" pic="excel"
info="test text" />
> <node label="test.pdf" url="test.pdf" pic="pdf"
info="test text." />
> </node>
> <node label="» Links - document">
> <node label="test URL" url="
http://www." pic="ie" info="test text."
/>
> <node label="test URL" url="
http://www." pic="ie" info="test text."
/>
> </node>
> </node>
>

Create nested directory on FTP folder if they don't exist while uploading file

How can I create nested directory on FTP folder if they don't exist. A local file is suppose to exactly uploaded in the same directory structure level in ftp folder. My question is -
1. Is there any C# opensource/free library that take care of creation of all sub-directories from file-path, if they don't exist on ftp and upload the file in one shot.
2. How much it will be feasible to make all these uploads along with some database update, archive, quarantine task in asynchronous? All succeeding tasks are sequentially depends in their order.i.e. ftp upload >> database update>> archive
from local >> quarantine the folder
This really requires parallel & asynchronous operation for heavy upload/transfer and going to be done by a Windows-Service.

Hello,
Your Subject:
>Sender File adpter --don't raise alerts when file does not exist in folder
is contradictory to your question.
>if the file does not exist,it is throwing an alert like "Could not process file '.file..xml: No such file or directory '
> Is there any way i can avoid raising an alert if file does not exist in the source folder.
I know you want to say "Don't Raise alerts when file does not exist in folder". Correct me if I am wrong.
Some times it happens, when we write the right thing but it means something else and this is the reason many experts have replied, "how to raise an alert". So if you remove the word "Sender File adapter" from your subject then it will be easy to understand the exact meaning.
Regards,
Sarvesh

Creating nested loops

Similar Messages

Maybe you are looking for