April 18, 2021
I like to spend one hour to go over the system design on this channel. Here is the link.
Kneovest neighbor -
45:00 - 51:00 / 57:30
Similar to binary search, time complexity is lowered from O(N) to O(logN)
50:00 - 53:00
High availability
Sharding -
proxy server - range based sharding -
client -
No comments:
Post a Comment