3 ms·
When we tested on MySQL, the update to the index really was that bad, once you reached a threshold of 10m-20m rows. And it got progressively worse to the point
by curun1r 12y ago
When we tested on MySQL, the update to the index really was that bad, once you reached a threshold of 10m-20m rows. And it got progressively worse to the point where we were never able to get a table with 100m rows using type-4 UUIDs.
It's a moot issue anyways since type-1 UUIDs don't have this problem. They're monotonic, which allows index updates to only need to append.
- marcosdumay 12y agoIt really shouldn't. B-trees have O(log n) insertion time, they shouldn't take much longer when your dataset grows. But then, it's MySQL. I was surprised by your experience, but not that much.
- girvo 12y agoBut because Type-1 UUIDs encode the MAC address and assume it's unique, which isn't always the case, I'd be a bit worried about it. Should I be? If not, then it seems like an excellent solution.