[XSL-LIST Mailing List Archive Home]
[Reply To This Message]
Re: Recursive grouping - simple, XSLT 1.0, fast non-M
Subject: Re: Recursive grouping - simple, XSLT 1.0, fast non-Muenchian grouping method|
From: Geert Josten <Geert.Josten@xxxxxxxxxxx>
Date: Sat, 18 Dec 2004 11:56:58 +0100
<M:D/> is performing tests. See yesterdays thread "Test code and results comparing Muenchian Method
with the method suggested by Sergiu Ignat" by <M:D/> in which he refers to the following page:
Dimtre Novatchev wrote:
On Thu, 16 Dec 2004 19:27:46 +0200, Sergiu Ignat (dyve)
I would like to present you a simple, XSLT 1.0, fast grouping method with a
O(N*log(N)) complexity, the same as sorting. The only grouping method I knew
so far is Muenchian that has O(N^2) complexity.
The complexity of the Muenchian method is much better than O(N^2) --
can you provide an example with representative data, where the
Muenchian method behaves O(N^2)?
The main idea is to have a named template that takes as a parameter the node
list that should be grouped, processes the group defined by the first
element and recursively calls itself for the rest of the list excluding that
Yes, and this will be close to O(N^2) complexity, where N is the
number of nodes that are being grouped.
Once again -- can you provide evidence to a better performance?
IT-consultant at Daidalos BV, Zoetermeer (NL)
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