I wanted to add that if you're using Oracle,
it natively supports recursive queries without
resorting to a recursive or looping function.
I don't remember the syntax (I'm working with
SQLServer now and don't have any Oracle
references at hand), but you can write what
is basically a standard SQL statement with an
additional clause or two, and it will recurse
down through the layers of data. You do have
to add a calculated field to determine what
your nesting level is, but it's pretty easy.
Good luck!
-----Original Message-----
From: Brook Davies [mailto:[EMAIL PROTECTED]]
Sent: Tuesday, June 20, 2000 7: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.
