[xsl] Efficient XSLT range lookups / questions

[Hermann Stamm-Wilbrandt <STAMMW@xxxxxxxxxx>]

Hello,

I got notice of an interesting scenario needing a huge amount of range
lookups in XSLT (billions per year with more than 20000 different ranges).


My web searches prior to this only showed range lookups of complexity
linear in the number of ranges to be searched. I am sure that my searches
are not perfect and I just missed relevant postings.
Are there any relevant postings?


Since the ranges change rarely precomputing was a good option.

I compared binary search trees against stylesheets with a binary search
structure.

Findings based on experiments with saxon9he and DataPower XSLT processor
[1]:
- binary outperforms linear
- binary stylesheets outperform binary XML searchtrees
- in case the XSLT processor supports document and/or stylesheet caching
  the lookup performance remains good even for single lookups (logarithmic
  in depth of search tree; DataPower supports both, and web searches
indicate
  that .net framework also supports document/stylesheet caching)

Are there even better alternatives for doing quick range lookups?


[1] "Efficient XSLT range lookups"
https://www.ibm.com/developerworks/forums/thread.jspa?threadID=348576&tstart=0


Mit besten Gruessen / Best wishes,

Hermann Stamm-Wilbrandt
Developer, XML Compiler, L3
Fixpack team lead
WebSphere DataPower SOA Appliances
----------------------------------------------------------------------
IBM Deutschland Research & Development GmbH
Vorsitzender des Aufsichtsrats: Martin Jetter
Geschaeftsfuehrung: Dirk Wittkopp
Sitz der Gesellschaft: Boeblingen
Registergericht: Amtsgericht Stuttgart, HRB 243294