home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!pipex!bnr.co.uk!uknet!devonuk!usenet
- From: don@duncan (Don Radvan)
- Newsgroups: comp.databases
- Subject: Hierarchical Structures in RDBMS
- Keywords: hierarchical
- Message-ID: <1993Jan6.094340.5870@devon.co.uk>
- Date: 6 Jan 93 09:43:40 GMT
- Sender: usenet@devon.co.uk (Mr. USENET)
- Organization: Devon Systems International
- Lines: 40
- Nntp-Posting-Host: duncan
-
-
- I have an interesting problem. I need to represent hierarchical data
- structures within a relational db, but I need to do it in a way that
- permits the user to create his own hierarchy. That is, I do not know the
- structure of the hierarchy before hand.
-
- For example:
- A user wants to organize various objects. These objects will
- appear as leaf nodes in the user's own hierarchy. The user may choose many
- different ways of organizing these objects, indeed, s/he may have many
- simultaneous hierarchies of organization for each set of objects. What
- results is a sort of directory tree. Each directory is a category of
- objects and each "file" or non-directory entry in a directory is an
- object. Given the objects of apples and oranges, we may get the following:
-
- Stuff
- |
- --------------------------------
- Food Non-Food
- |
- ---------------------- . . .
- Fruit Veggies
- |
- -------------
- Apples Oranges
-
- And so when s/he does a query such as the following:
- select name where Food = "Fruit"
- or
- select name where Stuff = "Food" AND Food = "Fruit"
-
- we would get Apples and Oranges.
-
- Any thoughts would be appreciated. Please reply by email.
-
- --
- Don Radvan # Devon Systems International
- +44 071 499 8381 # 14 Old Park Lane Wedding Bells
- don@devon.co.uk # London W1Y 3LH UK in March
- NeXTmail friendly # "Betwixt Hyde and Green"
-