Connect By Parent Child

Hi,
I am using a vary simple command to check how many rows will be selected. But the problem is that this is continiously running and nit finsihing, even if I will create a view on this and then try to acces that view same stuff happen, the table has 3 millions of records, please need your help find an easy eay to figure it out;
select count(*) from (
select *
from test
start with account_code='MMJH8999'
connect by prior sub_acct_code = account_code
);

Hi Frayan,
Thanks for the reply. The table has only three columnss like Profit_Centre, account_code and sub_Acct_code
that is exactly doing what I want really, if I will run quey
select *
from account_test
start with account_code='DHL9890'
connect by prior sub_acct_code = account_code
It will return rows and all the rows which I needed but to put this query in table or in a view it could not respond. Dont know whats going wrong over here
Someoneelse is right; there's a lot of information missing.
You don't necessarily need a WHERE clause, and the lack of one isn't what's making the query slow. In fact, a WHERE clause would only make things slower, since it is applied after the CONNECT BY finishes.
Are you sure the CONNECT BY is doing what you want?
Can you post a little sample data (CREATE TABLE and INSERT statements), and the results you want from the sub-query given that sample data?
Is sub_acct_code unique? Is account_code unique?
Is the query really only using one table? Is that "table" actually a view, based on a join?

Similar Messages

Connect By Parent Child with @@@@@g5@@@

Hi,
I am having a problem to create a query wich has child accounts like @@B6565@@@@@@@ this in connect by clause. So that is not only one hundrerds of child account like that exist.
What can I do about that to include all those accounts in my query of connect by clause.

I don't see any problem here... Are you sure these are the records which cause problem?
WITH T1 AS
SELECT '1000@@@' Parent , '10101' Child FROM DUAL UNION ALL
SELECT '1000@@@', '10110' Child FROM DUAL UNION ALL
SELECT '1000@@@', '10111' Child FROM DUAL UNION ALL
SELECT '1000@@@', '10112' Child FROM DUAL UNION ALL
SELECT '1000@@@', '10120' Child FROM DUAL UNION ALL
SELECT '1000@@@', '10121' Child FROM DUAL UNION ALL
SELECT '1000@@@', '10124' Child FROM DUAL UNION ALL
SELECT '1000@@@', '10151' Child FROM DUAL UNION ALL
SELECT '1000@@@', '10152' Child FROM DUAL UNION ALL
SELECT '1000@@@', '10153' Child FROM DUAL UNION ALL
SELECT '1000@@@', '10154' Child FROM DUAL UNION ALL
SELECT '1000@@@', '10155' Child FROM DUAL UNION ALL
SELECT '1000@@@', '10158' Child FROM DUAL UNION ALL
SELECT '1000@@@', '10170' Child FROM DUAL UNION ALL
SELECT '1000@@@', '10171' Child FROM DUAL UNION ALL
SELECT '1000@@@', '10172' Child FROM DUAL UNION ALL
SELECT '1000@@@', '10173' Child FROM DUAL UNION ALL
SELECT '1000@@@', '10174' Child FROM DUAL )
SELECT *
FROM T1
START WITH PARENT = '1000@@@'
CONNECT BY NOCYCLE PARENT = PRIOR PARENT;*009*

Xcelsius Parent/Child SWF Loader with BICS Connections

We have several Xcelsius Dashboards that use BICS connections to retrieve data from BW queries that we'd like to combine into one Parent/Child tabbed dashboard. I can't seem to find solid information on if this is possible using a SWF Loader component due to the BICS requirement of being published through BW Portal and not InfoView. Does anyone have any ideas (short of combining them into one huge dashboard due to the volume of data)? Thanks!

Hi Chris,
I have been working with SWF loader on the SAP portal using the BICS connection type. It was not supported last time I asked about a year ago. However, it can work if you specify the URL in the SWF loader in this way:
http://sapwebdisp.vestas.net:8103/bicsremotebex?SWF=XXX&TIMESTMP=1318867468000
XXX is the name you publish your child dashboard under. Data can be exchanged between the parent and child dashboard by using the custom component "Data sharer" from Inovista which can be downloaded for free:
http://www.inovista.com
Besides the fact that this setup is unsupported there are some limitations so from my point of view it should only be applied under the following conditions:
1. It is not possible to build eveything into a single dashboard.
2. A solution having several independent dashboards does not make sense.
An alternative might be the setup described in note 1526291. The way I understand it, it binds the dashboards together in a similar way as on a BO server with flash variables.
Regards,
Michael

