SQL & PL/SQL

Hi all,

I have a table where parent IDs, Child Ids and descriptions will be stored. I need to write a query (input value is Parent ID) to get all possible unique longest hierarchical paths where path starts from parent ID (some thing like 2300.2306.2308.2312. ect...).

I have tried it using SYS_CONNECT_BY_PATH. But, I got duplicates of the paths....

Please help me in this regards. Let me know if you need further information

Also please share important link where below topics have been explained clearly.

1. sys_connect_by_path

2. connect_by_root

3. connect_by_is_leaf

4. connect_by_iscycle

Thanks and regards,
Kumar