]>
Commit | Line | Data |
---|---|---|
f284d963 | 1 | Redis TODO and Roadmap |
2 | ||
2014c437 | 3 | VERSION 1.2 TODO (Zsets, Integer encoding, Append only journal) |
c35f7d5b | 4 | =============================================================== |
5 | ||
6 | Most 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: | |
f6b141c5 | 7 | |
71c54b21 | 8 | * Document "masterauth" in redis.conf, also merge the other related patch if it seems a safe one. |
23cff1a8 | 9 | |
2014c437 | 10 | VERSION 1.4 TODO (Hash type) |
c35f7d5b | 11 | ============================ |
23cff1a8 | 12 | |
13 | * Hashes (HSET, HGET, HEXISTS, HLEN, ...). | |
09f6f702 | 14 | * Specially encoded memory-saving integer sets. |
cb7e07cc | 15 | * 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. |
09f6f702 | 16 | * List ops like L/RPUSH L/RPOP should return the new list length. |
f6b141c5 | 17 | |
2014c437 | 18 | VERSION 1.6 TODO (Virtual memory) |
c35f7d5b | 19 | ================================= |
7d65b33d | 20 | |
21 | * Redis Virtual Memory for datasets bigger than RAM (http://groups.google.com/group/redis-db/msg/752997c7b38553cd) | |
22 | ||
2014c437 | 23 | VERSION 1.8 TODO (Fault tollerant sharding) |
c35f7d5b | 24 | =========================================== |
7d65b33d | 25 | |
c35f7d5b | 26 | * Redis-cluster, a fast intermediate layer (proxy) that implements consistent hashing and fault tollerant nodes handling. |
7d65b33d | 27 | |
5b2a1c29 | 28 | Interesting readings about this: |
29 | ||
30 | - http://ayende.com/Blog/archive/2009/04/06/designing-rhino-dht-a-fault-tolerant-dynamically-distributed-hash.aspx | |
31 | ||
2014c437 | 32 | VERSION 2.0 TODO (Optimizations and latency) |
c35f7d5b | 33 | ============================================ |
7d65b33d | 34 | |
35 | * Lower the CPU usage. | |
36 | * Lower the RAM usage everywhere possible. | |
37 | * Use epool and alike to rewrite ae.c for Linux and other platforms suppporting fater-than-select() mutiplexing APIs. | |
38 | * Implement an UDP interface for low-latency GET/SET operations. | |
39 | ||
2014c437 | 40 | VERSION 2.2 TODO (Optimizations and latency) |
41 | ============================================ | |
42 | ||
43 | * 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. | |
44 | ||
c35f7d5b | 45 | SHORT/LONG TERM RANDOM TODO ITEMS |
46 | ================================= | |
f6b141c5 | 47 | |
0188805d | 48 | Most of this can be seen just as proposals, the fact they are in this list |
49 | it's not a guarantee they'll ever get implemented ;) | |
50 | ||
61c47ecd | 51 | * Give errors when incrementing a key that does not look like an integer, when providing as a sorted set score something can't be parsed as a double, and so forth. |
57033301 | 52 | * Move dict.c from hash table to skip list, in order to avoid the blocking resize operation needed for the hash table. |
682ac724 | 53 | * FORK command (fork()s executing the commands received by the current |
54 | client in the new process). Hint: large SORTs can use more cores, | |
55 | copy-on-write will avoid memory problems. | |
56 | * DUP command? DUP srckey dstkey, creates an exact clone of srckey value in dstkey. | |
57 | * SORT: Don't copy the list into a vector when BY argument is constant. | |
58 | * 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. | |
59 | * LOCK / TRYLOCK / UNLOCK as described many times in the google group | |
60 | * Replication automated tests | |
61 | * Byte Array type (BA prefixed commands): BASETBIT BAGETBIT BASETU8 U16 U32 U64 S8 S16 S32 S64, ability to atomically INCRBY all the base types. BARANGE to get a range of bytes as a bulk value, BASETRANGE to set a range of bytes. | |
62 | * 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. Already done for Mac OS X. | |
63 | * Read-only mode. | |
64 | * Pattern-matching replication. | |
b32627cd | 65 | * Dont' safe empty lists / sets / zsets on disk with snapshotting. |
66 | * Remove keys when a list / set / zset reaches length of 0. | |
682ac724 | 67 | |
68 | DOCUMENTATION WISHLIST | |
69 | ====================== | |
70 | ||
71 | * Page explaining tips to reduce memory usage. | |
72 | * A Sorted sets HOWTO | |
73 |