W3C home > Mailing lists > Public > xmlschema-dev@w3.org > May 2007

Re: Defining recursive elements?

From: Henry S. Thompson <ht@inf.ed.ac.uk>
Date: Mon, 21 May 2007 11:53:29 +0100
To: Boris Kolpackov <boris@codesynthesis.com>
Cc: Pete Cordell <petexmldev@tech-know-ware.com>, xmlschema-dev@w3.org
Message-ID: <f5bk5v2o3bq.fsf@hildegard.inf.ed.ac.uk>

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

Boris Kolpackov writes:

> Any studies to support these numbers? I just did a quick check over
> a bunch of real-world schemas in our repository. Out of 18 schemas,
> 7 are "unqualified" (~40%) and 11 are "qualified" (~60%).


In my collection of schema documents, I find

   753 qualified
   220 [not specified, defaults to unqualfied]
    49 unqualified

ht
- -- 
 Henry S. Thompson, HCRC Language Technology Group, University of Edinburgh
                     Half-time member of W3C Team
    2 Buccleuch Place, Edinburgh EH8 9LW, SCOTLAND -- (44) 131 650-4440
            Fax: (44) 131 650-4587, e-mail: ht@inf.ed.ac.uk
                   URL: http://www.ltg.ed.ac.uk/~ht/
[mail really from me _always_ has this .sig -- mail without it is forged spam]
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.2.6 (GNU/Linux)

iD8DBQFGUXopkjnJixAXWBoRAgDzAJ0QB6OWfJyf0ZZ4BHDiXGQuP1U0wQCdH5XQ
00wiF2peR7r20A1j13JrEZo=
=WWCb
-----END PGP SIGNATURE-----
Received on Monday, 21 May 2007 10:53:35 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Tuesday, 11 January 2011 00:14:59 GMT