[
Lists Home |
Date Index |
Thread Index
]
I have been doing some work with a binary encoding of
something akin to a serialisation of SAX events as
generated from an XPath object model. I thought it might be
an interesting exercise to try and quantify the performance
penalty of applying well-formed constraints to this
encoding.
I have a small list of constraints that need to be added
which are not implicitly guaranteed by this encoding. Just
wondering if anybody can think of any others I should be
looking at that would not typically be for free as part of
this type of binary encoding.
Only one top-level element
All character data in correct ranges
Names on elements, attributes and pi target are valid
Attribute names are unique over an element
Comments do not contain '--'
PI data does not contain '?>'
If I can get some usefull datapoints out of this I will post
them to the list.
Thanks,
Kev.
|
