Changelog updated

[redis.git] / TODO

diff --git a/TODO b/TODO
index 4c932d34f385a91967f56ae3d2ed22f9b4f4fbde..22b278a9e93b508ff1b1ccb63b1fbe0bf52f32de 100644 (file)
--- a/TODO
+++ b/TODO
@@ -1,23 +1,57 @@
-BEFORE REDIS 1.0.0-rc1
+Redis TODO and Roadmap
 
-- TTL command that returns -1 if a key is not volatile otherwise the time to live of a volatile key.
-- Remove max number of args limit
-- What happens if the saving child gets killed or segfaults instead of ending normally? Handle this.
-- Make sinterstore / unionstore / sdiffstore returning the cardinality of the resulting set.
-- maxclients directive
-- check 'server.dirty' everywere
-- replication automated tests
-- Shutdown must kill other background savings before to start saving. Otherwise the DB can get replaced by the child that rename(2) after the parent for some reason.
-- Document replication
-- Objects sharing configuration, add the directive "objectsharingpool <size>"
-- Make sure to convert all the fstat() calls to 64bit versions.
-- SINTERCOUNT, SUNIONCOUNT, SDIFFCOUNT
+VERSION 1.2 TODO (Zsets, Integer encoding, Append only journal)
+===============================================================
 
-AFTER 1.0 stable release
+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:
 
-- Use partial qsort for SORT + LIMIT
-- Locking primitives
+* Man pages for SRANDMEMBER, missing Z-commands, ...
+* Write docs for the "STORE" operaiton of SORT. Link to the article about SORT by written by defunkt.
+* ZRANGEBYSCORE LIMIT option and test.
 
-FUTURE HINTS
+VERSION 1.4 TODO (Hash type)
+============================
 
-- In memory compression: if in-memory values compression will be implemented, make sure to implement this so that addReply() is able to handle compressed objects, just creating an uncompressed version on the fly and adding this to the output queue instead of the original one. When insetad we need to look at the object string value (SORT BY for example), call a function that will turn the object into an uncompresed one.
+* 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.6 TODO (Virtual memory)
+=================================
+
+* Redis Virtual Memory for datasets bigger than RAM (http://groups.google.com/group/redis-db/msg/752997c7b38553cd)
+
+VERSION 1.8 TODO (Fault tollerant sharding)
+===========================================
+
+* Redis-cluster, a fast intermediate layer (proxy) that implements consistent hashing and fault tollerant nodes handling.
+
+Interesting readings about this:
+
+    - http://ayende.com/Blog/archive/2009/04/06/designing-rhino-dht-a-fault-tolerant-dynamically-distributed-hash.aspx
+
+VERSION 2.0 TODO (Optimizations and latency)
+============================================
+
+* Lower the CPU usage.
+* Lower the RAM usage everywhere possible.
+* 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
+ * Replication automated tests
+ * BYTEDARRAY type
+ * 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.
+ * Read-only mode.