The service will generate concise aliases that redirect to the original longer URLs.
No latency;
Scalability;
Fault tolerance;
Maintenance
1. Total database capacity:
The database has 4 attributes, userId, tiny url, original url, create timestamp
A record = 20 + 8 + 100 + 8 = 136 bytes,
Assume the index occupied 50% of a record, so the index size is 136 * 50% = 68 bytes
Total = 68 + 136 = 204 bytes
In case of generating 17.28 million tiny urls in a year, DB capacity is 204 * 17.28 * 1,000,000 * 365 = 1.2 PB
2. Bandwidth:
Write bandwidth (generate shorten url):
TPS * (userId + tinyUrl + originalUrl + timestamp) = 136 bytes * 200/s = 27.2 kb/s
Read bandwidth (Get original Urls)
TPS * (userId + tinyUrl + originalUrl + timestamp) = 20,000/s * 136 bytes = 2.72MB/s
3. Cache
Assume the cache occupied 20%, cache = 240 TB
There are two APIs:
GetTinyUrl(String originalUrl)
GetOriginalUrl(String tinyUrl)
The database has below attributes:
Shorter url Service:
Get original url service:
Dig deeper into 2-3 components and explain in detail how they work. For example, how well does each component scale? Any relevant algorithm or data structure you like to use for a component? Also you could draw a diagram using the diagramming tool to enhance your design...
Explain any trade offs you have made and why you made certain tech choices...
If the database and cache both down, the shorter service will not work.
What are some future improvements you would make? How would you mitigate the failure scenario(s) you described above?