epoll support enabled by default for Linux builds

[redis.git] / TODO

diff --git a/TODO b/TODO
index 531b9738c0f5bf8e93f1c6a78098d2c19c96700f..528e833b02daa538dd316f6e4de6c8936e96ff16 100644 (file)
--- a/TODO
+++ b/TODO
@@ -1,31 +1,51 @@
-Pre 1.1 todo
+VERSION 1.1 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:

 
 * For now only the last argument gets integer encoded, so make sure that: 1) every multi bulk commands implemented will have the last arg that is indeed a value, and not used otherwise. 2) to explicitly call the function to encode the object in MSET and other commands where there are multiple "values".
 
 * For now only the last argument gets integer encoded, so make sure that: 1) every multi bulk commands implemented will have the last arg that is indeed a value, and not used otherwise. 2) to explicitly call the function to encode the object in MSET and other commands where there are multiple "values".

+* Man pages for MSET MSETNX and 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.
+* Support for epool in ae.c.
+
+VERSION 1.2 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)
+=================================
+
+* Redis Virtual Memory for datasets bigger than RAM (http://groups.google.com/group/redis-db/msg/752997c7b38553cd)
+
+VERSION 1.4 TODO (Fault tollerant sharding)
+===========================================
+
+* Redis-cluster, a fast intermediate layer (proxy) that implements consistent hashing and fault tollerant nodes handling.

 
 

-After 1.1 todo
+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)
+============================================
+
+* 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.
+
+SHORT/LONG TERM RANDOM TODO ITEMS
+=================================

 
 

-* Expiring algorithm should be adaptive, if there are a lot of keys with an expire set and many of this happen to be already expired it should be, proportionally, more aggressive.
- * Add a command to inspect the currently selected DB index
- * Consistent hashing implemented in all the client libraries having an user base

  * SORT: Don't copy the list into a vector when BY argument is constant.
  * 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.
  * 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

- * 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 / BYTEARRAY 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.
  * 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.