Getting parent-child data from a single column in a table

Hi,
I have a parent-child data in a column.
Eg:
0
00
01
010
011
1
10
11
These values are present in the single column itself. My need is to get the parent values for the given child value.
For eg: If I am giving the input as 011, the query should return all its parents, i.e. 01 and 0
Could you please give me any inputs on this?
Thanks,
GV

Frank Kulash wrote:
Assuming that each child's id is formed by adding exactly one character to the end of its parent's id:
SELECT     id
FROM     table_x
START WITH     id          = :target_id
CONNECT BY     PRIOR id     LIKE id || '_';
Small tweak to yours Frank if it's just the parents that need identifying...
SQL> ed
Wrote file afiedt.buf
1 with t as (select '0' as x from dual union all
2             select '00' from dual union all
3             select '01' from dual union all
4             select '010' from dual union all
5             select '011' from dual union all
6             select '1' from dual union all
7             select '10' from dual union all
8             select '11' from dual)
9 -- end of test data
10 SELECT     x
11 FROM       t, (select '&required' as req from dual) req
12 WHERE x != req.req
13 START WITH x = req.req
14* CONNECT BY PRIOR x LIKE x || '_'
SQL> /
Enter value for required: 011
old 11: FROM   t, (select '&required' as req from dual) req
new 11: FROM   t, (select '011' as req from dual) req
X
01
0
SQL> /
Enter value for required: 11
old 11: FROM   t, (select '&required' as req from dual) req
new 11: FROM   t, (select '11' as req from dual) req
X
1
SQL>

Help needed in retrieving parent child relationship values

Hi,
I have a requirement to get parent child relationship values as below.
Ex: Address table
cont cont_code state state_code
C1 10 S1 1
C1 10 S2 2
C1 10 S3 3
C2 20 S4 4
C2 20 S5 5
C3 30 S6 6
C3 30 S7 7
C3 30 S8 8
I want a result of country/state and corresponding code like below.
corresponding states should be displayed under each country with some space appended to it.
Geography code
C1 10
S1 1
S2 2
S3 3
C2 20
S4 4
S5 5
C3 30
S6 6
S7 7
S8 8
I am using oracle 10g version.
Thanks in advance.

Hi,
When you post formatted text (like your output) on this site, type these 6 characters:
\(small letters only, inside curly brackets) before and after each section of formatted text, to preserve spacing.
I think you're saying that you want this output:GEOGRAPHY CODE
C1 10
S1 1
S2 2
S3 3
C2 20
S4 4
S5 5
C3 30
S6 6
S7 7
S8 8
If so, UNION, as Hoek suggested, is a good way.
GROUP BY ROLLUP is more efficient, but harder to understand:SELECT     CASE
          WHEN GROUPING (state) = 1
          THEN cont
          ELSE ' ' || state
     END          AS geography
,      CASE
          WHEN GROUPING (state) = 1
          THEN MAX (cont_code)
          ELSE MAX (state_code)
     END          AS code
FROM     t
GROUP BY cont
,      ROLLUP (state)
ORDER BY cont
,      state          NULLS FIRST
By the way, this looks like a bad table design.
In a relational database, the fact that the name 'C1' belongs to cont_code 10 should only be stored in one place. You have the same information on 3 separate rows.
Also, if 'C1' and 'S1' are both names, they should probably be in the same column, so that (to give just one example) you can find the information about 'x1' without knowing if it is a cont or a state.
A better design would be.NAME     CODE     PARENT     DSCR
====     ====     ======     ====
C1     10          CONT
S1     1     10     STATE
S2     2     10     STATE
S3     3     10     STATE
C2     20          CONT
S4     4     20     STATE
S5     5     20     STATE
C3     30          CONT
S6     6     30     STATE
S7     7     30     STATE
S8     8     30     STATE
If the data is this simple, then the dscr column isn't needed. Whether parent is NULL or not tells whether the rows represents a cont or a state.
To get the results you want from a table like this, you could use CONNECT BY. Using either UNION or ROLLUP, you have to know, at the time you write the query, how many levels there will be in the parent-child tree, and the length of the code is proportional to that depth, and the table has to be changed if you ever need to add another level. CONNECT BY can handle any number of levels, and the length and complexity of the code is the same whether you have just 2 levels (countries and strates), or 7 levels (continents, regions, countiries, states, districts, cities and neighborhoods) or 72 levels. The table doesn't need any more columns, no matter how deep the tree gets.
Edited by: Frank Kulash on Sep 16, 2010 11:54 AM

