MySQL Forums
Forum List  »  Performance

query on tree structure
Posted by: prashant chaudhari
Date: July 14, 2005 07:39PM

Hi,

If the table having two columns "child" and "parent" which stores a tree structure elements. for example:

A

B1 B2 B3

C1 C2

then table will have
B1 A
B2 A
B3 A
C1 B2
C2 B2 and so on...

can you help me to write an optimized query/queres for this, which will return all childs under specificed parent.

thanks in adv.

Options: ReplyQuote


Subject
Views
Written By
Posted
query on tree structure
7820
July 14, 2005 07:39PM
3297
July 15, 2005 03:23AM


Sorry, you can't reply to this topic. It has been closed.

Content reproduced on this site is the property of the respective copyright holders. It is not reviewed in advance by Oracle and does not necessarily represent the opinion of Oracle or any other party.