3 ms·
You should definitely bench your storage to confirm that it likes hotspots (some don't!)
by erik_seaberg 2y ago
You should definitely bench your storage to confirm that it likes hotspots (some don't!)
- kreetx 2y agoYou should, but B-tree is the most common data structure used for database indexes, and sequential order performs better than random order for index keys.
- erik_seaberg 2y agoYou often can't bottleneck the entire workload on the capacity of one cluster node and one storage device.
- kreetx 2y agoI can't really understand what you said, could you elaborate? :)
- erik_seaberg 2y agoIf one machine can only handle a hundred transactions per second, and you might ever receive more than that, you have to spread the work across several machines, probably by assigning primary keys that aren't (mostly) sequential.
- willvarfar 2y agousually in sharding schemes its a few bits of a hash of the id that are used to determine shard; the system or library you are using will take care of this transparently for you.