Semi-persistent decentralized key-value store that support auto-sharding, where the data is asynchronously transfered from memory to disk. Low level data store is efficient and optimized using RocksDB.
- Decentralized P2P with no single point of failure.
- Semi-persistent.
- Memcached compatible,
ZufarDB could be Memcached alternative, you can use any memcached client library out there. At this moment only support for set, get, and delete command, and not support TTL yet.
You need Rust compiler nightly, tested @ 1.3.0 (38517944f 2015-08-03)).
Rocksdb library:
wget https://github.com/facebook/rocksdb/archive/rocksdb-3.8.tar.gz
tar xvf rocksdb-3.8.tar.gz && cd rocksdb-rocksdb-3.8 && make shared_lib
sudo make installAnd then build:
$ cargo build$ ./target/debug/zufar serve example/node1.confRun more nodes:
$ ./target/debug/zufar serve example/node2.conf &
$ ./target/debug/zufar serve example/node3.conf &etc.
Check cluster status:
$ ./target/debug/zufar status 127.0.0.1 8123
Status=Up/Down
|/ State=Normal/Leaving/Joining/Moving
-- Address Load GUID Rack
UN 127.0.0.1:8123 0/10 0 1
UN 127.0.0.1:9123 0/7 1 1
UN 127.0.0.1:7123 0/2 2 1Looks familiar? Yeah but this is not Cassandra, ignore rack, we don't support network topology and multi-dc yet.
Test CRUD operation via telnet (using memcached protocol)
$ telnet localhost 8122
Trying 127.0.0.1...
Connected to localhost.
Escape character is '^]'.
set hello 0 0 5
world
STORED
get hello
VALUE hello 0 5
world
END
del hello
DELETED
get hello
ENDWith more detail like where the record is stored and how long the operation taken, just add postfix d for each command:
setd abc123 0 0 6
def456
STORED
node-2 in 0ms
getd abc123
VALUE abc123 0 6
def456
END
node-2 in 0msWARNING: not production ready, this is my personal research to learning Rust.