TODO updated

diff --git a/TODO b/TODO
index 3d1059df3cbbca71ea70c250b36c4821fea5b593..dd6d163feeadf528cea3afbe12f48008972dc200 100644 (file)
--- a/TODO
+++ b/TODO
@@ -1,6 +1,6 @@
 Redis TODO and Roadmap
 
-VERSION 1.1 TODO (Zsets, Integer encoding, Append only journal)
+VERSION 1.2 TODO (Zsets, Integer encoding, Append only journal)
 ===============================================================
 
 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:
@@ -9,25 +9,21 @@ Most of the features already implemented for this release. The following is a li
 * Man pages for SRANDMEMBER, missing Z-commands, ...
 * Use strcoll() to compare objects in sorted sets, like it already happens for SORT.
 * Write docs for the "STORE" operaiton of SORT. Link to the article about SORT by written by defunkt.
-* Append only mode: testing and a command to rebuild the log from scratch.
 * ZRANGEBYSCORE test, ZRANGEBYSCORE LIMIT option.
 * Sorted sets infinity tests.
-* Instead to do the lamest thing of using getDecodedObject only if the encoding
-  of the object != REDIS_ENCODING_RAW, hack getDecodedObject in order to just
-  increment the reference count if the object is already RAW-encoded.
 
-VERSION 1.2 TODO (Hash type)
+VERSION 1.4 TODO (Hash type)
 ============================
 
 * Hashes (HSET, HGET, HEXISTS, HLEN, ...).
 * 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.
 
-VERSION 1.3 TODO (Virtual memory)
+VERSION 1.6 TODO (Virtual memory)
 =================================
 
 * Redis Virtual Memory for datasets bigger than RAM (http://groups.google.com/group/redis-db/msg/752997c7b38553cd)
 
-VERSION 1.4 TODO (Fault tollerant sharding)
+VERSION 1.8 TODO (Fault tollerant sharding)
 ===========================================
 
 * Redis-cluster, a fast intermediate layer (proxy) that implements consistent hashing and fault tollerant nodes handling.
@@ -36,7 +32,7 @@ Interesting readings about this:
 
     - http://ayende.com/Blog/archive/2009/04/06/designing-rhino-dht-a-fault-tolerant-dynamically-distributed-hash.aspx
 
-VERSION 1.5 TODO (Optimizations and latency)
+VERSION 2.0 TODO (Optimizations and latency)
 ============================================
 
 * Lower the CPU usage.
@@ -44,9 +40,17 @@ VERSION 1.5 TODO (Optimizations and latency)
 * Use epool and alike to rewrite ae.c for Linux and other platforms suppporting fater-than-select() mutiplexing APIs.
 * Implement an UDP interface for low-latency GET/SET operations.
 
+VERSION 2.2 TODO (Optimizations and latency)
+============================================
+
+* 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.
+
 SHORT/LONG TERM RANDOM TODO ITEMS
 =================================
 
+ * FORK command (fork()s executing the commands received by the current
+   client in the new process). Hint: large SORTs can use more cores,
+   copy-on-write will avoid memory problems.
  * SORT: Don't copy the list into a vector when BY argument is constant.
  * 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.
  * LOCK / TRYLOCK / UNLOCK as described many times in the google group