B-Trees vs LSM-Trees
Comparing write-optimized LSM-trees with read-optimized B-trees for database storage
Conflict Resolution Strategies
Techniques for handling concurrent writes and conflicts in distributed systems
Leaderless Replication
Dynamo-style replication with quorums and eventual consistency
Multi-Leader Replication
Multiple writable nodes with conflict resolution strategies
Partitioning Strategies
Key range, hash, and composite partitioning approaches
Rebalancing Partitions
Redistributing data when adding or removing nodes
Request Routing
How systems route requests to the correct partition
Secondary Index Partitioning
Global vs local secondary indexes in distributed systems