9 min read LSM-tree (Log-Structured Merge-tree) is the storage engine architecture behind RocksDB, LevelDB, Cassandra, and HBase. It trades read amplification for dramatically […] Read article
9 min read A distributed file system (DFS) provides a POSIX-like file interface over a cluster of machines, storing file data reliably across Read article
8 min read A message broker decouples producers from consumers by providing a durable, ordered, partitioned log. Producers append messages to topics; consumers Read article
10 min read An event bus is a pub/sub messaging system designed for event-driven architectures: services publish domain events, and multiple subscribers react Read article
9 min read An object storage system provides a flat, scalable store for arbitrary binary data (objects) addressed by a bucket name and Read article
9 min read A block storage system exposes raw storage as fixed-size blocks (typically 4 KB or 512 bytes) arranged into logical volumes. Read article
9 min read A vector database stores high-dimensional embedding vectors and enables fast approximate nearest neighbor (ANN) search — finding the top-K vectors Read article
8 min read A column-family store organises data in a hierarchy: keyspace → table → partition → rows. The partition key determines which Read article
8 min read A graph database stores entities as nodes and relationships as edges, with properties on both. Unlike relational databases that simulate Read article
9 min read A time-series database (TSDB) is purpose-built for append-heavy, time-ordered metric data. Its key design decisions — chunk storage, timestamp and Read article
8 min read Synonym Expansion System: Overview Synonym expansion augments search queries with equivalent or related terms so that a search for “automobile” Read article
11 min read Document Store System: Overview A document store persists and retrieves arbitrary JSON documents. Unlike relational databases, it does not enforce Read article
12 min read Key-Value Store System: Overview A key-value store is the simplest distributed database: keys map to opaque binary values. Despite its Read article
8 min read Proximity Search System: Overview A proximity search system finds entities (restaurants, drivers, users) within a geographic radius of a query Read article
9 min read Typeahead Autocomplete System: Overview A typeahead (autocomplete) system returns ranked query completions as the user types, with latency under 50ms Read article
