]>
Commit | Line | Data |
---|---|---|
1 | Redis TODO and Roadmap | |
2 | ||
3 | VERSION 1.2 TODO (Zsets, Integer encoding, Append only journal) | |
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: | |
7 | ||
8 | * Document "masterauth" in redis.conf, also merge the other related patch if it seems a safe one. | |
9 | * SETNX and MSETNX should use lookupKeWrite() in order to expire volatile keys when a write attempt is made. | |
10 | ||
11 | VERSION 1.4 TODO (Hash type) | |
12 | ============================ | |
13 | ||
14 | * Hashes (HSET, HGET, HEXISTS, HLEN, ...). | |
15 | * Specially encoded memory-saving integer sets. | |
16 | * 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. | |
17 | * List ops like L/RPUSH L/RPOP should return the new list length. | |
18 | ||
19 | VERSION 1.6 TODO (Virtual memory) | |
20 | ================================= | |
21 | ||
22 | * Redis Virtual Memory for datasets bigger than RAM (http://groups.google.com/group/redis-db/msg/752997c7b38553cd) | |
23 | ||
24 | VERSION 1.8 TODO (Fault tollerant sharding) | |
25 | =========================================== | |
26 | ||
27 | * Redis-cluster, a fast intermediate layer (proxy) that implements consistent hashing and fault tollerant nodes handling. | |
28 | ||
29 | Interesting readings about this: | |
30 | ||
31 | - http://ayende.com/Blog/archive/2009/04/06/designing-rhino-dht-a-fault-tolerant-dynamically-distributed-hash.aspx | |
32 | ||
33 | VERSION 2.0 TODO (Optimizations and latency) | |
34 | ============================================ | |
35 | ||
36 | * Lower the CPU usage. | |
37 | * Lower the RAM usage everywhere possible. | |
38 | * Use epool and alike to rewrite ae.c for Linux and other platforms suppporting fater-than-select() mutiplexing APIs. | |
39 | * Implement an UDP interface for low-latency GET/SET operations. | |
40 | ||
41 | VERSION 2.2 TODO (Optimizations and latency) | |
42 | ============================================ | |
43 | ||
44 | * 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. | |
45 | ||
46 | SHORT/LONG TERM RANDOM TODO ITEMS | |
47 | ================================= | |
48 | ||
49 | Most of this can be seen just as proposals, the fact they are in this list | |
50 | it's not a guarantee they'll ever get implemented ;) | |
51 | ||
52 | * Move dict.c from hash table to skip list, in order to avoid the blocking resize operation needed for the hash table. | |
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. | |
65 | ||
66 | DOCUMENTATION WISHLIST | |
67 | ====================== | |
68 | ||
69 | * Page explaining tips to reduce memory usage. | |
70 | * A Sorted sets HOWTO | |
71 |