The standard way to take care of this is a self-referencing table, and a
recursive function to bust them out.
ID|Parent_ID
Top levels have an id of 0, and the other rows work well with an autonumber
in the id.
If children can have multiple parents, as in a BOM(Bill of Materials)
problem, you'll need two tables of course.
-----Original Message-----
From: Brook Davies [mailto:[EMAIL PROTECTED]]
Sent: Tuesday, June 20, 2000 6:42 PM
To: [EMAIL PROTECTED]
Subject: Database Design Question
I have listings that look like:
1.0 foobars
1.1 foobars the revenge
1.1.2 foobars the revenge II
1.1.2.1 more foobar specials
2.0 brown foobars
3.0 green foobars
etc..
What is the best DB design in terms of performance for a classification
system like this?
Thanks,
Brook Davies
MaracasMedia Inc.
----------------------------------------------------------------------------
--
Archives: http://www.eGroups.com/list/cf-talk
To Unsubscribe visit
http://www.houseoffusion.com/index.cfm?sidebar=lists&body=lists/cf_talk or
send a message to [EMAIL PROTECTED] with 'unsubscribe' in
the body.
------------------------------------------------------------------------------
Archives: http://www.eGroups.com/list/cf-talk
To Unsubscribe visit
http://www.houseoffusion.com/index.cfm?sidebar=lists&body=lists/cf_talk or send a
message to [EMAIL PROTECTED] with 'unsubscribe' in the body.
