more tests in test-redis.tcl, some minor fix

[redis.git] / TODO

diff --git a/TODO b/TODO
index 52bd9ffb279522be2edc1fff01c7a72a2ccda756..64fa91afcdcd64fc3b2205d5f3680c93b0bd7470 100644 (file)
--- a/TODO
+++ b/TODO
@@ -1,30 +1,56 @@
-BEFORE REDIS 1.0.0-rc1
-
- * S*STORE should allow as dest key one of the source keys
- * Warning if using default config, with hint about 'redis-server redis.conf'
- * Add number of keys for every DB in INFO
- * maxmemory support
- * maxclients support
- * Resize the expires and Sets hash tables if needed as well? For Sets the right moment to check for this is probably in SREM
- * TTL command that returns -1 if a key is not volatile otherwise the time to live of a volatile key in seconds.
- * 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.
- * check 'server.dirty' everywere
- * 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. Child should trap the signal and remove the temp file name.
- * Objects sharing configuration, add the directive `objectsharingpool <size>`
- * Make sure to convert all the fstat() calls to 64bit versions.
- * Cover most of the source code with test-redis.tcl
-
-AFTER 1.0 stable release
-
- * Consistent hashing implemented in all the client libraries having an user base
- * Use partial qsort for SORT + LIMIT. Don't copy the list into a vector when BY argument is constant.
- * Profiling and optimization in order to limit the CPU usage at minimum
+Redis TODO and Roadmap
+
+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:
+
+* 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.
+
+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.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.
  * 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.

- * Elapsed time in logs for SAVE when saving is going to take more than 2 seconds

  * LOCK / TRYLOCK / UNLOCK as described many times in the google group
  * Replication automated tests
  * LOCK / TRYLOCK / UNLOCK as described many times in the google group
  * Replication automated tests

-
-FUTURE HINTS
-
-- 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.
+ * 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.