X-Git-Url: https://git.saurik.com/redis.git/blobdiff_plain/96ffb2fe97c3e77879e7a4f6f7457397a18bf233..fc4ed4299bfad004a3230bf6af0de89281bb2d44:/TODO diff --git a/TODO b/TODO index 4fcdb18f..145ec524 100644 --- a/TODO +++ b/TODO @@ -1,58 +1,45 @@ -Redis TODO and Roadmap ----------------------- +Redis TODO +---------- -VERSION 2.2 TODO (Optimizations and latency) -============================================ +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 -* Support for syslog(3). -* Change the implementation of ZCOUNT to use the augmented skiplist in order to be much faster. -VM TODO +CLUSTER ======= -* 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 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?). -STRING COMMANDS -=============== +SCRIPTING +========= -* Implement STRLEN, PEEK, POKE, SETBIT, GETBIT +* SCRIPT FLUSH or alike to start a fresh interpreter? -OTHER IMPORTANT THINGS THAT WILL BE ADDED BUT I'M NOT SURE WHEN -=============================================================== - -BIG ONES: - -* 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) - -SMALL ONES: - -* 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. - -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 ;) +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. -* 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. +* 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 ========== -* 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. +* #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?