I do not think Oracle will ever desupport CONNECT BY PRIOR, do not fear.

 

Could you describe the exact table APP_BRANCH that you are running this query against? I can see no apparent reason why your query should not work.

The Recursive Sub Query Equivalent would be something like:

with branches(id, parent_id, branch_label) as
( select branch_id id
,      parent_id parent_id
,      branch_name branch_label
from   app_branch
union all
select a.branch_id id
,      a.parent_id parent_id
,      a.branch_name branch_label
from   app_branch a
join
branches b
on (a.parent_id = b.id)
)
select *
from   branches

(assuming a table definition such as:

create table app_branch
( parent_id number(5)
, branch_id number(5) not null primary key
, branch_name varchar2(100)
)

)

 

Lucas

SELECT BRANCH_NAME FROM APP_BRANCH START WITH BRANCH_ID = ? CONNECT BY PRIOR PARENT_ID = BRANCH_ID

Error: ORA-00976: Specified pseudocolumn or operator not allowed here
Any pointers or help appreciated. Also, what could be an alternative ANSI query?

Abhilesh

Lucas

If you take a look at my response to Adamp, that may already give you your answer. Nodes will not be revisited. However, that may mean you will not have the data you need. Could you please send me DDL scripts for your table structure and the query you would be using with CONNECT BY if that would work? Then I can take a closer look at what you are exactly asking for.

Lucas

It does have a similar protection against endless loops – through the construction:

 

CYCLE name SET is_cycle TO ‘Y’ DEFAULT ‘N’

When a node is encountered for the second time, it will be included  in the result set, its column value IS_CYCLE (a new column I am introducing with the statement above) is set to Y and the recursion stops then and there – so there will not be a second iteration starting at this node. Note however that any node where a cycle starts is included in the result set twice.

 

Lucas