Subject: Re: [xsl] Word Ladders as an example of a "Find shortest path between two nodes in a graph" problem From: Michael Kay <mike@xxxxxxxxxxxx> Date: Wed, 28 Nov 2012 19:35:26 +0000 |
No, it's extremely common. In fact, very much larger factors than this are possible. Sometimes Saxon-EE runs 1000 times faster than Saxon-HE. This effect is normal with declarative languages where powerful optimizations are deployed - SQL users will be very familiar with the effect.The fact that one XSLT program runs three times faster on one XSLT implementation than on another one is strange, *very* strange.
I think the attempt to run it with 6.4 was an error; the figures reported were on 9.x for some recent x.But is Saxon 6.4 the "dernier cri"? I'd very much like to hear Michael Kay's opinion on this.
I disagree. I think nearly all algorithms are viable in XSLT; its limitations are that it's specialized towards handling XML as its data structure, so some data structures don't lend themselves well to XSLT processing.
As an aside, I'd like to say that neither DN's nor WL's solution is something that should be used if this problem (i.e., shortest path) should ever need a solution. I think that this isn't something that should be solved in XSLT at all, except as an academic exercise. (Feel free to disagree - I'll not reply to anything contradicting me.)
Michael Kay Saxonica
Current Thread |
---|
|
<- Previous | Index | Next -> |
---|---|---|
Re: [xsl] Word Ladders as an exampl, Wolfgang Laun | Thread | Re: [xsl] Word Ladders as an exampl, Chris Maloney |
Re: [xsl] Word Ladders as an exampl, Wolfgang Laun | Date | Re: [xsl] things about grouping, Graydon |
Month |