Databases

Abstract Algorithms

AbstractAlgorithms

Home>Learn>Databases

Databases

Learn Databases as a connected topic across chapters, concepts, simulations, and interview reasoning.

Resources

16h 28m

Total Learning Time

0/49

Completed

Start Learning

Choose your learning style

Multiple ways to learn the same concept. Pick what works best for you.

Choose your learning style

Recommended Articles

ACID Properties Explained: How SQL Databases Guarantee Atomicity, Consistency, Isolation, and Durability

How CDC Works Across Databases: PostgreSQL, MySQL, MongoDB, and Beyond

Isolation Levels in Databases: Read Committed, Repeatable Read, Snapshot, and Serializable Explained

BASE Theorem Explained: How it Stands Against ACID

Change Data Capture Pattern: Log-Based Data Movement Without Full Reloads

Choosing the Right Database: CAP Theorem and Practical Use Cases

Compare-and-Swap and Optimistic Locking: How Every Database Implements It

Data Warehouse vs Data Lake vs Data Lakehouse: Which One to Choose?

Database Anomalies: How SQL and NoSQL Handle Dirty Reads, Phantom Reads, and Write Skew

Dirty Write Explained: When Uncommitted Data Gets Overwritten

Elasticsearch vs Time-Series DB: Key Differences Explained

Dirty Read Explained: How Uncommitted Data Corrupts Transactions

Key Terms in Distributed Systems: The Definitive Glossary

Lost Update Explained: When Two Writes Become One

Non-Repeatable Read Explained: When the Same Query Returns Different Results

NoSQL Partitioning: How Cassandra, DynamoDB, and MongoDB Split Data

Phantom Read Explained: When New Rows Appear Mid-Transaction

Partitioning Approaches in SQL and NoSQL: Horizontal, Vertical, Range, Hash, and List Partitioning

Probabilistic Data Structures: A Practical Guide to Bloom Filters, HyperLogLog, and Count-Min Sketch

Read Skew Explained: Inconsistent Snapshots Across Multiple Objects

Sharding Approaches in SQL and NoSQL: Range, Hash, and Directory-Based Strategies Compared

SQL Partitioning: Range, Hash, List, and Composite Strategies Explained

System Design Data Modeling and Schema Evolution: Query-Driven Storage That Survives Change

System Design Replication and Failover: Keep Services Alive When a Primary Dies

System Design Sharding Strategy: Choosing Keys, Avoiding Hot Spots, and Resharding Safely

Understanding Consistency Patterns: An In-Depth Analysis

Write Skew Explained: The Anomaly That Requires Serializable Isolation

B-Tree vs LSM-Tree Indexing

What happens when a database gets too big for one server? | Database Sharding & Partitioning

Sharding vs Partitioning

Apache Cassandra Architecture: When to Use, Pitfalls, and Performance Tuning

Cassandra Write Path & Tombstone Gotchas

ACID Transactions in Distributed Databases: DynamoDB, Cosmos DB, and Spanner Compared

System Design Databases: SQL vs NoSQL and Scaling

Stale Embeddings in RAG: The Eventual Consistency Gotcha in Vector Databases

Big Data 101: The 5 Vs, Ecosystem, and Why Scale Breaks Everything

A Guide to Raft, Paxos, and Consensus Algorithms

The Dual Write Problem in NoSQL: MongoDB, DynamoDB, and Cassandra

How It Works: The Internals of Database B+ Tree Indexes

System Design: Designing a Financial Ledger with Double-Entry Constraints

Distributed Transactions: 2PC, Saga, and XA Explained

High-Level Design: Building a Real-Time Ad Click Aggregator at Scale

System Design HLD Example: Real-Time Leaderboard

Tree Data Structure Explained: Concepts, Implementation, and Interview Guide

A Beginner's Guide to Vector Database Principles

Semantic Tool Retrieval: Scaling Agentic Workflows with Large Toolsets

Eventual Searchability: Consistency Models for Vector Indexes in RAG

Hybrid Consistency: Strong Local + Eventual Global Reads

Transactional Outbox Pattern: Design, Implementation, and Scaling Trade‑offs in Event‑Driven Microservices