Re: Hierarchical data models

From: Nilone <reaanb_at_gmail.com>
Date: Sun, 16 Aug 2009 13:21:17 -0700 (PDT)
Message-ID: <38217203-721e-4aa5-a04a-cc4ff083fd26_at_a13g2000yqc.googlegroups.com>


On Aug 16, 7:16 pm, Tegiri Nenashi <tegirinena..._at_gmail.com> wrote:
> On Aug 16, 3:09 am, Nilone <rea..._at_gmail.com> wrote:
>
> > It seems to me that these organizational structures can be modeled as
> > trees where every node is typed and every node can have children, but
> > the parent/child relationship is not an attribute of the type of the
> > parent.  The entire tree forms a domain such that valid values of the
> > domain are paths from the root of the tree to any leaf.
>
> > If you take the types and values of the nodes through which such a
> > path passes / is constructed, you get something that looks like a
> > tuple, except that the presence of certain attributes depends on the
> > values of other attributes.
>
> > I see some resemblance to parsing regular expressions.
>
> That would be XML -- a robust and well established data model applied
> universally to any problem.

XML can represent it, yes. I'll investigate further in this direction.

>
> So are you looking into theory of parsing? This one has been developed
> in little to none database context, of course. Or is it transitive-
> like query of binary relation in database context (http://
> en.wikipedia.org/wiki/Hierarchical_model)?

I'm not focused on one specific topic. This week, I had to try to model addresses for a new project, hence the post. In general, I'm interested in such topics as systems theory, types and classification, abstraction, programming paradigms, and models of computation. Received on Sun Aug 16 2009 - 22:21:17 CEST

Original text of this message