> > That is ONE way to store a tree structure :-) > > > Another would be: > > > ITEMS > > (ItemID INT AUTO_INCREMENT PRIMARY KEY NOT NULL, > > other stuff) > > > ITEM_PARENT > > (ItemID int, > > ParentID int > > primary key (ItemID, ParentID) > > ) > > > > I prefer the latter. > > The latter is not a tree, but a directed graph.
A rooted tree is a special kind of directed graph. Besides, I wonder if you can fully store a graph in these tables (with the PK and all) With regards, Martijn Tonies Database Workbench - developer tool for InterBase, Firebird, MySQL & MS SQL Server. Upscene Productions http://www.upscene.com -- MySQL General Mailing List For list archives: http://lists.mysql.com/mysql To unsubscribe: http://lists.mysql.com/[EMAIL PROTECTED]
