X-Git-Url: https://git.saurik.com/redis.git/blobdiff_plain/c08f173487ca9e4a24b652e0e1c5391f8b5b8bd2..6e09ad1c156f10246ccd0f2de5b11a9635e28818:/TODO?ds=inline diff --git a/TODO b/TODO index 70db8357..145ec524 100644 --- a/TODO +++ b/TODO @@ -1,32 +1,45 @@ -VERSION 1.1 TODO - -* 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, Z-commands, ... -* Use strcoll() to compare objects in sorted sets, like it already happens for SORT. -* RPOPLPUSH, EXPIRE, EXPIREAT, ZSCORE, SRANDMEMBER tests. -* Write docs for the "STORE" operaiton of SORT, and GET "#" option. -* Append only mode: testing and a command to rebuild the log from scratch. -* Redis-cli should be able to select a different DB than 0 using some switch. - -VERSION 1.2 TODO - -* Basic Redis-cluster (at least all the features of the Ruby client distribute implementation + ability to set every key in M nodes). -* 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. - -LONG TERM TODO - - * 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. - * 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 - * BITMAP / BYTEARRAY 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. (Note, Redis 1.1 beta already has this feature actually, but is for now only used to compress strings representing integers) +Redis TODO +---------- + +WARNING: are you a possible Redis contributor? + Before implementing what is listed in this file + please drop a message in the Redis google group or chat with + antirez or pietern on irc.freenode.org #redis to check if the work + is already in progress and if the feature is still interesting for + us, and *how* exactly this can be implemented to have good changes + of a merge. Otherwise it is probably wasted work! Thank you + + +CLUSTER +======= + +* Implement rehashing and cluster check in redis-trib. +* Reimplement MIGRATE / RESTORE to use just in memory buffers (no disk at + all). This will require touching a lot of the RDB stuff around, but we may + hand with faster persistence for RDB. +* Implement the slave nodes semantics and election. +* Allow redis-trib to create a cluster-wide snapshot (using SYNC). +* Allow redis-trib to restore a cluster-wide snapshot (implement UPLOAD?). + +SCRIPTING +========= + +* SCRIPT FLUSH or alike to start a fresh interpreter? + +OPTIMIZATIONS +============= + +* 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. +* Read-only mode for slaves. +* Redis big lists as linked lists of small ziplists? + Possibly a simple heuristic that join near nodes when some node gets smaller than the low_level, and split it into two if gets bigger than high_level. + +KNOWN BUGS +========== + +* #519: Slave may have expired keys that were never read in the master (so a DEL + is not sent in the replication channel) but are already expired since + a lot of time. Maybe after a given delay that is undoubtably greater than + the replication link latency we should expire this key on the slave on + access?