[
Lists Home |
Date Index |
Thread Index
]
Bob Wyman wrote:
> However, one can easily
> produce a single ASN.1 schema that is capable of encoding any
> XML data in such a way that the original XML can be
> reconstructed without reference to any other schema.
> In other words, one can easily use ASN.1 to define an
> equivalent of the encoding discussed in Dennis M. Sosnoski's
> presentation to the Binary XML Workshop. Sosnoski's XBIS
> appears to be a serialization of a SAX2 event stream coupled
> with a symbol table that allows compression of strings used
> more than once. (i.e. strings are replaced by compact
> "handles" which are indexes into the symbol
> table.) The same can be described quite easily in ASN.1.
This is precisely the subject of one of the sections of the forthcoming
X.695 standard on "Fast Web Services" (the "ASN.1 shema for the XML
Infoset"). OSS Nokalva's position paper for the September W3C workshop
included a discussion of the "ASN.1 shema for the XML Infoset" (*)
In this ASN.1 schema (that is to be encoded in PER), strings are gathered in
a string table and referenced by index. Strings are *not* encoded as binary
integers etc., because the "ASN.1 shema for the Infoset" is a pure
representation of the Infoset and is schema-agnostic.
Alessandro Triglia
(*)
http://www.w3.org/2003/08/binary-interchange-workshop/32-OSS-Nokalva-Positio
n-Paper-updated.pdf - Section 3
|
