couchbase/moss

Health v2 · maintenance only

Flags: no_releases no_license

Adoption not part of the score

1015 stars · 66 forks observed · 2026-08-28

What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-30, confidence not recorded

Moss (memory-oriented sorted segments) is a pure-Go library providing a fast, ordered, persistable key-value collection. It uses a simplified LSM-tree design with sorted immutable segments, supporting snapshots, atomic batches, merge operations, and an optional append-only store with mmap reads.

Use cases

• embed an ordered key-value store in a Go application
• persist key-value data with snapshots and atomic batches
• implement write-heavy counters with merge operations
• cache writes back to a lower-level store like leveldb or sqlite
• navigate and revert to previous commit points of a datastore

When to choose

• you need an embedded, ordered key-value collection in pure Go
• you want concurrent readers and writers that don't block each other
• you need snapshot isolation and atomic batch mutations
• you want a write-back caching layer over another storage engine

When to avoid

• you need a full-featured standalone database server
• you require SQL or rich query capabilities
• your project is not written in Go
• you need battle-tested LSM storage like RocksDB with broad ecosystem support

Facets

library · maturity active

database caching serialization databases developer-tools performance go cross-platform key-value-store lsm-tree embedded-storage sorted-segments snapshots persistence

Member repositories

For agents

markdown · JSON · MCP: product_card(name="couchbase/moss")