Databases | System Design Part - 2

This is part 2 in the SYSTEM DESIGN SERIES, where we are going to discuss each and every topic which helps the system to withhold zero to million users at any point in time without breaking down

In the previous part, we have discussed the Single Server Setup where web and data tiers lie in the same server. However with the increase in the demand for our website, it would be tough to scale by keeping both on the same server, Hence we need multiple servers where we store the web/mobile traffic [web tier] in one server and other for database [data tier]. One of the major advantages in separating them is, we can scale the web and data tiers independently





From the above figure, we can clearly depict that there are few requests between server and database for data that will be further moved to the user for rendering purpose


I personally know a lot of people who are confused in choosing the right database for their project, Mostly it is because of lack of understanding of the basic idealogy behind the databases which make them scratch their heads

Let's discuss different kinds of databases and which one is used when

There are two types of databases, one is a traditional relational database and the other one is a non-relational database

Traditional Relation Databases : 

  • These are also called relational database management systems or SQL databases, the most popular ones are MySQL, Oracle database, PostgreSQL, etc.
  • These store data in tables and rows format
  • We can perform join operations on these relational databases using SQL across different tables

Non-Relational Database :

  • Non-Relational databases are also called NoSQL databases. Popular ones are MongoDB, Cassandra, HBase, Amazon DynamoDB, etc
  • These databases are grouped into four categories: key-value stores, graph stores, column stores, and document stores
  • Non-relational databases does not support Join operations


Relational databases are there around the corner for over 40 years, Lot of people built many successful products using these databases and they are working perfectly.

However, with the increase in the user base and the amount of data that is being circulated around the world is humongous. on top of it, the data that is being collected now a days is not having any relation between them like data from website clicks, sensor movements, popularity of a product in specific region, etc. which make the system architects and developers think of using non-relational databases 

Non-relational databases might be the right choice if: 

  • Your application requires low latency. 
  • Your data are unstructured, or you do not have any relational data.
  • You only need to serialize and deserialize data (JSON, XML, YAML, etc.).
  • You need to store a massive amount of data


Now we are good with understanding web / database tier, In the next article we will focus on how we can scale our web servers using load balancer and cater thousands of requests without impacting the server crash.

Comments

Post a Comment

Popular posts from this blog

A complete guide to K-means clustering algorithm

Image
What is K-means Clustering K-Means is a simple and unsupervised machine learning algorithm, Basically, K-Means clustering is nothing but segregating the given data points of the dataset into multiple groups based on similar characteristics and identifying the underlined patterns, here the cluster refers to a collection of data points aggregated together because of certain similarities. K-Means clustering comes under unsupervised machine learning because, we won't be having the target values here, instead we group the data points which are similar in nature Where is the K-means Clustering algorithm used? There are multiple scenarios in the real world, where K-Mean clustering is being used, some of them are movie recommendations and to identify the type of the customer in any organizations Without any further delay, let's dive in understanding how K-Means clustering works  How is the K-means clustering algorithm works Step-1  K-Means clustering will keep few centroids in a rando...
Read more

What is Exploratory Data Analysis? | Part 1

Image
What is EDA (Exploratory Data Analysis) In layman terms, EDA is nothing but going through the dataset, identifying the features, how they are related to each other, and how those features will be helpful for you in identifying the target values Now let us try to understand the textbook definition of EDA in Datascience  Exploratory Data Analysis (EDA) is an approach/philosophy for data analysis that employs a variety of techniques to maximize insight into a data set. Techniques used in EDA   Let us step back for a moment and try to understand how we are deciding whether the mobile is good or not and whether the features might satisfy your needs we will check for RAM / MEMORY / CAMERA / DISPLAY SIZE and many more. and with each one, again we will deep dive and analyze the specifications and whether those are sufficient for our usage  Similar to that even in EDA we have a lot of parameters and techniques to implement and check on our dataset and see whether our dataset is in...
Read more

COMPARABLE VS COMPARATOR

Image
In this article, I will be explaining why java came up with COMPARATOR in the latest versions even though it already has a  COMPARABLE interface You can find small code snippets along the way for better understanding. Let's dive into the article Whenever we are designing the class, we will have some idea of what variables we need to store as part of this class Similarly, if we also know how to sort that object then we will implement the Comparable interface and we will override the compareTo method  In that compareTo method, we will be writing the sort logic whether it should return 1, -1, or 0, and based on that we will sort elements in the objects class Movie implements Comparable < Movie >{   private int id;   private String name;   private int rating;   @Override   public int compareTo (Movie o) {       if ( this .rating < o.rating) return - 1 ;       if ( this .rating > o.rating) retu...
Read more