> I think that question is very implementation specific. If all of your > data is in RAM, as your dataset is relatively small and these are just > numbers, I would expect performance to be excellent. I am not sure > that sorting will make much of a difference, but it depends on the > implementation and how it initiates the search for a false comparison > in a large sequence.
I retract any previous statements that may have alluded to good performance. A quick test on Saxon and eXist shows that this is a very slow problem. I am trying to see if there is not a short-cut that could be taken, I will come back to you... -- Adam Retter skype: adam.retter tweet: adamretter http://www.adamretter.org.uk _______________________________________________ [email protected] http://x-query.com/mailman/listinfo/talk
