Strategies to Scale Database Reads
Learn how to scale database reads as traffic grows through replicas, caching, materialized views, denormalization, and other proven techniques that reduce repeated work.
Full-Stack Developer
Hi, I'm Akshat Jain.
I'm a CS student focused on full-stack development, building projects with React, Node, Spring Boot, MySQL, and MongoDB.
Recent Posts
View all posts →Explore
From Notion to Hugo: Building a Fully-Automated Blog Pipeline
How I automated publishing from Notion to Hugo with custom themes, metadata, image optimization, and CI/CD for zero-click deployment
Chess.com’s Authentication Flow — What’s Missing and How to Fix It
Exploring Chess.com's authentication system: what happens when email verification is missing, the security vulnerabilities it creates, and how to build a stronger authentication flow
How Timsort Beats QuickSort in Real-World Scenarios
A practical comparison of Timsort and QuickSort and why Timsort dominates real-world sorting.
Latest
A Deep Dive into NTFS, EXT4, and APFS
Learn how NTFS, EXT4, and APFS work under the hood. Explore file system architecture, design trade-offs, and why each system is optimized for different platforms.
Strategies to Scale Database Writes
Explore proven techniques to handle increasing write load: sharding, batch writes, async processing, write-ahead logging, and LSM-based engines.
Why Binary Search Is Preferred Over Ternary Search Despite log₃(n)
A system-aware breakdown of why binary search outperforms ternary search despite the theoretical log_3(n) edge.
A Deep Dive into NTFS, EXT4, and APFS
Learn how NTFS, EXT4, and APFS work under the hood. Explore file system architecture, design trade-offs, and why each system is optimized for different platforms.
Strategies to Scale Database Writes
Explore proven techniques to handle increasing write load: sharding, batch writes, async processing, write-ahead logging, and LSM-based engines.
Why Binary Search Is Preferred Over Ternary Search Despite log₃(n)
A system-aware breakdown of why binary search outperforms ternary search despite the theoretical log_3(n) edge.