> While I like Geert's suggestion of keying a hash of the node > tree in XSLT so as to reduce the number of accesses to the > source node tree, there really may not be as many as might > appear on the surface. And anyway optimization in the > processor might be able to implement deep-equal quickly with > internal sub-tree hashes and occupying heavy-lifting cycles > only to establish bona-fide uniqueness when the hashes are equal.
Yes, there is a break-even point somewhere. Building an index for potentially a lot more than really necessary, versus heavier calculations in the function on potentially (very) large sequences. But in my practical experience I have not yet been let down by indexes, though I only start using them when I am sure I need quick access to a large pool of nodes.. > I hope this helps. Some empirical evidence will support > going to the effort of making the algorithm faster. Perhaps Tony is willing to do some measurements! ;-) Kind regards, Geert drs. G.P.H. (Geert) Josten Consultant Daidalos BV Hoekeindsehof 1-4 2665 JZ Bleiswijk T +31 (0)10 850 1200 F +31 (0)10 850 1199 mailto:[email protected] http://www.daidalos.nl/ KvK 27164984 P Please consider the environment before printing this mail. De informatie - verzonden in of met dit e-mailbericht - is afkomstig van Daidalos BV en is uitsluitend bestemd voor de geadresseerde. Indien u dit bericht onbedoeld hebt ontvangen, verzoeken wij u het te verwijderen. Aan dit bericht kunnen geen rechten worden ontleend. _______________________________________________ General mailing list [email protected] http://xqzone.com/mailman/listinfo/general