Representating Hierarchical (Parent-Child) relation graphically using Swing

Hi,
I have to represent a hierarchical data which is having Parent-Child relation using Swing. I am not able to upload the image overhere, so I am represnting the data in such a way so that one can understand this problem. If anyone knows how to upload image on Sun forum, please let me know it will be great help for me.
Parent Root - A
Child of A - B, C, D
Child of C - E, F, G
Child of F - H
Child of D - J, K
The data needs to be represented in two formats-
1. Tabular Format
I am able to represent data in this format using combination of JTree and JTable. The data is getting represented in tabular format and I am able to expand and collapse the parent nodes to see the childs. The tabular data will look like below structure,
A
I_B
I
I_C
I I_E
I I
I I_F
| I |_H
| I
I I_G
I
I_D
I
I_J
I
I_K
2. Graphical Format
This is the other way in which I need to represent the data. The above shown tabular data needs to represented in graphical form. The end result should look like,
I A I
____________________I__________________________
___I___ __I__ __I__
I B I I C   I I D   I
____________________I____________ ______I________
___I___ __I__ __I__ __I__ ___I__
I E I I F   I I G   I I J   I I   K    I
__I___
I   H   I
Each box representing alphabates will be a component (like JPanel) which will have details about the item to be displayed. The parent and child should be connected with each other using line. This representation should be created at runtime using the hierarchical data. Also the parent and child relations should be expandable/collapsible as they are in JTree.
I am not able to find any component or any solution in Swing which can provide me this graphical representation. It will be great help if anyone can help me out in this.
Thanks in advance.

Sorry for inconvinience for the data representaion in graphical form. I don't know how this get jumblled. Please try to figure out the tabular/graphical representation using pen and paper as forum is not providing any help to upload an image.
Sorry again for inconvinience.
Thanks
Manoj Rai

Parent child relation using query

Hi,
If i pass one parameter as a parent.It will
retrieve all the child and subchild...
but it will be retrieved by one single query.
Is it possible?If possible pls give me an idea.
I got the inner most child using stored procedure and recursive fn.
But I couldnt get the child and subchild using
single query....
pls give an idea
below i gave table for example
Sno     Parent     Child
1     MD     GM
2     GM     Material manager
3     GM     Production manager
4     Production manager     Material staff
5     Material staff     production staff
6     production staff     Material student
7     Material student     production student
if i pass GM as a parent. it will retrieve
material manager and production manager...but it will be worked in single query
Thanks

Hi,
SELECT * FROM t11
START WITH parent='GM'
CONNECT BY PRIOR child=parent
Out put :-
2 GM Material manager
3 GM Production manager
4 Production manager Material staff
5 Material staff production staff
6 production staff Material student
7 Material student production student
Pavan Kumar N

Parent Child relation SQL -

Hi all,
I am trying to write an sql - and the requirement is as below -
Table data contains columns Parent || Child || Summary_Flag
If Child is Parent again to some other Child then Summary Flag is "Y"
e.g. parent || Child || Summary_flag
P1 C1 N
P2 P3 Y
P3 C2 N
This relation exists to four level - .i.e. level to which child can be parent again.
I am trying to write SQL which will give me data in columns - i.e. Parent1||Parent2||Parent3||Parent4||Child.
Pleas help in any possible way.
thanks
Bhushan

