Nelson Goforth wrote:
>
> Given a group of people - in which some people are subordinate to others
> - how can I best store that information and then retrieve it so that the
> relationship information is clear and so that relationships can be
> easily changed (i.e. one person is promoted).
This is really more of a SQL theory question than a DBI question. I
suggest you get Joe Celko's _SQL_For_Smarties_ (Morgan Kaufamn 2000) and
read his chapters on the adjacency list model and the nested sets model.
The usenet newsgroup comp.databases.theory also discusses this
fairly regularly and you can see a lot of material from Joe and others
by looking through its archives.
--
Jeff
