[XSL-LIST Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message]

Re: Re: lookup-table thoughts (was Re: matching multip

Subject: Re: Re: lookup-table thoughts (was Re: matching multiple times, outputting once?
From: Jeni Tennison <jeni@xxxxxxxxxxxxxxxx>
Date: Thu, 8 Nov 2001 21:59:40 +0000
Re:  Re: lookup-table thoughts (was Re: matching multip
Dimitre,

> Is this what you wished? I'm afraid it's performance seems to be no
> better than O(N*N), hope I'm wrong.

I altered it slightly to take advantage of Saxon's XSLT 1.1 support
(rather than use msxsl:node-set()). Here's the amended table (the
measurements might be a little off because of a different test
stylesheet, but the pattern is evident):

count   Tail Recursive      Not Tail Recursive  Divide And Conquer
10         388                    393               556
50         429                    396               631
100        451                    403               696
200        611                    418               876
500       2666                    654              1880
1000     12726                   2241              5588

So the non-tail-recursive template performs best on all counts.

Cheers,

Jeni

---
Jeni Tennison
http://www.jenitennison.com/


 XSL-List info and archive:  http://www.mulberrytech.com/xsl/xsl-list


Current Thread

PURCHASE STYLUS STUDIO ONLINE TODAY!

Purchasing Stylus Studio from our online shop is Easy, Secure and Value Priced!

Buy Stylus Studio Now

Download The World's Best XML IDE!

Accelerate XML development with our award-winning XML IDE - Download a free trial today!

Don't miss another message! Subscribe to this list today.
Email
First Name
Last Name
Company
Subscribe in XML format
RSS 2.0
Atom 0.3
Site Map | Privacy Policy | Terms of Use | Trademarks
Free Stylus Studio XML Training:
W3C Member
Stylus Studio® and DataDirect XQuery ™are products from DataDirect Technologies, is a registered trademark of Progress Software Corporation, in the U.S. and other countries. © 2004-2013 All Rights Reserved.