Re: Mysql Hierarchial Query
Rows 1-3 is a 3-node tree; rows 4-5 is a 2-node network that doesn't connect to the tree.
When a table must hold multiple graphs, it's much more efficient to give each graph an ID than to try to discover with SQL alone which graphs exist in the table.
Subject
Written By
Posted
November 22, 2014 03:30AM
November 22, 2014 09:47AM
November 22, 2014 12:09PM
Re: Mysql Hierarchial Query
November 22, 2014 12:48PM
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.