TODO

   1 Redis TODO and Roadmap
   2
   3 VERSION 1.4 TODO (Hash type)
   4 ============================
   5
   6 * BRPOPLPUSH
   7 * RPOPLPUSH should notify blocking POP operations
   8 * List ops like L/RPUSH L/RPOP should return the new list length.
   9 * Save dataset / fsync() on SIGTERM
  10 * MULTI/EXEC should support the "EXEC FSYNC" form
  11 * Synchronous Virtual Memory
  12 * BLPOP & C. tests (write a non blocking Tcl client as first step)
  13
  14 Virtual Memory sub-TODO:
  15 * Check if the page selection algorithm is working well.
  16 * Divide swappability of objects by refcount
  17 * vm-swap-file <filename>. The swap file should go where the user wants, and if it's already there and of the right size we can avoid to create it again.
  18 * it should be possible to give the vm-max-memory option in megabyte, gigabyte, ..., just using 2GB, 100MB, and so forth.
  19
  20 VERSION 1.6 TODO (Virtual memory)
  21 =================================
  22
  23 * Asynchronous Virtual Memory
  24 * Hashes (HSET, HGET, HEXISTS, HLEN, ...).
  25
  26 VERSION 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
  31 Interesting readings about this:
  32
  33     - http://ayende.com/Blog/archive/2009/04/06/designing-rhino-dht-a-fault-tolerant-dynamically-distributed-hash.aspx
  34
  35 VERSION 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
  43 VERSION 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
  48 OTHER IMPORTANT THINGS THAT WILL BE ADDED BUT I'M NOT SURE WHEN
  49 ===============================================================
  50
  51 BIG ONES:
  52
  53 * Specially encoded memory-saving integer sets.
  54 * A command to export a JSON dump (there should be mostly working patch needing major reworking).
  55 * Specially encoded sets of integers (this includes a big refactoring providing an higher level layer for Sets manipulation)
  56 * ZRANK: http://docs.google.com/viewer?a=v&q=cache:tCQaP3ZeN4YJ:courses.csail.mit.edu/6.046/spring04/handouts/ps5-sol.pdf+skip+list+rank+operation+augmented&hl=en&pid=bl&srcid=ADGEEShXuNjTcZyXw_1cq9OaWpSXy3PprjXqVzmM-LE0ETFznLyrDXJKQ_mBPNT10R8ErkoiXD9JbMw_FaoHmOA4yoGVrA7tZWiy393JwfCwuewuP93sjbkzZ_gnEp83jYhPYjThaIzw&sig=AHIEtbRF0GkYCdYRFtTJBE69senXZwFY0w
  57
  58 SMALL ONES:
  59
  60 * 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.
  61 * MSADD (n keys) (n values). See this thread in the Redis google group: http://groups.google.com/group/redis-db/browse_thread/thread/e766d84eb375cd41
  62 * Don't save empty lists / sets / zsets on disk with snapshotting.
  63 * Remove keys when a list / set / zset reaches length of 0.
  64
  65 THE "MAYBE" TODO LIST: things that may or may not get implemented
  66 =================================================================
  67
  68 Most of this can be seen just as proposals, the fact they are in this list
  69 it's not a guarantee they'll ever get implemented ;)
  70
  71 * Move dict.c from hash table to skip list, in order to avoid the blocking resize operation needed for the hash table.
  72 * FORK command (fork()s executing the commands received by the current
  73   client in the new process). Hint: large SORTs can use more cores,
  74   copy-on-write will avoid memory problems.
  75 * DUP command? DUP srckey dstkey, creates an exact clone of srckey value in dstkey.
  76 * SORT: Don't copy the list into a vector when BY argument is constant.
  77 * 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.
  78 * LOCK / TRYLOCK / UNLOCK as described many times in the google group
  79 * Replication automated tests
  80 * 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.
  81 * 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.
  82 * Read-only mode.
  83 * Pattern-matching replication.
  84 * Add an option to relax the delete-expiring-keys-on-write semantic *denying* replication and AOF when this is on? Can be handy sometimes, when using Redis for non persistent state, but can create problems. For instance should rename and move also "move" the timeouts? How does this affect other commands?
  85 * Multiple BY in SORT.