W3C home > Mailing lists > Public > www-xml-schema-comments@w3.org > October to December 2000

[www-xml-schema-comments] <none>

From: Prosi, Rainer 4620 PPE-WT <Rainer.Prosi@de.heidelberg.com>
Date: Mon, 16 Oct 2000 08:45:50 +0200
Message-ID: <1F41768842F3D311A5DA0000D11E5E9875882B@kiems02.ger05.heidelberg.com>
To: "'www-xml-schema-comments@w3.org'" <www-xml-schema-comments@w3.org>
Hello All;

I am currently designing a specification for describing jobs in the print
industry (JDF - job definition format) that uses a hierarchical data model
that, in 
shorthand, looks like this:
  <Audits ?>
  <Customer ?>
  <Resources ?>
  <Links ?>
 The ordering of the elements is irrelevant, and since the data is supposed
to be modified by  various processors, which may append additional 
elements, it would be very convenient not to enforce any ordering, since the
ordering has no semantic value.
If no ordering is enforced, all you have to do is e.g:

DOM_Node links=JDF.GetNode("Links")
if customer.isNull() links=JDF.AppendNode("Links")

instead of writing of a loop that searches all predecessor children for the
last valid predecessor. IMO it is evident, that enforced ordering is an 
unnecessary burden in this case.

The other schema validable alternative is to define a child pool that
contains  multiple JDF childre e.g:
  <Audits ?>
  <Customer ?>
  <Resources ?>
  <Links ?>
  <JDFPool ?>

This is possible but seams to be a very formalistic solution to a problem
that can be solved simply by telling an XML Schema element that the ordering

of its children is arbitrary.

As a conclusion, I agree with Ivan, Michael and Martin that a construct that
allows unbounded elements in arbitrary ordering is desirable.


Rainer Prosi
Heidelberger Druckmaschinen AG
Received on Monday, 16 October 2000 02:46:00 UTC

This archive was generated by hypermail 2.3.1 : Wednesday, 7 January 2015 14:49:53 UTC