Re: [Openscrobbler-devel] Distributing the system

[Jonathan D. <jd...@wu...>]

Err, its' 32 * 16 bits, or 64 bytes. This makes the collision chance 
slightly bigger but you get the idea.

--JD

On Mar 3, 2005, at 12:10 AM, Jonathan Dance wrote:

>> Another issue is unique IDs. Assuming we store songs/albums/artists 
>> in a database, how will the clusters have the same IDs as the central 
>> database (or, every other database)? The first inclination is to 
>> store this on the central server and have the clusters download this 
>> information. When a new song is submitted to a cluster, it tells the 
>> central server.
>
> Just thought of this:
> IDs could be based on a hashing algorithm, like MD5. MD5 is 34 * 16 
> bits = 34 * 2 bytes = 68 bytes. That's a pretty long ID but it has a 
> 3.38 x 10^-21 chance of a collision.
>
> --JD
>