Lists Home |
Date Index |
Very often the network model has one or more 'natural' hierarchies within it
which are readily discovered if the edges are suitably qualified. Looking
for the edges which represent whole-part relations will often do the trick,
although sometimes a node may look to be part of more than one whole. In
such a circumstance one may need to resort to differentiating between 'weak'
and 'strong' aggregation or decide that there is more than one hierarchy or
arbitrarily 'break' one of the edges. Obviously for this kind of technique
to work it is necessary to have an understanding of the underlying nature of
the relations represented in the model.
From: Michael Kay [mailto:firstname.lastname@example.org]
Sent: 26 August 2003 09:15
To: 'Murali Mani'; email@example.com
Subject: RE: [xml-dev] A standard approach to glueing together
reusableXML fragments in prose?
Data that is sent from A to B has to be encoded as a
sequence of bits, and hierarchies lend themselves well to such
serialization. This absolutely gives you a design challenge because the
models that you get from your data analysis are graphs rather than
trees. We certainly need a much more mature understanding of the
methodology of translating between the graph object models that come out
of data analysis and the hierarchic representation of these models as
XML, and I would love to see something that gives you the ability to get
multiple hierarchic XML views over the same network data model.