Hi, I am not a database expert, but I thought that with hash-tables you > should not have this problem. That is not the case? >
Yes, as long as the data is in memory, it doesn't matter much if the keys are randomly distributed. Actually some operations are faster if the data is randomly distributed in this case. But as soon as you use a hard disk (specially a rotating disk), then it's a problem. The reason to use them is that it is easier to merge databases. (The > 'same' application will run on one or more pc's and one or more > mobiles. In this way the data can be merged. Or is there a better way > for that?) > You could use sequential UUIDs. Those are guaranteed to be unique (they basically contain a part that is unique for a given machine, and a part that is sequential). I guess I will add support for this at some point. MS SQL Server supports a function newsequentialid() since MS SQL Server 2004 or so. Regards, Thomas -- You received this message because you are subscribed to the Google Groups "H2 Database" 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/h2-database?hl=en.
