|
Subject: RE: [xsl] Cost of complex match patterns From: "Michael Kay" <mike@xxxxxxxxxxxx> Date: Thu, 14 Aug 2008 22:24:18 +0100 |
> Dr. Kay, is this true only for Saxon-SA? No, this optimization is also in Saxon-B. MK > > -----Original Message----- > From: Michael Kay [mailto:mike@xxxxxxxxxxxx] ... > > In Saxon, //bar is handled by an index, so exists(//bar) > should be quite fast after the first time (when the index is built). > > Michael Kay > http://www.saxonica.com/ > > > -----Original Message----- > > From: Andrew Welch [mailto:andrew.j.welch@xxxxxxxxx] > > Sent: 12 August 2008 10:34 > > To: xsl-list@xxxxxxxxxxxxxxxxxxxxxx > > Subject: [xsl] Cost of complex match patterns > > > > Out of interest, given the match patterns: > > > > match="foo[//bar]"
| Current Thread |
|---|
|
| <- Previous | Index | Next -> |
|---|---|---|
| RE: [xsl] Cost of complex match pat, Tony Nassar | Thread | Re: [xsl] Cost of complex match pat, Vladimir Nesterovsky |
| RE: [xsl] Sorting, but then splitti, Michael Kay | Date | [xsl] Fill line ends with dots, Linda van den Brink |
| Month |