[
Lists Home |
Date Index |
Thread Index
]
- From: "Jon Smirl" <jonsmirl@mediaone.net>
- To: "Xml-Dev" <xml-dev@xml.org>
- Date: Mon, 27 Mar 2000 11:04:27 -0500
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@mediaone.net
***************************************************************************
This is xml-dev, the mailing list for XML developers.
To unsubscribe, mailto:majordomo@xml.org&BODY=unsubscribe%20xml-dev
List archives are available at http://xml.org/archives/xml-dev/
***************************************************************************
|
