That seems to be the support of a tree (a “forest” actually as you can have multiple root nodes) …. in such a way that a root is a node that reference itself <- ID == ref_id; something like the nested-type comments of a blog; is it??
If that is the case, ID should be the only PK. Or whatever…
Well, some gods work in misterious ways!!
A consultant from Mind Tree Inc., had instructed me to design the table this way. As a Tech Lead of an organization have rejected the instruction since it becomes very hard to read and is time consuming during search
That seems to be the support of a tree (a “forest” actually as you can have multiple root nodes) …. in such a way that a root is a node that reference itself <- ID == ref_id; something like the nested-type comments of a blog; is it??
If that is the case, ID should be the only PK. Or whatever…
Well, some gods work in misterious ways!!
A consultant from Mind Tree Inc., had instructed me to design the table this way. As a Tech Lead of an organization have rejected the instruction since it becomes very hard to read and is time consuming during search