Hi, Please yell if this is an FAQ or my googling skills need help.
What sorting algorithm does Xalan use -- and what is the algorithm(s) runtime and memory footprint in big-O notation? I am using Xalan to sort large XML documents: approx 3 levels deep of a tree with 2-20,000 first child (attached to root) nodes and 30 grandchildren per child node. Sorting is done on an attribute of the grandchild nodes. The performance -- especially in memory usage -- is abysmal: 10-60 seconds sort time, memory usage is at least O(n^2). I've read the w3c performance pointers, but cutting the document down and doing fewer transforms really doesn't cut it (neither are applicable to a one-pass sort of a large document). Are there any ways to change the sort algortihm's memory/runtime behavior? Thanks, Martin PS -- test specs: Xerces, Xalan (latest), Solaris 2.8, JVM 1.2.2_07, Sun E450, 2GB real mem, 1GB JVM heap, 2x450mhz processors.
signature.asc
Description: This is a digitally signed message part
