sys-d
// distributed systems lab
Fixed Window CounterSliding Window LogSliding Window CounterToken BucketLeaky Bucket
Circuit BreakerRetry with BackoffTimeout WrapperBulkheadHedged RequestsFallback Strategy
LRU CacheLFU CacheTTL CacheCache AsideWrite-Through/BackCache StampedeBloom Filter
Round RobinWeighted Round RobinLeast ConnectionsIP HashingConsistent Hashing
In-Memory QueuePub/Sub BrokerAt-Most-OnceAt-Least-OnceDead Letter QueueConsumer GroupsPartitioned Log
Distributed LockLeader ElectionHeartbeat MonitorService RegistryService Discovery
Primary-ReplicaRead/Write QuorumVector ClocksCRDT Counters
Two Phase CommitThree Phase CommitSimplified Raft
Key-Value StoreAppend-Only LogWrite Ahead LogSSTableLSM Tree
Metrics CollectorHistogramStructured LoggerTrace ID Propagation
JWT ValidationAPI Key ValidationIdempotency KeyHMAC Verification
v1.0 · MIT
storage

Storage Engines

Data structures and algorithms that power database storage layers.

// concept

Storage engines determine how data is written, indexed, and retrieved from disk. The trade-off is typically between write throughput and read latency.

Key-Value Store

Simple get/put/delete interface backed by a hash map. Foundation of most distributed storage systems.

Append-Only Log

Immutable sequential writes. Fast writes, natural audit trail, basis for event sourcing and WAL.

Write Ahead Log

Log mutations before applying them. Enables crash recovery by replaying the log after restart.

SSTable

Sorted String Table: immutable, sorted key-value file with an index for fast lookups.

LSM Tree

Log-Structured Merge Tree: buffer writes in memory, flush to sorted files, merge in background.