TODO updated

[redis.git] / TODO

diff --git a/TODO b/TODO
index 23ec0422b022bb73ee92629239be0931959dc224..7a9b70745d5b5f06dd77015242f9fe3d10c2a109 100644 (file)
--- a/TODO
+++ b/TODO
@@ -1,54 +1,53 @@
 Redis TODO and Roadmap
 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:
-
-* Document "masterauth" in redis.conf, also merge the other related patch if it seems a safe one.
-
-VERSION 1.4 TODO (Hash type)
-============================
-
-* Hashes (HSET, HGET, HEXISTS, HLEN, ...).
-* Specially encoded memory-saving integer sets.
-* 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.
-* List ops like L/RPUSH L/RPOP should return the new list length.
-
-VERSION 1.6 TODO (Virtual memory)
-=================================
+VERSION 2.2 TODO (Optimizations and latency)
+============================================

 
 

-* Redis Virtual Memory for datasets bigger than RAM (http://groups.google.com/group/redis-db/msg/752997c7b38553cd)
+* Lower the CPU usage.
+* Lower the RAM usage everywhere possible.
+* Specially encoded Sets (like Hashes).
+* Implement an UDP interface for low-latency operations.
+* What about a special coding that is about storing the "rdb" serialized format instead of the actual value? This can be used when we have LRU in order to super-compress data into memory, for data not accessed frequetly. It's a VM-alike strategy but fully in memory, may reduce the space to hold some dataset in an impressive way. Trivial to implement.

 
 

-VERSION 1.8 TODO (Fault tollerant sharding)
-===========================================
+VERSION 2.x TODO
+================

 
 

-* Redis-cluster, a fast intermediate layer (proxy) that implements consistent hashing and fault tollerant nodes handling.
+* BRPOPLPUSH
+* Save dataset / fsync() on SIGTERM
+* Change the implementation of ZCOUNT to use the augmented skiplist in order to be much faster.

 
 

-Interesting readings about this:
+Virtual Memory optimizations:
+* Use multiple open FDs against the VM file, one for thread.
+* Check what happens performance-wise if instead of creating threads again and again the same threads are reused forever. Note: this requires a way to disable this clients in the child, but waiting for empty new jobs queue can be enough.
+* Implement LEN, PEEK, POKE, SETBIT, GETBIT

 
 

-    - http://ayende.com/Blog/archive/2009/04/06/designing-rhino-dht-a-fault-tolerant-dynamically-distributed-hash.aspx
+OTHER IMPORTANT THINGS THAT WILL BE ADDED BUT I'M NOT SURE WHEN
+===============================================================

 
 

-VERSION 2.0 TODO (Optimizations and latency)
-============================================
+BIG ONES:

 
 

-* 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.
+* Specially encoded memory-saving integer sets.
+* A command to export a JSON dump (there should be mostly working patch needing major reworking).
+* Specially encoded sets of integers (this includes a big refactoring providing an higher level layer for Sets manipulation)

 
 

-VERSION 2.2 TODO (Optimizations and latency)
-============================================
+SMALL ONES:

 
 

-* 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.
+* If sizeof(double) == sizeof(void*) we could store the double value of sorted sets directly in place of the pointer instead of allocating it in the heap.
+* Delete on writes against expire policy should only happen after argument parsing for commands doing their own arg parsing stuff.
+* Give errors when incrementing a key that does not look like an integer, when providing as a sorted set score something can't be parsed as a double, and so forth.
+* MSADD (n keys) (n values). See this thread in the Redis google group: http://groups.google.com/group/redis-db/browse_thread/thread/e766d84eb375cd41
+* Don't save empty lists / sets / zsets on disk with snapshotting.
+* Remove keys when a list / set / zset reaches length of 0.
+* An option to exec a command slave-side if the master connection is lost: even cooler: if the script returns "0" the slave elects itself as master, otherwise continue trying to reconnect.
+* PING the master from time to time to check if it's gone.

 
 

-SHORT/LONG TERM RANDOM TODO ITEMS
-=================================
+THE "MAYBE" TODO LIST: things that may or may not get implemented
+=================================================================

 
 Most of this can be seen just as proposals, the fact they are in this list
 it's not a guarantee they'll ever get implemented ;)
 
 
 Most of this can be seen just as proposals, the fact they are in this list
 it's not a guarantee they'll ever get implemented ;)
 

-* Give errors when incrementing a key that does not look like an integer, when providing as a sorted set score something can't be parsed as a double, and so forth.

 * Move dict.c from hash table to skip list, in order to avoid the blocking resize operation needed for the hash table.
 * FORK command (fork()s executing the commands received by the current
   client in the new process). Hint: large SORTs can use more cores,
 * Move dict.c from hash table to skip list, in order to avoid the blocking resize operation needed for the hash table.
 * FORK command (fork()s executing the commands received by the current
   client in the new process). Hint: large SORTs can use more cores,


@@ -62,12 +61,5 @@ it's not a guarantee they'll ever get implemented ;)
 * 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. Already done for Mac OS X.
 * Read-only mode.
 * Pattern-matching replication.
 * 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. Already done for Mac OS X.
 * Read-only mode.
 * Pattern-matching replication.

-* Dont' safe empty lists / sets / zsets on disk with snapshotting.
-* Remove keys when a list / set / zset reaches length of 0.
-
-DOCUMENTATION WISHLIST
-======================
-
-* Page explaining tips to reduce memory usage.
-* A Sorted sets HOWTO
-
+* Add an option to relax the delete-expiring-keys-on-write semantic *denying* replication and AOF when this is on? Can be handy sometimes, when using Redis for non persistent state, but can create problems. For instance should rename and move also "move" the timeouts? How does this affect other commands?
+* Multiple BY in SORT.