X-Git-Url: https://git.saurik.com/redis.git/blobdiff_plain/5446315f29fd5eed3aaa2a16a9bcc8f882d67e8c..120b9ba8f82699f1987be17ccde597bcfa9fae46:/TODO diff --git a/TODO b/TODO index 27102e01..9e6b0561 100644 --- a/TODO +++ b/TODO @@ -1,32 +1,44 @@ -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. -* Tests for: EXPIREAT, ZSCORE, ZINCRBY, SRANDMEMBER, SORT with #. -* 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 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 + +VM TODO +======= + +* 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. +* mmap the swap file. +* Use just a single IO Job to swap out a key, and add a mutex so that pages in the page table can be marked as used and scanned from the thread itself. + +REPLICATION +=========== + +* PING between master and slave from time to time, so we can subject the +master-slave link to timeout, and detect when the connection is gone even +if the socket is still up. + +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. + +KNOWN BUGS +========== + +* What happens in the following scenario: + 1) We are reading an AOF file. + 2) SETEX FOO 5 BAR + 3) APPEND FOO ZAP + What happens if between 1 and 2 for some reason (system under huge load + or alike) too many time passes? We should prevent expires while the + AOF is loading. +