hI,
What is your desired output ?
Like this.
P1|C1
P2|P3|C2
SELECT   REGEXP_REPLACE (MAX (res)KEEP (DENSE_RANK LAST ORDER BY lvl),
                        ) res
    FROM (SELECT     PARENT,
                     SYS_CONNECT_BY_PATH (   CASE
                                                WHEN LEVEL = 1
                                                   THEN PARENT
                                             END
                                          || '|'
                                          || CHILD,
                                         ) res,
                     LEVEL lvl
                FROM test_data
               WHERE summary_flag = 'N'
          CONNECT BY PRIOR CHILD = PARENT)
GROUP BY PARENT
SQL> WITH test_data AS
2       (SELECT 'P1' PARENT, 'C1' CHILD, 'N' summary_flag
3          FROM DUAL
4        UNION ALL
5        SELECT 'P2' PARENT, 'P3' CHILD, 'Y' summary_flag
6          FROM DUAL
7        UNION ALL
8        SELECT 'P3' PARENT, 'P4' CHILD, 'Y' summary_flag
9          FROM DUAL
10        UNION ALL
11        SELECT 'P4' PARENT, 'C2' CHILD, 'N' summary_flag
12          FROM DUAL)
13 SELECT   REGEXP_REPLACE (MAX (res)KEEP (DENSE_RANK LAST ORDER BY lvl),
14                           '/'
15                          ) res
16      FROM (SELECT     PARENT,
17                       SYS_CONNECT_BY_PATH (   CASE
18                                                  WHEN LEVEL = 1
19                                                     THEN PARENT
20                                               END
21                                            || '|'
22                                            || CHILD,
23                                            '/'
24                                           ) res,
25                       LEVEL lvl
26                  FROM test_data
27                 WHERE summary_flag = 'N'
28            CONNECT BY PRIOR CHILD = PARENT)
29 GROUP BY PARENT;
RES
P1|C1
P2|P3|P4|C2
SQL> Regards salim.

Incorrect totals from cache with CustomRollupColumn and non-parent-child dimensions

