Concepts on Lorbic

Cache-Driven Development: Saving Your Database From Itself

Wed, 22 Jul 2026 12:00:00 +0530

There is a moment in every backend engineer’s life when their database starts refusing connections.

Picture 2 a.m. on a Tuesday. The app is operating under normal traffic, nothing unusual. But the database connection pool is saturated. Queries are timing out. The monitoring dashboard shows 50,000 database operations per second, far beyond what the system should be handling.

When someone pulls the slow-query logs, the pattern is immediately clear. The same query appears thousands of times:

What Couchbase Taught Me About System Thinking

Tue, 18 Nov 2025 02:20:06 +0530

Couchbase Internals: Indexes, Queries, Consistency, and Performance

Introduction

Over the last few years I’ve lived deep inside backend systems, and for the past year and a half Couchbase has been my daily companion. Working with Go services that depend on Couchbase taught me that the real lessons aren’t in the marketing slides or quick‑start guides. They’re in the internals: how indexes are built, how queries are planned, how consistency flags change the story, and how durability levels quietly decide whether your system survives a failure or not.

What Facebook's Memcache Taught Me About Systems Thinking

Mon, 07 Jul 2025 14:03:00 +0000

What Facebook’s Memcache Taught Me About Systems Thinking

“The probability of reading transient stale data is a tunable parameter”. - Scaling Memcache at Facebook (NSDI, 2013)

There’s a moment in every engineer’s life when a seemingly simple component like a cache, suddenly becomes the most complex piece in the stack. For me, that moment arrived reading Facebook’s paper on scaling Memcache. I didn’t expect a key-value store to challenge my understanding of systems architecture. But this paper wasn’t about cache keys or TTLs. It was about what happens when infrastructure hits the limits of scale, physics, and human reliability.
What follows isn’t a summary. It’s a set of systems insights that stayed with me, principles that go deeper than code and that I now see everywhere.

Bitmasking In Go

Thu, 17 Apr 2025 02:20:00 +0000

Bitmasking in Go

Bitmasking is one of those computer science tricks that feels like wizardry, until you realize it’s just some clever shifting and binary math. This blog explores the idea, shows how we use it in Go, and why it’s surprisingly useful when working with databases like Couchbase.

What’s Bitmasking?

A bitmask is just an integer where each bit (0 or 1) represents a flag or state. Instead of storing multiple booleans in a slice or map, you cram them into a single int. Fast to compute, fast to store, and great for indexing.