Subject: Re: [xsl] Re: Simple problem - complicated solution - performance From: Antonio Fiol Bonnín <fiol@xxxxxxxxxx> Date: Fri, 17 May 2002 09:01:40 +0200 |
Stuart,
The performance will remain linear if a DVC algorithm is used.
Read about DVC algorithms and their optimisation at:
http://vbxml.com/snippetcentral/main.asp?view=viewsnippet&lang=&id=v20020107050418
and
http://www.topxml.com/xsl/articles/recurse/
Many functions in FXSL have their DVC implementation.
Cheers, Dimitre Novatchev.
"Stuart Celarier" <stuart at ferncrk dot com> wrote:
Dimitre raises an interesting point about using recursion for computing
the minimum and maximum values of a set of data. Let me throw this
question back out to the list, especially to people with XSLT
implementation experience:
It seems like there must be some practical limits to recursion since that would involve a call stack in memory. Is it reasonable to think about recursion that stacks up a couple of thousand or tens of thousands of calls deep? Taking a page fault on a call stack seems like it could get very expensive very quickly.
Clearly computing a the minimum and maximum should require linear time, O(n). But if the computation itself doesn't scale well, then a seemingly O(n) algorithm could perform much worse in practice. Comments?
Cheers, Stuart
__________________________________________________ Do You Yahoo!? LAUNCH - Your Yahoo! Music Experience http://launch.yahoo.com
XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list
.
Attachment:
smime.p7s
Description: S/MIME Cryptographic Signature
Current Thread |
---|
|
<- Previous | Index | Next -> |
---|---|---|
[xsl] Re: Simple problem - complica, Dimitre Novatchev | Thread | [xsl] Store the result of a <xsl:so, gupta . rohit |
[xsl] xsl:value-of not allowed insi, Jarkko . Moilanen | Date | RE: [xsl] Beginner XSL question, Stevenson Ngila |
Month |