Write-Ahead Log: Crash Recovery Technique
Databases lie to you. When your application receives a ‘commit successful’ response, the data might only exist in volatile memory. A power failure milliseconds later could erase that transaction…
Read more →Log
Suffix Array Construction: O(n log n) Algorithm
A suffix array is a sorted array of all suffixes of a string, represented by their starting indices. For the string ‘banana’, the suffixes are ‘banana’, ‘anana’, ’nana’, ‘ana’, ’na’, and ‘a’. Sorting…
Read more →Log Aggregation: Centralized Logging Architecture
When your application runs on a single server, tailing log files works fine. But the moment you scale to multiple instances, containers, or microservices, local logging becomes a nightmare. You’re…
Read more →Longest Increasing Subsequence: O(n log n) Solution
The Longest Increasing Subsequence (LIS) problem asks a deceptively simple question: given an array of integers, find the length of the longest subsequence where elements are in strictly increasing…
Read more →Fluentd: Log Collection and Forwarding
In distributed systems, logs scatter across dozens or hundreds of services, containers, and hosts. Without centralized collection, debugging production issues becomes archaeological work—SSH-ing into…
Read more →Database Write-Ahead Log: Crash Recovery Mechanism
When your application commits a transaction, you expect that data to survive a crash. This is the ‘D’ in ACID—durability. But here’s the challenge: writing every change directly to disk is…
Read more →