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

RE: Efficently transposing tokenized data

Subject: RE: Efficently transposing tokenized data
From: "Michael Kay" <mike@xxxxxxxxxxxx>
Date: Wed, 5 Nov 2008 14:54:37 -0000
RE:  Efficently transposing tokenized data
> Assuming a large input, your approach looks more efficient to 
> me as it avoids grouping where indexing into the list does the job.
> Now I guess from previous answers on this list given to 
> similar questions that this is all implementation-defined.
> In spite of this, I'm asking whether that is all that can be 
> said here or whether there is a rationale here to favor 
> indexing over grouping when (a) processing time or (b) memory 
> consumption are important?

In Saxon (a) grouping will actually build a hash table in memory, so it uses
more memory, and (b) indexing in the form $seq[integer] is a constant-time
operation, so the indexing approach should definitely be better.

Michael Kay

Current Thread


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.
First Name
Last Name
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.