- Published on
Understand the internal architecture of a distributed file system (DFS), including key components like metadata servers, data nodes, replication mechanisms, and a real-world example using Hadoop HDFS.
All Posts
All Posts
- system-design (153)
- system-design-interview (42)
- database (34)
- interview-prep (30)
- low-level-design (22)
- oop (15)
- databases (15)
- normalization (10)
- misc (10)
- networking (9)
- golang (9)
- load-balacing (9)
- distributed-systems (8)
- caching (8)
- indexes (8)
- data-structures (7)
- erd (7)
- uml (6)
- solid (6)
- messaging (6)
- theorem (6)
- security (6)
- oop-pillars (5)
- data-partitioning (5)
- functional-dependency (4)
- data-modeling (4)
- bloom-filters (4)
- cdn (4)
- (4)
- programming (3)
- scalability (3)
- dbms (3)
- relational-data-model (3)
- distributed-file-system (3)
- replication (3)
- recovery (3)
- proxy (3)
- dns (3)
- api-gateway (3)
- algorithms (2)
- searching-algorithms (2)
- relational-model (2)
- oop-principle (2)
- check-sum (2)
- redundancy (2)
- system-designs (1)
- tiny-url (1)
- load-balancing (1)
- performance (1)
- course (1)
- arrays (1)
- slices (1)
- typescript (1)
- sorting-algorithms (1)
- strings (1)
- leetcode (1)
- binary-search (1)
- problem-solving (1)
- history (1)
- setup (1)
- go-command (1)
- hello-world (1)
- trade-offs (1)
- integrity-constraints (1)
- armstrong-axioms (1)
- er-diagram (1)
- oop-relationship (1)
- tips (1)
- synchronous (1)
- asynchronous (1)
- batch-processing (1)
- streams (1)
- leader-follower (1)
- architectural-pattern (1)
- heart-beat (1)
- quorum (1)
- error-handling (1)
- high-availability (1)
- concurrency (1)
- observability (1)
- monitoring (1)
- availability (1)
- key-concepts (1)
- load-balacing-algorithms (1)
- load-balacing-uses (1)
- Published on
A checksum is a fixed-length string from a cryptographic hash that verifies data integrity in distributed systems. It helps detect corruption during data transfer, ensuring clients receive error-free data or can request a clean copy.- Published on
Learn the key differences between synchronous and asynchronous communication. Discover when to use each method with examples, pros/cons, and best practices for developers.- Published on
A Non-Clustered Index is a separate data structure that stores column values and pointers to table rows, speeding up lookups without altering the table's physical order. Multiple non-clustered indexes can exist per table to optimize diverse queries.- Published on
Learn what database indexes are, how they boost query performance, and why they can slow down write operations. Discover how to use indexes wisely to balance speed and efficiency in data retrieval and storage.