Martin Kleppmann&#x27;s book Designing Data-Intensive Applications is a great starting point if you&#x27;re not familiar with it.

I personally like to find new distributed systems, and then learn what techniques they use.For example learning how serf.io ises Vivaldi, how CockroachDB uses raft multi-group, or why FoundationDB has different processes and they each do.I try to write interesting stuff on distributed systems, but there&#x27;s a great discord created by eaton phil on software internals that has a lot of great discussions <a href="https:&#x2F;&#x2F;twitter.com&#x2F;eatonphil" rel="nofollow">https:&#x2F;&#x2F;twitter.com&#x2F;eatonphil</a>

oh also, <a href="https:&#x2F;&#x2F;lobste.rs" rel="nofollow">https:&#x2F;&#x2F;lobste.rs</a> and filter by the `distributed` tag

This is great. Where can I learn more like this?I am interested in distributed systems and database internals (both traditional and new databases) but find that many database resources tend to be either introductory SQL queries or related to tuning.

There is overhead to a token. If that was the &quot;simple trick&quot;, then why don&#x27;t hash based systems like Cassandra, Scylla, Temporal, etc do that by default?Only somewhat effective if you start at massive scale tbh, and it still doesnt&#x27; solve hot partitions because it can be hot because of a single tenant (e.g. company ID) that can&#x27;t be split across hash tokens, but can be across ranges

There is a simple trick to manage hash based partition growthDon&#x27;t assign small number of tokens, but a much larger oneIf you have a million tokens, there is no need to re-shard, and you can re assign tokens to different nodes as your cluster grows

A few main reasons come to mind:1. The hash would be an extra column that can be calculated from existing data, wasted storage2. You effectively have to rewrite the entire database to itself to redistribute, and keeping the DB availabile during this process is _very_ complicated3. You&#x27;re putting an extreme load on the DB for a substantial amount of time. This takes away from your DB performance and makes node downtime even more severeIn a distributed DB, you have to remember that the probability your node _doesn&#x27;t_ have the data you need increases with the size of the cluster, which creates a negative feedback loop for having to rewrite.

Why can’t hash based partitioning systems just store the full hash with the key for fast rehashing if the number of buckets needs to change, or else recompute the hash?

Range Partitioning: Zero to One