Why NoSQL database types (document, key-value, column, graph) in HLD? - Purpose & Use Cases

The Big Idea

What if your data could organize itself perfectly, no matter how different it is?

The Scenario

Imagine you have a huge collection of different kinds of information: some are simple lists, some are complex relationships, and others are big tables with many columns. You try to organize all this data using just one type of spreadsheet or one big text file.

It quickly becomes a mess. You spend hours trying to find what you need, and updating one piece of data breaks others.

The Problem

Using a single, rigid system for all types of data is slow and confusing. It's easy to make mistakes because the system doesn't fit the data well. Searching and updating data takes forever, and you often lose track of connections between pieces of information.

The Solution

NoSQL databases come in different types designed for different kinds of data: document, key-value, column, and graph. Each type organizes data in a way that fits its nature, making it faster and easier to store, find, and update information without breaking anything.

Before vs After

✗ Before

Store all data in one big table or file;
Search by scanning everything;
Update by rewriting large parts;

✓ After

Use document DB for flexible records;
Use key-value DB for quick lookups;
Use column DB for wide tables;
Use graph DB for relationships;

What It Enables

It lets you handle any kind of data efficiently, making your apps faster, more reliable, and easier to build.

Real Life Example

A social media app uses a graph database to quickly find friends of friends, a document database to store user profiles, a key-value store for session data, and a column database to analyze user activity logs.

Key Takeaways

Manual one-size-fits-all data storage is slow and error-prone.

NoSQL types match data shapes for better speed and flexibility.

Choosing the right NoSQL type makes complex data easy to manage.

Practice

1. Which NoSQL database type stores data as flexible JSON-like documents, allowing nested structures?

easy

A. Document database

B. Key-value database

C. Column database

D. Graph database

Solution

1. Step 1: Understand document database structure

   Document databases store data in JSON-like documents that can have nested fields and arrays.

2. Step 2: Compare with other NoSQL types

   Key-value stores use simple key and value pairs, column stores organize data by columns, and graph databases focus on relationships.

3. Final Answer:

   Document database -> Option A

4. Quick Check:

   Nested JSON-like data = Document database [OK]

Hint: Documents = JSON-like nested data [OK]

Common Mistakes:

• Confusing key-value stores with document stores
• Thinking column stores store JSON documents
• Mixing graph databases with document databases

2. Which of the following is the correct way to describe a key-value store?

easy

A. Stores data as interconnected nodes and edges

B. Stores data in tables with rows and columns

C. Stores data as simple pairs of keys and values

D. Stores data as nested JSON documents

Solution

1. Step 1: Define key-value store

   Key-value stores save data as pairs: a unique key and its associated value, like a dictionary.

2. Step 2: Eliminate other options

   Graphs use nodes and edges, column stores use tables with columns, and document stores use nested JSON.

3. Final Answer:

   Stores data as simple pairs of keys and values -> Option C

4. Quick Check:

   Key-value = key and value pairs [OK]

Hint: Key-value = simple pairs [OK]

Common Mistakes:

• Confusing graph databases with key-value stores
• Thinking key-value stores use tables
• Mixing document stores with key-value stores

3. Given a graph database storing people and their friendships, which query result would you expect from a query asking for all friends of 'Alice'?

medium

A. A list of key-value pairs with friend names

B. A set of nodes connected to 'Alice' by edges labeled 'friend'

C. A table with columns for friend names and ages

D. A JSON document with nested friend details

Solution

1. Step 1: Understand graph database query output

   Graph queries return nodes and edges; friends of 'Alice' are nodes connected by 'friend' edges.

2. Step 2: Compare with other data formats

   Key-value pairs, tables, and JSON documents are typical of other NoSQL types, not graph databases.

3. Final Answer:

   A set of nodes connected to 'Alice' by edges labeled 'friend' -> Option B

4. Quick Check:

   Graph query = nodes and edges [OK]

Hint: Graph = nodes connected by edges [OK]

Common Mistakes:

• Expecting JSON documents from graph queries
• Thinking graph data is tabular
• Confusing key-value pairs with graph edges

4. You wrote a query to retrieve data from a column store but got an error. Which mistake likely caused this?

medium

A. Used SQL SELECT syntax without specifying columns

B. Used key-value pairs instead of column names

C. Tried to traverse edges like in a graph database

D. Tried to query nested JSON documents directly

Solution

1. Step 1: Understand column store query requirements

   Column stores require specifying columns in queries; missing columns causes errors.

2. Step 2: Analyze other options

   Nested JSON is for document stores, key-value pairs are for key-value stores, and edge traversal is for graph databases.

3. Final Answer:

   Used SQL SELECT syntax without specifying columns -> Option A

4. Quick Check:

   Column store queries need columns specified [OK]

Hint: Specify columns in column store queries [OK]

Common Mistakes:

• Using document store syntax on column stores
• Trying graph traversal in column stores
• Confusing key-value pairs with columns

5. You need to design a social network app that quickly finds mutual friends between users. Which NoSQL database type is best suited and why?

hard

A. Column database, because it stores data in columns

B. Key-value store, because it is the fastest for any query

C. Document database, because it stores nested user data

D. Graph database, because it efficiently handles relationships

Solution

1. Step 1: Identify the data need for mutual friends

   Finding mutual friends requires exploring relationships between users efficiently.

2. Step 2: Match data need to NoSQL type

   Graph databases specialize in storing and querying relationships like friendships quickly.

3. Step 3: Evaluate other options

   Document stores handle nested data but not relationship queries efficiently; key-value stores are simple but not optimized for relationships; column stores focus on columnar data.

4. Final Answer:

   Graph database, because it efficiently handles relationships -> Option D

5. Quick Check:

   Relationship queries = Graph database [OK]

Hint: Use graph DB for relationship-heavy apps [OK]

Common Mistakes:

• Choosing document DB for relationship queries
• Assuming key-value stores handle complex queries
• Confusing column stores with relationship handling