TODO

   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
  10 VERSION 1.4 TODO (Hash type)
  11 ============================
  12
  13 * Blocking LPOP (BLPOP).
  14 * Hashes (HSET, HGET, HEXISTS, HLEN, ...).
  15 * List ops like L/RPUSH L/RPOP should return the new list length.
  16
  17 VERSION 1.6 TODO (Virtual memory)
  18 =================================
  19
  20 * Redis Virtual Memory for datasets bigger than RAM (http://groups.google.com/group/redis-db/msg/752997c7b38553cd)
  21
  22 VERSION 1.8 TODO (Fault tollerant sharding)
  23 ===========================================
  24
  25 * Redis-cluster, a fast intermediate layer (proxy) that implements consistent hashing and fault tollerant nodes handling.
  26
  27 Interesting readings about this:
  28
  29     - http://ayende.com/Blog/archive/2009/04/06/designing-rhino-dht-a-fault-tolerant-dynamically-distributed-hash.aspx
  30
  31 VERSION 2.0 TODO (Optimizations and latency)
  32 ============================================
  33
  34 * Lower the CPU usage.
  35 * Lower the RAM usage everywhere possible.
  36 * Use epool and alike to rewrite ae.c for Linux and other platforms suppporting fater-than-select() mutiplexing APIs.
  37 * Implement an UDP interface for low-latency GET/SET operations.
  38
  39 VERSION 2.2 TODO (Optimizations and latency)
  40 ============================================
  41
  42 * 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.
  43
  44 OTHER IMPORTANT THINGS THAT WILL BE ADDED BUT I'M NOT SURE WHEN
  45 ===============================================================
  46
  47 BIG ONES:
  48
  49 * Specially encoded memory-saving integer sets.
  50 * A command to export a JSON dump (there should be mostly working patch needing major reworking).
  51
  52 SMALL ONES:
  53
  54 * 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.
  55
  56 SHORT/LONG TERM RANDOM TODO ITEMS
  57 =================================
  58
  59 Most of this can be seen just as proposals, the fact they are in this list
  60 it's not a guarantee they'll ever get implemented ;)
  61
  62 * Move dict.c from hash table to skip list, in order to avoid the blocking resize operation needed for the hash table.
  63 * FORK command (fork()s executing the commands received by the current
  64   client in the new process). Hint: large SORTs can use more cores,
  65   copy-on-write will avoid memory problems.
  66 * DUP command? DUP srckey dstkey, creates an exact clone of srckey value in dstkey.
  67 * SORT: Don't copy the list into a vector when BY argument is constant.
  68 * 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.
  69 * LOCK / TRYLOCK / UNLOCK as described many times in the google group
  70 * Replication automated tests
  71 * 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.
  72 * 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.
  73 * Read-only mode.
  74 * Pattern-matching replication.
  75 * Don't save empty lists / sets / zsets on disk with snapshotting.
  76 * Remove keys when a list / set / zset reaches length of 0.
  77
  78 DOCUMENTATION WISHLIST
  79 ======================
  80
  81 * Page explaining tips to reduce memory usage.
  82 * A Sorted sets HOWTO
  83