RE: large xml document and sorting

An ideal application for a SAX filter. Write a SAX filter to run between the
XML parser and the XSLT processor to get rid of <rest-of-subtree> and its
children. The sort should then be pretty fast, because there will be enough
memory to do it quickly.

Michael Kay
Software AG
home: Michael.H.Kay@xxxxxxxxxxxx
work: Michael.Kay@xxxxxxxxxxxxxx

> -----Original Message-----
> From: owner-xsl-list@xxxxxxxxxxxxxxxxxxxxxx
> [mailto:owner-xsl-list@xxxxxxxxxxxxxxxxxxxxxx]On Behalf Of
> Mark Diggory
> Sent: 29 April 2002 21:08
> To: xsl-list@xxxxxxxxxxxxxxxxxxxxxx
> Subject:  large xml document and sorting
>
>
> We've got some documents which are upwards of 10 - 20 Mb that we are
> have speed issue with in terms of transforming them.
>
> 1.) they have about ~800 or so nodes that we need to sort in
> one portion
> of the tree.
> 2.) they have about 60000 nodes of content in another subtree
>
> ie
>
> <example>
> 	<node-to-be-sorted>...</node-to-be-sorted>
> 	<!-- about 800 of these -->
> 	<node-to-be-sorted>...</node-to-be-sorted>
> 	<rest-of-subtree>
> 			<!-- lots of nodes (~60000) -->
> 	</rest-of-subtree>
> </example>
>
> 1.) I could care less about the "rest-of-subtree" portion and
> if I could
> get away without parsing it, the better. Is there a "best
> practice" to
> exclude this portion of the tree?
>
> 2.) Is there a "best practice" to sort the
> "node-to-be-sorted" when they
> are this many as well? I really need to get this as fast as possible.
>
> Thanks,
> -Mark Diggory
>
>
>
>  XSL-List info and archive:  http://www.mulberrytech.com/xsl/xsl-list
>


 XSL-List info and archive:  http://www.mulberrytech.com/xsl/xsl-list