I'm working on the implementation of keys in Xslt processor.
I'd like to demonstrate how index are useful, and find a way to propagate index
through several transformations. It could be interessant to use an external
index declaration, which could be modified and re-used.
I have done some tests : Saxon is really faster than Xalan.
I know that they are two different tree implementations in Saxon.
The use of tinytree seems to decrease the performance whereas results are really
"good" with tree implementation.
Are Key's implementation different?
If you have further information on this theme...
Inria Rhone Alpes
XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list