]> git.saurik.com Git - redis.git/blame_incremental - TODO
TODO updated
[redis.git] / TODO
... / ...
CommitLineData
1Redis TODO and Roadmap
2
3VERSION 1.2 TODO (Zsets, Integer encoding, Append only journal)
4===============================================================
5
6Most of the features already implemented for this release. The following is a list of the missing things in order to release the first beta tar.gz:
7
8* For now only the last argument gets integer encoded, so make sure that: 1) every multi bulk command implemented will have the last arg that is indeed a value, and not used otherwise. 2) to explicitly call the function to encode the object in MSET and other commands where there are multiple "values".
9* Man pages for SRANDMEMBER, missing Z-commands, ...
10* Use strcoll() to compare objects in sorted sets, like it already happens for SORT.
11* Write docs for the "STORE" operaiton of SORT. Link to the article about SORT by written by defunkt.
12* ZRANGEBYSCORE test, ZRANGEBYSCORE LIMIT option.
13* Sorted sets infinity tests.
14
15VERSION 1.4 TODO (Hash type)
16============================
17
18* Hashes (HSET, HGET, HEXISTS, HLEN, ...).
19* An utility able to export an .rdb file into a text-only JSON dump, we can't live anymore without such a tool. Probably an extension to redis-cli.
20
21VERSION 1.6 TODO (Virtual memory)
22=================================
23
24* Redis Virtual Memory for datasets bigger than RAM (http://groups.google.com/group/redis-db/msg/752997c7b38553cd)
25
26VERSION 1.8 TODO (Fault tollerant sharding)
27===========================================
28
29* Redis-cluster, a fast intermediate layer (proxy) that implements consistent hashing and fault tollerant nodes handling.
30
31Interesting readings about this:
32
33 - http://ayende.com/Blog/archive/2009/04/06/designing-rhino-dht-a-fault-tolerant-dynamically-distributed-hash.aspx
34
35VERSION 2.0 TODO (Optimizations and latency)
36============================================
37
38* Lower the CPU usage.
39* Lower the RAM usage everywhere possible.
40* Use epool and alike to rewrite ae.c for Linux and other platforms suppporting fater-than-select() mutiplexing APIs.
41* Implement an UDP interface for low-latency GET/SET operations.
42
43VERSION 2.2 TODO (Optimizations and latency)
44============================================
45
46* JSON command able to access data serialized in JSON format. For instance if I've a key foobar with a json object I can alter the "name" file using somthing like: "JSON SET foobar name Kevin". We should have GET and INCRBY as well.
47
48SHORT/LONG TERM RANDOM TODO ITEMS
49=================================
50
51 * FORK command (fork()s executing the commands received by the current
52 client in the new process). Hint: large SORTs can use more cores,
53 copy-on-write will avoid memory problems.
54 * SORT: Don't copy the list into a vector when BY argument is constant.
55 * Write the hash table size of every db in the dump, so that Redis can resize the hash table just one time when loading a big DB.
56 * LOCK / TRYLOCK / UNLOCK as described many times in the google group
57 * Replication automated tests
58 * BYTEDARRAY type
59 * zmalloc() should avoid to add a private header for archs where there is some other kind of libc-specific way to get the size of a malloced block.
60 * Read-only mode.