Michael Kay wrote:
>> If you'd like to try a comparison, I have an 
>> earthquake data set and schema I use for comparing web 
>> service stack performance. ...
>>     
>
> I'd be happy to give it a try if the logic isn't too complex (it doesn't
> sound it, unless the geographical calculations are very complex).
>
> Is the server keeping the data in memory, or parsing it afresh each time?
>   

Great! I'm traveling for the next couple of days, but when I get a 
chance I'll send you directly a copy of one of the Java versions, with 
the data set and full details.

The Java code keeps all the data in memory, organized by area and 
ordered by date/time. In order to minimize the processing time (since 
it's intended to compare the actual XML marshalling/unmarshalling 
performance) it checks rectangle intersections between the query 
lat/long range and that of each area to determine which areas need to be 
checked, then does binary searches through the ordered array of quakes 
within an area for the start/end times in the query. Once it has the 
range of possible matching quakes, it does the final checks on lat/long 
and magnitude for each individual quake. I suspect the binary search 
part is more than you want to take on in XSLT, so we can try comparisons 
both with the search part enabled in the Java code and with it disabled 
(instead doing a check on each quake within the area).

  - Dennis