tstdb - A fast key-value store based on TST(Ternary Search Tree) - Google Project Hosting

tstdb - A fast key-value store based on TST(Ternary Search Tree) - Google Project Hosting
http://old.nabble.com/-CPyUG--%E6%94%AF%E6%8C%81%E6%95%B0%E6%8D%AE%E8%90%BD%E5%9C%B0%E7%9A%84memcached-td31394682.html


这个项目的c代码少是学习c的入门好代码

Introduction

1. keys are loaded into memory, and are organized as a ternary search tree

2. big values are stored on disk-based log; no disk IO for reading small values, which are less than 8 bytes

3. log file and hint file are used to reload data when restarting db server

4. very fast! both the qps and data reloading speed.

5. a memcached compatible server.(GET, SET and DELETE, value expiration is supported.)

TODO LIST:

supporting prefix searching.

Have a look

http://code.google.com/p/tstdb/source/browse/

Download

tstdb_0.2.tar.gz

Install

epoll is needed!

<span class="pln">tar </span><span class="pun">-</span><span class="pln">xzf tstdb_0</span><span class="pun">.</span><span class="lit">2.tar</span><span class="pun">.</span><span class="pln">gz
cd tstdb
make

run the server</span><span class="pun">:</span><span class="pln">
</span><span class="pun">./</span><span class="pln">tstserver 

show help
</span><span class="pun">./</span><span class="pln">tstserver </span><span class="pun">-</span><span class="pln">h</span>

Performance

the performance is comparable to memcached.

you can test it by yourself. benchmark