[Top] [All Lists]

Re: [xsl] Tree Comparing Algorithm

2020-02-04 03:03:33

Even if the probability of two objects to have the same hash code is low, we 
should take this into account -- for example, we may choose to calculate a 
pair of hash codes for each object, using two independent hashing algorithms.

This reminds me of an incident during my time with ICL when we were designing a 
hardware accelerator containing search logic, and it did precisely this. The 
software people (like me) were horrified, but the hardware designers were 
entirely comfortable with doing statistical calculations on the probability of 
failures, and so long as the expected number of failures was significantly less 
than one in the design lifetime of the device, they were happy to go with it.

Michael Kay
XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list
EasyUnsubscribe: http://lists.mulberrytech.com/unsub/xsl-list/1167547
or by email: xsl-list-unsub(_at_)lists(_dot_)mulberrytech(_dot_)com
<Prev in Thread] Current Thread [Next in Thread>