Cart
[Home] [By Thread] [By Date] [Recent Entries]
A simple caching algorithm could be constructed by building an intermediate files from the input document. The first pass would convert the XML file into a serialized DOM including the offsets necessary for random access. This wouldn't take much memory. The XSLT processor would be given what looks like an in memory DOM. As node are accessed randomly they would be read out of the intermediate file using the offset data and random file reads. An LRU cache in memory would make things efficient. A PI could even be added to the document to indicate that it is too large and the caching scheme needs to be used. Jon Smirl jonsmirl@m... *************************************************************************** This is xml-dev, the mailing list for XML developers. To unsubscribe, mailto:majordomo@x...&BODY=unsubscribe%20xml-dev List archives are available at http://xml.org/archives/xml-dev/ ***************************************************************************
|
