Question 1
Why is B-Trees preferred over LSM Trees for the database engine in this context?
Question 2
Why is multi-leader replication avoided in the context of generating unique short URLs?
Question 3
What is a suitable database engine for optimized read performance?
Question 4
Which process is used to ensure operations are not repeated during failovers?
Question 5
In handling high-traffic links, which technology is recommended for cache storage?
Question 6
What is the purpose of Kafka in handling URL click analytics?
Question 7
What storage solution is recommended for handling large pastes in Pastebin?
Question 8
On what basis should events be partitioned to ensure that only one consumer processes a short URL?
Question 9
What technique should be implemented for cleaning up expired links?
Question 10
What is a primary challenge in generating unique short URLs?
Question 11
For what purpose is Zookeeper used in the overall system architecture?
Question 12
Which hashing approach is recommended to generate short URLs?
Question 13
Which eviction policy is suggested for caching to maintain efficiency?
Question 14
What message processing system can be combined with Kafka to aggregate URL click data?
Question 15
Which concept helps reduce the re-distribution of keys when changing the size of a cache cluster?
Question 16
Which caching strategy is NOT suitable for URL shortening services?