Which Database to Use, How to Decide?

 

1. First ask these key questions

Before choosing any database, be clear on:

  • Data type → structured (tables) or unstructured (JSON, files)
  • Scale → small app or millions of users
  • Read vs Write → more reading or more writing
  • Consistency vs Speed
  • Relationships → complex joins needed or not

🧱 What is Structured Data?

👉 Structured data = data with a fixed format (schema)

  • Stored in tables (rows & columns)
  • Each field has a defined type
  • Same structure for every record
idnameagesalary
1Ram2530000
2Shyam3040000

👉 Here:

Every row follows the same format
Columns are fixed → id, name, age, salary

Stored in:

  • MySQL
  • PostgreSQL

🧩 What is Unstructured Data?

👉 Unstructured data = no fixed format (“Unstructured means random data”)

  • Data can vary for each record
  • No strict schema
  • Can be text, JSON, images, videos

📌 Example (JSON)

{
  "name": "Ram",
  "age": 25
}

{
  "name": "Shyam",
  "address": "Pune",
  "skills": ["Java", "SQL"]
}

👉 Here:

  • Fields are different
  • No fixed structure

    Stored in:

  • MongoDB
  • Cassandra

2. Main types of databases (with when to use)

🔹 1. Relational Databases (SQL)

Examples: MySQL, PostgreSQL, Oracle Database

Use when:

  • Data is structured (tables)
  • You need relationships (joins)
  • Strong consistency is required

Best for:

  • Banking systems
  • ERP systems
  • User management systems

👉 If your app has clear tables like users, orders, payments → choose SQL

🔹 2. Non -Relational (NoSQL Databases)

Examples: MongoDB, Cassandra, Redis, HBase, Amazon DynamoDB

Use when:

  • Data is flexible or unstructured
  • High performance needed
  • Schema changes frequently

Types: Group into 4 Categories

  • Document → MongoDB
  • Key-Value → Redis
  • Column Stores→ Cassandra
  • Graph Store

1. Document Store

  • Example: MongoDB
  • Data Format: JSON / BSON documents
  • Use Case: Flexible schema, semi-structured data
  • Example Use: User profiles, product catalogs

👉 Stores data as complete documents instead of rows.


2. Key-Value Store

  • Example: Redis
  • Data Format: Key → Value pairs
  • Use Case: Fast access, caching, session storage
  • Example Use: Login sessions, caching API responses

👉 Simplest database type, extremely fast.

3. Column Store (Wide Column Store)

  • Example: Apache Cassandra
  • Data Format: Columns grouped into column families
  • Use Case: Large-scale distributed systems
  • Example Use: Banking logs, IoT data, analytics

👉 Designed for handling massive data across many servers.

4. Graph Store

  • Example: (Common example: Neo4j)
  • Data Format: Nodes + Relationships (Edges)
  • Use Case: Highly connected data
  • Example Use: Social networks, recommendation systems

👉 Best when relationships between data are important.


Best for:

  • Real-time apps
  • Chat apps
  • Big data systems

👉 If your data structure keeps changing → choose NoSQL

🔹 3. In-Memory Databases

Example: Redis

Use when:

  • Ultra-fast speed needed
  • Caching required

👉 Often used along with other DBs (not alone)


🔹 4. NewSQL / Cloud Databases

Examples: Google Spanner, Amazon Aurora

Use when:

  • You want SQL + scalability
  • Large distributed systems

3. Simple decision shortcut 🚀

  • Small project / beginner → MySQL
  • Complex queries / scalability → PostgreSQL
  • Flexible JSON data → MongoDB
  • High speed cache → Redis
  • Large distributed system → Cassandra / Spanner

4. Real-world examples

  • E-commerce app → PostgreSQL (orders, users, payments)
  • Chat application → MongoDB + Redis
  • Banking system → Oracle / PostgreSQL
  • Analytics system → Cassandra

🔍 Where NoSQL is used (real system design cases)

1. Flexible / changing data (schema-less)

Use: MongoDB

  • User profiles (different users → different fields)
  • Product catalogs (each product has different attributes)
  • CMS / content systems

👉 Why:

  • You don’t want to change table schema again and again

2. Very high write systems (scale)

Use: Cassandra

  • Logs (millions per second)
  • IoT sensor data
  • Click tracking (like Google analytics)

👉 Why:

  • Designed for horizontal scaling
  • Handles massive traffic

3. Caching / ultra-fast access

Use: Redis

  • Frequently accessed data
  • API response caching
  • Rate limiting

👉 Why:

  • In-memory → extremely fast

 

Comments

Post a Comment

Popular posts from this blog

Two Sum II - Input Array Is Sorted

 Given a 1-indexed array of integers numbers that is already sorted in non-decreasing order , find two numbers such that they add up to a specific target number. Let these two numbers be numbers[index1] and numbers[index2] where 1 <= index1 < index2 <= numbers.length. Return the indices of the two numbers, index1 and index2, added by one as an integer array [index1, index2] of length 2. The tests are generated such that there is exactly one solution. You may not use the same element twice. Your solution must use only constant extra space .   Example 1: Input: numbers = [2,7,11,15], target = 9 Output: [1,2] Explanation: The sum of 2 and 7 is 9. Therefore, index1 = 1, index2 = 2. We return [1, 2]. Example 2: Input: numbers = [2,3,4], target = 6 Output: [1,3] Explanation: The sum of 2 and 4 is 6. Therefore index1 = 1, index2 = 3. We return [1, 3]. Example 3: Input: numbers = [-1,0], target = -1 Output: [1,2] Explanation: The sum of -1 and 0 is -1. Therefore index1 = 1,...
Read more

Comparable Vs. Comparator in Java

  In Java , Comparable and Comparator both are interfaces used to sort objects. Comparable It defines  natural ordering  within a class. It is implemented  inside  the class being sorted. It uses the compareTo() method. It allows sorting  by one one . Comparable provides a  single sorting sequence . In other words, we can sort the collection on the basis of a single element such as id, name, and price. Comparable  affects the original class , i.e., the actual class is modified. Comparable is present in  java.lang  package. We can sort the list elements of Comparable type by  Collections.sort(List)  method. Only one compareTo() method can be implemented, restricting flexibility. Comparator It defines  custom sorting logic It is implemented  in a separate class  or using lambda expressions . It uses the compare() method. It allows sorting  by multiple criteria . The Comparator provides  multiple sorting...
Read more

Increasing Triplet Subsequence

 Given an integer array nums, return true if there exists a triple of indices (i, j, k) such that i < j < k and nums[i] < nums[j] < nums[k]. If no such indices exists, return false.   Example 1: Input: nums = [1,2,3,4,5] Output: true Explanation: Any triplet where i < j < k is valid. Example 2: Input: nums = [5,4,3,2,1] Output: false Explanation: No triplet exists. Example 3: Input: nums = [2,1,5,0,4,6] Output: true Explanation: The triplet (3, 4, 5) is valid because nums[3] == 0 < nums[4] == 4 < nums[5] == 6. Brute Force : Failed for some testcase class Solution {     public boolean increasingTriplet ( int [] nums ) {         int n = nums . length ;         int i = 0 ;         int j =i+ 1 ;         int k =j+ 1 ;         while (i <n && j<n && k<n)         {         if (nums...
Read more