X-Git-Url: https://git.saurik.com/redis.git/blobdiff_plain/0b13687c25eda63a06296215f2da950f567801be..4d7e1255193702937daabf0dbaabbb6876bf5547:/TODO

diff --git a/TODO b/TODO
index 64fa91af..830149b3 100644
--- a/TODO
+++ b/TODO
@@ -1,56 +1,66 @@
 Redis TODO and Roadmap
+----------------------
 
-VERSION 1.2 TODO (Zsets, Integer encoding, Append only journal)
-===============================================================
+VERSION 2.2 TODO (Optimizations and latency)
+============================================
 
-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:
+* Support for syslog(3).
+* Change the implementation of ZCOUNT to use the augmented skiplist in order to be much faster.
+* Add an explicit test for MULTI/EXEC reloaded in the AOF.
+* Command table -> hash table, with support for command renaming
 
-* 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.
+VM TODO
+=======
 
-VERSION 1.4 TODO (Hash type)
-============================
+* 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.
 
-* 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.
+STRING COMMANDS
+===============
 
-VERSION 1.6 TODO (Virtual memory)
-=================================
+* Implement STRLEN, PEEK, POKE, SETBIT, GETBIT
 
-* Redis Virtual Memory for datasets bigger than RAM (http://groups.google.com/group/redis-db/msg/752997c7b38553cd)
+OTHER IMPORTANT THINGS THAT WILL BE ADDED BUT I'M NOT SURE WHEN
+===============================================================
 
-VERSION 1.8 TODO (Fault tollerant sharding)
-===========================================
+BIG ONES:
 
-* Redis-cluster, a fast intermediate layer (proxy) that implements consistent hashing and fault tollerant nodes handling.
+* BRPOPLPUSH
+* 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)
 
-Interesting readings about this:
+SMALL ONES:
 
-    - http://ayende.com/Blog/archive/2009/04/06/designing-rhino-dht-a-fault-tolerant-dynamically-distributed-hash.aspx
+* 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.
 
-VERSION 2.0 TODO (Optimizations and latency)
-============================================
+THE "MAYBE" TODO LIST: things that may or may not get implemented
+=================================================================
 
-* 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.
+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 ;)
 
-VERSION 2.2 TODO (Optimizations and latency)
-============================================
+* 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.
+* Byte Array type (BA prefixed commands): BASETBIT BAGETBIT BASETU8 U16 U32 U64 S8 S16 S32 S64, ability to atomically INCRBY all the base types. BARANGE to get a range of bytes as a bulk value, BASETRANGE to set a range of bytes.
+* Read-only mode.
+* Kill the delete-on-write behavior of expires, replicating DELs
+* Multiple BY in SORT.
+
+KNOWN BUGS
+==========
+
+* LRANGE and other commands are using 32 bit integers for ranges, and overflows are not detected. So LRANGE mylist 0 23498204823094823904823904 will have random effects.
+
+REDIS CLI TODO
+==============
 
-* 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.
+* Computer parsable output generation
+* Memoize return values so that they can be used later as arguments, like $1