Re: Efficently transposing tokenized data

Play the video

Subject: Re: Efficently transposing tokenized data
From: Michael Ludwig <mlu@xxxxxxxxxxxxx>
Date: Wed, 05 Nov 2008 17:04:59 +0100

Michael Kay schrieb:

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.

Thank you very much for that clarification.

Michael Ludwig

Current Thread
Efficently transposing tokenized data Beldaz Jalfrezi - 4 Nov 2008 23:13:25 -0000 Michael Kay - 4 Nov 2008 23:44:36 -0000 Michael Ludwig - 5 Nov 2008 14:23:05 -0000 Michael Kay - 5 Nov 2008 14:55:08 -0000 Michael Ludwig - 5 Nov 2008 16:05:34 -0000 <= Dimitre Novatchev - 5 Nov 2008 00:20:56 -0000 <Possible follow-ups> Beldaz Jalfrezi - 5 Nov 2008 06:53:52 -0000

<- Previous	Index	Next ->
RE: Efficently transposing to, Michael Kay	Thread	Re: Efficently transposing to, Dimitre Novatchev
Image overflow in FOP, Sebastien	Date	RE: XPath "//", speed, and Sa, Lars Huttar
	Month

PURCHASE STYLUS STUDIO ONLINE TODAY!

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

Download The World's Best XML IDE!

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

Subscribe in XML format

RSS 2.0
Atom 0.3

XML Editor - Download a 15 Day Free Trial Now >

See What's New in Stylus Studio >

Buy Stylus Studio - XML Editor - Now >