InterviewBit Problems   Highly Available Database


About the Highly Available Database category (1)
Do Mapping, replica and coordinating nodes all exist on the ring? (1)
For a read to be consistent(return the latest write), we need to keep W + R > (4)
How many machines per shard ? How does a read / write look in every shard? (4)
Multi masters in storage system (1)
Size of the value for a key can increase as mentioned earlier. But the solution w (2)
Master Slave Architecture (1)
Should the data stored be normalized? (http://www.studytonight.com/dbms/database-normalization.php) (4)
What is the minimum number of machines required to store the data? (4)
What if a machine goes down? (4)
How does a write/read happen in our system? (13)
Can a peer to peer system be highly available in case of a DB machine dying? (6)
We are writing multiple copies of data on different nodes and since we are doing (2)
How exactly do peer-to-peer systems work? Doesn't there still have to be a high-l (4)
Highly Available Database Consistency vs Availability? (1)
Is Latency an important metric for us? (4)
Nice course. I only think it is a little bit long (2)
One thing I don't get is previously it mentioned 10K QPS and the size of one valu (3)
How do we store redundant data? (4)
You say " we would need to compromise with consistency if we have availability an (2)
Is sharding required? (1)
What kind of consistency can we provide? (3)
Does P, W and R predefined ? Or they change dynamically as per new machines addit (2)
I see, I was originally a bit confused about consistent hashing using peer-peer s (2)
How will we exactly shard data for a peer to peer system? (2)