How datnguyenzzz/nogodb works
Project type and purpose
• nogoDB is a Go-based key–value storage engine implementing a fragmented LSM-tree. It’s a library/tool (not a UI application) that provides atomic writes, on-disk sorted string tables (SSTables), in-memory indexing, bloom-filters, and virtual file system abstraction.
File structure
• Top-level:
• README.md, docs/ – project overview and design notes
• lib/ – modular packages that implement subcomponents
• lib/go-wal – write-ahead log (durability)
• lib/go-adaptive-radix-tree – in-memory index (memtable)
• lib/go-blocked-bloom-filter – filter to avoid unnecessary disk I/O
• lib/go-sstable – on-disk sorted string table storage, block format, compression, iterator
• lib/go-fs – virtual file system abstraction (pluggable storage backend)
• lib/go-context-aware-lock – concurrency control
• lib/go-bytesbufferpool – reusable buffers for I/O performance
Additional insights from README
• The “Development Progress Tracker” shows that WAL, radix-tree, and bloom-filter are done; SSTable and VFS remain.
• The system is built in components to be composed into a full LSM pipeline.