Hello. Before I start let me apologise for my English :)
We have a very complex cube, with 2 (actually more, but only these 2 are important) parent-child dimensions.
One of them has CustomRollupColumn defined.
Not long ago we have decided to make refactoring of our cube. This also included making these dimensions non-parent-child.
All our old reports started to work much faster after that... but we have mentioned that sometimes they show incorrect totals, or no totals at all.
We spend a lot of time trying to figure out what's wrong and finally we had found that if we clear cache before next refresh of the report - the totals are always correct!
If we don't clear cache - we get wrong totals second time, and each next time after that. If we see wrong totals - we could clear cache and get correct totals once again.
If we use "Real Time Olap=True;" connection string parameter - the totals are always correct because cache is not used.
But we don't like this workaround.
Is there any fix for this bug? Google shows that this problem exists from SQL2005, and still we have it :( Also, there is adivice to set CalculationCoverPolicy to 9 - we have tried - but it was fruitless.
And if we revert these 2 dimensions back to parent-child - all working fine again, but as slow as it was before the refactoring :(

Hi Bateks,
Glad to hear that your issue had been solved by yourself, thank you for you sharing which will help other forum members who have the similar issue.
Regards,
Charlie Liao
TechNet Community Support

Simulate 1-N relationship as N-N by using Parent-Child structure

Hi,
i have a 1-N relationship between SKILL and USER tables meaning 1 skill can be applied to several users. A skill can have a parent skill meaning that a ParentSkill inherits all privileges of it's child.
I would like to simulate a N-N relationship between users and skills by building a view which goes through the parent-child relationship... Can this be accomplished by building a view?
Current structure:
|USERID | USERNAME | SKILLID |
+-------+----------+----------+
|   1   | Jack    |      1   |
|   2   | Simon   |      1   |
|   3   | Fred    |      3   |
+-------+----------+----------+
|SKILLID | DESCRIPTION   | PARENTSKILL |
+--------+---------------+--------------+
|   1    | Mechanic     |      2       |
|   2    | Inspector    |      3       |
|   3    | Supervisor   |      null    |
+--------+---------------+--------------+Preferred output (ordering of skillid is not important):
|USERID | USERNAME | SKILLID |
+-------+----------+----------+
|   1   | Jack    |      1   |
|   2   | Simon   |      1   |
|   3   | Fred    |      3   |
|   3   | Fred    |      2   |
|   3   | Fred    |      1   |
+-------+----------+----------+

Hopefully this meets your needs:
WITH
users as
    SELECT 1 as USERID, 'Jack' as USERNAME, 1 as SKILLID FROM DUAL UNION ALL
    SELECT 2 as USERID, 'Simon' as USERNAME, 1 as SKILLID FROM DUAL UNION ALL
    SELECT 3 as USERID, 'Fred' as USERNAME, 3 as SKILLID FROM DUAL
skills as
    SELECT SKILLID,CONNECT_BY_ROOT SKILLID AS ANCESTORS
    FROM
            SELECT 1 as SKILLID, 'Mechanic' as DESCRIPTION, 2 as PARENTSKILL FROM DUAL UNION ALL
            SELECT 2, 'Inspector', 3 FROM DUAL UNION ALL
            SELECT 3, 'Supervisor', NULL FROM DUAL
    CONNECT BY PRIOR PARENTSKILL = SKILLID
SELECT USERID,USERNAME,ANCESTORS
FROM skills, users
WHERE users.skillid = skills.skillid
    USERID USERN ANCESTORS
         1 Jack           1
         2 Simon          1
         3 Fred           3
         3 Fred           2
         3 Fred           1Hope this helps!

SHOW THE PARENT CHILD TABLE RELATIONSHIP TABLE

hi experts,
I want show the parent child relation ship tables
for exmple iam passing the emp table then display related child tables like dept,grade after that again child table(dept,grade) related to child relationship tables like recursive
Regards,
VENKAT

Probably something like below. This may not be exactly what you are looking for, but one way to get what you are asking for.
Only if you can give specifics, of your Input being passed and the Output, it might be possible to provide more help. But you also need to help us with your best effort on this.
select *
from (
        select prior table_name Child, table_name Parent
          from user_constraints
         start with constraint_name = some_constraint_name_of_Parent_Table
        connect by constraint_name = prior r_constraint_name
       ) a
where a.child is not null;

Parent - child tables foreign key relation ship

Hi All,
we have 600 hundred tables ..i would like to print a hierarchial tree based on the foreigh key relathionship
i tried my best but i couldnt.
parent table
child table 1
childtable3
child table 2
and so
Can somebody help me out with a query?
Thanks,
kt

CREATE OR REPLACE FUNCTION get_child_tables (
ptable VARCHAR2,
powner VARCHAR2 DEFAULT 'SCOTT',
plevel NUMBER DEFAULT 10
RETURN stringarray
-- -- create this ON SQL*PLUS "CREATE OR REPLACE TYPE STRINGARRAY AS TABLE OF VARCHAR2(50);"
-- AUTHID CURRENT_USER
PIPELINED
AUTHOR DATE VERSION COMMENTS
======================================================================================
[email protected] 26-OCT-2009 1.0 Developed to ease developers effort to find Nth level of Referential integrity
======================================================================================
-- PURPOSE -> To find PARENT=> CHILD relational TABLE(S) in Oracle upto a depth max N Level.
--SYNTAX TO USE
SELECT * FROM TABLE( get_child_tables('DEPT','SCOTT',3)); Store this query in a file for your use
SELECT * FROM TABLE( get_child_tables('EMPLOYEE')); Store this query in a file for your use
-- RESULTS looks as below
--1 => DEPT
--2 => EMP
--2 => EMP2
--3 => EMP_CHILD
--3 => EMP2_CHILD
-- and so on
--This can be leveraged to use in any oracle database REGION 10g having and above.
--This FUNCTION gives formatted result of the Oracle 10g Hierarchical query result coded in the cursor
--to find MASTER => CHILD relational TABLE(S) upto a depth max 10 Level.
--The result of the PIPELINED function can be retrieved using Oracle new operator
--TABLE(array name) in SQL query.
--Due to the AUTHID CURRENT_USER compiler directive any user can use based on his/her access privileges on the database.
--GRANT EXECUTE ON SCOTT.get_child_tables TO PUBLIC;
--CREATE OR REPLACE PUBLIC SYNONYM get_child_tables FOR SCOTT.get_child_tables;
IS
atname stringarray := stringarray ();
-- create this ON SQL*PLUS CREATE OR REPLACE TYPE STRINGARRAY AS TABLE OF VARCHAR2(50);
vlevel NUMBER;
vtname VARCHAR2 (50);
nindex NUMBER := 0;
bprocessed BOOLEAN := FALSE;
CURSOR c1 (powner_in IN VARCHAR2, ptable_in VARCHAR2, plevel_in NUMBER)
IS
SELECT LEVEL, LPAD (' ', (LEVEL - 1) * 2, ' ') || pt AS "TNAME"
FROM (SELECT a.owner w1, a.table_name pt, a.constraint_name c1,
a.r_constraint_name r1, b.owner w2, b.table_name ct,
b.constraint_name c2, b.r_constraint_name r2
FROM all_constraints a, all_constraints b
WHERE a.constraint_name = b.r_constraint_name(+)
AND a.owner = b.owner(+)
AND a.owner =
UPPER (powner)
-- Change Owner here while testing
--AND A.r_constraint_name IS NULL
AND a.constraint_type IN ('P', 'R')) v1
START WITH pt =
UPPER
(ptable)
-- Change your master table here while testing the QUERY
CONNECT BY PRIOR ct = pt AND LEVEL <= plevel;
-- Change lavel here while testing
BEGIN
atname.EXTEND;
atname (1) := 'NOTHING';
OPEN c1 (powner, ptable, plevel);
LOOP
bprocessed := FALSE;
FETCH c1
INTO vlevel, vtname;
IF nindex > 1 AND atname (atname.LAST - 1) = vtname
THEN
--DBMS_OUTPUT.PUT_LINE('2 ==== vtname ' ||vtname || ' '|| atname.count|| ' '||atname.last || ' '||atname( atname.last-1));
bprocessed := TRUE;
END IF;
IF NOT bprocessed
THEN
nindex := nindex + 1;
atname.EXTEND;
atname (nindex) := vtname;
PIPE ROW (vlevel || ' => ' || vtname);
DBMS_OUTPUT.put_line ( ' **** nindex - atname( nindex) '
|| nindex
|| ' - '
|| atname (nindex)
DLOG('ADDING ',vTname); A LOGGING ATONOMUS PROCEDURE FOR DEBUG PURPOSE
END IF;
EXIT WHEN c1%NOTFOUND;
END LOOP;
CLOSE c1;
FOR i IN 1 .. atname.COUNT
LOOP
DBMS_OUTPUT.PUT_LINE('atname (i) ' ||atname (i));
END LOOP;
RETURN;
EXCEPTION
WHEN no_data_needed
THEN -- THIS EXCEPTION HAS TO BE THERE TO GET THE FUCTION WORKABLE
DBMS_OUTPUT.put_line (SQLERRM);
RETURN;
END get_child_tables;
/

Script populate parent-child hierarchy not running

Hallo guys
I have problem when running script populate Parent-Child Relationship Table.
Here is the script.I don't even change the script.just run it in PL/SQL
declare
v_max_depth integer;
v_stmt varchar2(32000);
i integer;
begin
select max(level) into v_max_depth
from V_D_BRANCH
connect by prior BRANCH_KEY=PARENT_BRANCH_KEY
start with PARENT_BRANCH_KEY is null;
v_stmt := 'insert into DM_ANALYTICS.BRANCH_HIERARCHY (MEMBER_KEY, ANCESTOR_KEY, DISTANCE, IS_LEAF)
            select BRANCH_KEY as member_key, null, null, 0 from V_D_BRANCH where PARENT_BRANCH_KEY is null
            union all
            select member_key,
            replace(replace(ancestor_key,''\p'', ''|''), ''\'', ''\'') as ancestor_key,
            case when depth is null then 0
            else max(depth) over (partition by member_key) - depth + 1
            end as distance, is_leaf
from
select member_key,depth,
case     when depth is null then '' || member_key
when instr(hier_path, ''|'', 1, depth + 1) = 0 then null
   else substr(hier_path, instr(hier_path, ''|'', 1, depth) + 1, instr(hier_path, ''|'', 1, depth + 1) - instr(hier_path, ''|'', 1, depth) - 1)
end ancestor_key,
is_leaf
from
    (    select BRANCH_KEY as member_key, PARENT_BRANCH_KEY as ancestor_key, sys_connect_by_path(replace(replace(BRANCH_KEY, ''\'', ''\''), ''|'', ''\p''), ''|'') as hier_path,
      case when BRANCH_KEY in (select PARENT_BRANCH_KEY from V_D_BRANCH ) then 0 else 1 end as IS_LEAF
from V_D_BRANCH
connect by prior BRANCH_KEY = PARENT_BRANCH_KEY
start with PARENT_BRANCH_KEY is null
( select null as depth from dual;
for i in 1..v_max_depth - 1 loop
v_stmt := v_stmt || union all select '' || i || '' from dual;
end loop;
v_stmt := v_stmt || ) )
where ancestor_key is not null;
execute immediate v_stmt;
end;
but I got errors like following:
Error report -
ORA-06550: line 19, column 12:
PLS-00103: Encountered the symbol "insert into DM_ANALYTICS.BRANCH_HIERARCHY (MEMBER_KEY, ANCESTOR_" when expecting one of the following:
   ( - + case mod new not null <an identifier>
   <a double-quoted delimited-identifier> <a bind variable>
   continue avg count current exists max min prior sql stddev
   sum variance execute forall merge time timestamp interval
   date <a string literal with character set specification>
   <a number> <a single-quoted SQL string> pipe
   <an alternatively-quoted string
06550. 00000 - "line %s, column %s:\n%s"
*Cause:    Usually a PL/SQL compilation error.
*Action:
what should I do guys?any idea,any solution would be appreciated.thanks alot guys

956850 wrote:
hi,
i tried making "Dimension with Parent-Child Hierarchy" as described in your tutorials.
i finished with the admin tool and database changes and with no errors.
when trying to create a new answer, by only puting the hierarchy column in the answer.
the result show "no result" exist.
i am not sure what i am doing wrong. maybe you can point me to the problem?
thanks
Mirit.Hi Mirit,
What is the table that you created hierarchy on?
Which column in the hierarchy you pulled into your reports to see the No Result message?
Please query the table and see if has data.
Thanks,
G. SK

No Results after build a Parent-Child Hierarchy in OBIEE11G

Hi All:
Here's an problem. I followed the "http://sandybi.wordpress.com/2010/08/17/hierarchies-in-obiee-11g-part-1/" this article step by step to create a parent-child hierarchy in admin tool in OBIEE11G.
But after check in and try to retrieve the hierarchy data in Answer. There's always displays "No Results."
Is there any suggestions for this ? Really urgent and thanks for your help.
Best regards
Sunny

@Aketi
It is One way that We derive
"sys_connect_by_path(RowIDToChar(RowID),'.') as
RowIDList"
Then
We use Left Join Using
"instr(RowIDList,RowIDToChar(RowID))".sorry, didn't catch what you mean.
my site :-)
http://oraclesqlpuzzle.hp.infoseek.co.jp/4-13.html
pity, I don't know Japanese :(
@Rob
your query is good and simple :) probably it's the best alternative for the OP.
But it won't work with not a plain hierarchy, e.g.:
      1
    2   3
      4
    5   6
SQL> create table hierarchy (child,parent)
2     as
3     select 1, null from dual union all
4     select 2, 1 from dual union all
5     select 3, 1 from dual union all
6     select 4, 3 from dual union all
7     select 4, 2 from dual union all
8     select 5, 4 from dual union all
9     select 6, 4 from dual
10 /
Table created
SQL>
SQL> create table data (hierarchyid,value)
2    as
3    select 5, 10 from dual union all
4    select 6, 25 from dual
5 /
Table created
SQL>
SQL> select h.child
2           , sum(connect_by_root d.value)
3        from hierarchy h
4           , data d
5       where h.child = d.hierarchyid (+)
6     connect by prior h.parent = h.child
7       group by h.child
8       order by h.child
9 /
     CHILD SUM(CONNECT_BY_ROOTD.VALUE)
         1                          70
         2                          35
         3                          35
         4                          70
         5                          10
         6                          25
6 rows selected
SQL>

Graphs and parent-child with loops and duplicates

There is a parent-child relation in the table t(prnt, chld) which allows duplicates (A->B, A->B) and opposite paths (A->B, B->A), and complicated loops. Is there a way to identify rows that form any separate "connections network" and assign a "name" to them of any kind (letter, number, wahtever)? I try to use WITH recursive clause to identify and group rows belonging to one graph but with no luck. Any help would be appreciated.
thank you

Frank, I posted inputs for all graphs (multiple inserts) and some allowable outputs for one graph. For all cases (ie. graphs) the rule is the same:
1. identify all nodes belonging to a graph
2. "name" that graph (min, max or whatever you like)
3. print the output in the form (node_belonging_to_a_graph, name_of_the_graph) for all identified graphs
And as you said, I am somewhat flexible. I don't want to constrain the problem with saying min, max because it's not important how you name it, but the way which is somehow natural and fits with requirements is the usage of nodes' values.
You ask me if (1,1),(2,1),(3,1) is also OK as an output for sample graph (1,2)+(2,3). Yes it is. It is one of those I posted but with additional node which is chosen as a name for a graph. But as you can guess it doesn't matter which node you choose, and the additional information about a node named with its own name is not as important and the information that all other nodes are named with that name but it is 100% acceptable. If you changed the naming convention and started to use letters instead of node values then yes, it would be a must to have the output in the form (1,a),(2,a),(3,a).
You also ask me about the result for 90x data inserted as 5 rows: (901,902)..(906,904) and present sample result:
901 902
905 902
906 902
And the answer is no, it is not good result. It misses the information about the nodes 904 and 903 which belong to this graph too. The correct result could be:
901 902
905 902
906 902
903 902
904 902
or any other "combination" which presents 5 nodes with the name of the sixth (in this case of 6-node graph). Just one have to be picked, it doesn't matter which one. The "vertical" order is also irrelevant.
As you can see there is a lot of room that gives acceptable result. I don't want to constraint it because it can influence performance which is important when dealing with graph structures in relational databases (RDBMS are not predestined to easily cope with that sort of information). It can also influence the chosen algorithm and I'd like to pick the fastest one which gives acceptable result.
Two numbers x and y are in the same group (graph) if (and only if) at least one of the following is true:
(1) they appear on the same row together (it doesn't matter which number is in which of the 2 columns), or
--(2) x appears on the same row with a third number, z, and z is in the same group as y--
(2) there are other edges (entries) in the table that form a "path" from x to y. And because the direction of the path is not important for the problem (ie. the parent-child table structure can be forgotten for a moment), the path means "there exists connection" between x and y aka "you can walk from x to y".
The output consists of 2 columns: id (which is unique in the result set) and grp (which identifies the group) *[correct]*
The id column will always be one of the numbers in the group *[correct]*
It doesn't matter what the grp column is, or even what data type, as long as it distinguishes between the different groups. *[correct, but as you noted using one, picked number from a graph is the prefferable way]*
If there are N distinct numbers in the group, I need N rows of output for that group, with id showing all those distinct numbers. *[correct, but if you choose your naming convention as naming a graph with the value of the node belonging to it you can ommit the node which is named for itself (but it doesn't hurt is such row appear in the result)]*
You ask me if the graph is directed. No it's not. Your example (x,y) and (y,x) is great, and it can be concluded from my first post when I say that "opposite paths" (A->B, B->A) exists. What matters is the connection between the nodes. The parent-child table somehow imposes that direction is important, but for this problem it is not.
One of the motivations for my post is to know what other people think without affecting their minds with my approach. I don't want to skew anybody's mind into my solution which works, but it's not effective. I don't mind showing it but I kindly ask you to think about the problem before I post it. Diversity of approaches helps to distill the best one.
As I said I did it with the usage of sys_connect_by_path. If it doesn't appear to you as possible usage then it is likely that I don't use it efficiently. Please understand, I will post it if you ask me one more time but if you can live for a while without my inefficient solution and suggest something with WITH clause I would appreciate it.
There is no exact result I expect. There are many results which are correct and acceptable. They all must follow the rules described at the beginning.
Thank you
Edited by: 943276 on Jun 28, 2012 1:32 AM

Connect By Parent Child

Similar Messages

Maybe you are looking for