Lists Home |
Date Index |
Hunsberger, Peter wrote:
> One of my vague long term projects is to look at ways of building and
> utilizing a sort of PSVI database. (Binary XML that never leaves the
> building...) Essentially we have a large project that reuses (and
> reuses) various XML fragments from many different sources in many
> different combinations many times (controlled by some small number of
> parameters). Think of this as a cache of parsed XML that can
> subsequently be consumed by XSLT transforms. On occasion some portions
> of this cache will be invalidated and replaced.
> So the question becomes; do you think any of this work could form a
> basis for such a database? Would it be efficient to parse XML to this
> format, then feed (multiple chained) XSLT transforms from this format?
bInfosets are often good at fragments, as it is frequently one of the
requirements (you can use a possibly typed fragment directly, without needing to
transfer namespace context and the such onto it).
Dynamic update for instance would send only the fragments of the document
required for its update. Random access would typically use some sort indexing or
seeking to access fragments quickly in a document (possibly using XPath, which
makes the whole thing like a database in ways).
However, the question of whether you'd gain anything from this depends on where
you spend time. Building a PSVi from scratch can be costly, but I'm unsure how
that compares with a bunch of XSLT transforms right after it. You will save some
amount of time, but it might not be measurable wrt your entire application.
Robin Berjon <firstname.lastname@example.org>
Research Engineer, Expway http://expway.fr/
7FC0 6F5F D864 EFB8 08CE 8E74 58E6 D5DB 4889 2488