Two rows are never compared by the MD5 of their keys. The md5 of a row key is just used to choose which nodes of the cluster are responsible for the row.
On Fri, Apr 30, 2010 at 5:37 AM, Mark Jones <mjo...@imagehawk.com> wrote: > MD5 is not a perfect hash, it can produce collisions, how are these dealt > with? > > Is there a size appended to them? > > > > If 2 keys collide, would that result in a merging of data (if the column > names aren’t the same) or an overwrite if they were?
