-BEFORE REDIS 1.0.0-rc1
+Redis TODO and Roadmap
- * Add number of keys for every DB in INFO
- * Resize the expires and Sets hash tables if needed as well? For Sets the right moment to check for this is probably in SREM
- * check 'server.dirty' everywere. Make it proprotional to the number of objects modified.
- * Cover most of the source code with test-redis.tcl
- * Remove tmp-.... files when saving child exits in the wrong way, to do so use tmp-pid.rdb as filename so that the parent can rebuild the file name just from the child pid.
+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:
- * Consistent hashing implemented in all the client libraries having an user base
+* 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.
- * SORT ... STORE keyname. Instead to return the SORTed data set it into key.
- * Profiling and optimization in order to limit the CPU usage at minimum
* 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
- * some kind of sorted type, example:
- ZADD mykey foo 100
- ZADD mykey bar 50
- ZRANGE mykey 0 1 => bar foo
- This is able to take elements sorted because a binary tree is used to store
- the elements by 'score', with the actual value being the key. On the other
- side the type also takes an hash table with key->score mapping, so that when
- there is an update we lookup the current score and can traverse the tree.
- * BITMAP type
- * LRANGE 4 0 should return the same elements as LRANGE 0 4 but in reverse order (only if we get enough motivated requests about it)
+ * 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.
-
-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.
+ * Read-only mode.