LedisDB is a NoSQL database written in Go. It is similar to Redis and uses redis protocol. It can be used as a replacement of Redis. However, it uses RocksDB, LevelDB or goleveldb as storage engine. Therefore, unlike Redis, the storage is not limited by memory. The name LedisDB comes from Level-Redis-DB.
In 2014, Chinese programmer Siddon Tang noticed that as the number of users increases, the memory size is not enough for Redis. He found that SSDB could solve the problem. However, because of the three reasons below, he wanted to develop a database similar to SSDB using Go:
Now, Siddon Tang is the Chief Engineer of PingCAP. He works on TiDB and TiKV. But LedisDB is still under his maintenance.
Custom API HTTP / REST Command-line / Shell
LedisDB can be embedded in Go programs and programs can use its API to perform queries. LedisDB also provides a query interface in redis protocol called RESP(REdis Serialization Protocol), and can be queried via redis-cli. LedisDB has HTTP API support, too.
There is no concurrency control protocol in LedisDB because it does not support transactions. Like Redis, LedisDB processes requests as command sequences. Each command is treated as a single atomic operation. However, LedisDB does not provide any mechanism to combine commands into transactions.
LedisDB uses RocksDB, LevelDB or goleveldb as storage engine and thus inherits their logging mechanisms. They log all
As a key/value store, no join feature is provided in LedisDB.
N-ary Storage Model (Row/Record)
LedisDB uses RocksDB, LevelDB or goleveldb as storage engine and thus inherits their storage model. Data are stored in the form of ordered key-value pairs.
LedisDB uses iterators in query processing.
LedisDB does not support stored procedures, but like Redis, it provides the capability to evaluate scripts using the bulit-in Lua interpreter. Scripts will be cached by LedisDB and can be invoked from the cache later. However, they are just cached rather than stored.
Skip List Log-Structured Merge Tree
LedisDB uses RocksDB, LevelDB or goleveldb as storage engine and inherits their index data structure, which is the Log-Structured Merge Tree. They also use Skip List in the MemTable part.
Disk-oriented In-Memory Hybrid
LedisDB uses RocksDB, LevelDB or goleveldb as storage engine and thus inherits their storage architecture. It also provides an option to use memory-backed storage (via goleveldb).
Non-Blocking Consistent Blocking
LedisDB uses RocksDB, LevelDB or goleveldb as storage engine and thus inherits their checkpoint mechanisms.
LedisDB is a key/value store, but has rich data structures. In addition to simple key/value pair, it provides Hash, List, Set, ZSet.
LedisDB can be embedded in Go programs. You can also run LedisDB as an independent server. Multiple LedisDB nodes and coordinator nodes can form a cluster with partition and Master-Replica replication. Each server does not share anything with others and only communicates with each other through network connection.
Dictionary Encoding Naïve (Page-Level)
LedisDB uses RocksDB, LevelDB or goleveldb as storage engine. You can enable their compression feature via configuration. Data and index blocks are compressed individually. User can choose from a list of supported compression algorithms, like LZ4 and Snappy. User can choose to use Dictionary Compression, too. Data are decompressed when LedisDB retrieves them from the underlying storage engine.
LedisDB uses RocksDB, LevelDB or goleveldb as storage engine. Therefore, it inherits their Log-structured storage organization.