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

RE: Computational complexity of XSL processing

Subject: RE: Computational complexity of XSL processing
From: "Gavin Thomas Nicol" <gtn@xxxxxxxxxxxx>
Date: Mon, 22 Feb 1999 09:50:03 -0500
RE: Computational complexity of XSL processing
> The question is about computational complexity of XSL processing. 

This is an interesting question. One concern I have about having
match patterns be as powerful as select patterns basically boils 
down to this. 

Even though it is possible to implement XSL with such expressive 
match patterns, it is harder to optimize them such that performance
doesn't degrade rapidly as a function of match pattern complexity.
It's certainly possible, but not easy.

>From my experience, people seldom really use extremely complex 
match patterns anyway. Most people seem to treat match patterns
and select patterns much like a case statement nested inside an
if block.


 


 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.