- b+tree using []byte for keys and values
- b+tree using int64 for keys, and []byte for values (use as atomic uinx timestamp pk index)
- basic embedded key/val store backed by disk snapshots, used for testing or prototyping
- sharded hashmap which performs better under concurrent load
- production quality in memory k/v/doc database backed by disk, atomic persistence using aof