Derek, Even with the enormous amounts of data that Google is handling there would be no problem at all creating an algorithm that has virtually no chance of collisions. An 128bit UUID can have 18446744073709551616 unique IDs for every single millisecond. You can read about UUIDs here: http://www.ietf.org/rfc/rfc4122.txt
Java even has a class for this from 1.5+: http://java.sun.com/j2se/1.5.0/docs/api/java/util/UUID.html Lets move it back to theoretical.. ;) Cheers, Mikael On Dec 11, 9:42 pm, "Derek" <[EMAIL PROTECTED]> wrote: > Certainly appreciate the dialogue on this subject and suggest that the > 'theoretical' potential for conflicts heads into the practical when > considering the dataspace that Google contemplates.. That aside, I > would like to request the following: > > If an extended property is going to be used by applications to store > local keys required for offline operation please provide a method > whereby an application may specify the requirement for an index or > optimized lookup on that property. That will save the Google Servers > and our users time. > > Regards, > Derek.www.calgoo.com --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Google Calendar Data API" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/google-calendar-help-dataapi?hl=en -~----------~----~----~----~------~----~------~--~---
