X-Git-Url: https://git.saurik.com/redis.git/blobdiff_plain/a4460ef43f9625e6c09cdc327614d1b47c043489..6e09ad1c156f10246ccd0f2de5b11a9635e28818:/TODO diff --git a/TODO b/TODO index e236352c..145ec524 100644 --- a/TODO +++ b/TODO @@ -1,28 +1,45 @@ -BEFORE REDIS 1.0.0-rc1 - -- SMOVE _key1_ _key2_ _ele_. Pop an element form _key1_ and push (SADD or LPUSH) it nto _key2_. -- What happens if the saving child gets killed instead to end normally? Handle this. -- Make sinterstore / unionstore / sdiffstore returning the cardinality of the resulting set. -- Remove max number of args limit -- network layer stresser in test in demo, make sure to set/get random streams of data and check that what we read back is byte-by-byte the same. -- maxclients directive -- check 'server.dirty' everywere -- replication automated tests -- an external tool able to perform the 'difference' between two Redis servers. It's like 'diff', but against Redis servers, and the output is the set of commands needed to turn the first server into the second, suitable to be sent via netcat. - $ ./redis-diff 192.168.1.1 192.168.1.2 > diff.txt - $ cat diff.txt | nc 192.168.1.1 6379 - $ ./redis-diff 192.168.1.1 192.168.1.2 - $ # No output now the servers are identical - -This command should be smart and don't use too much memory, that is, take two connections at the same time against the two servers and perform the comparison key by key. Probably the initial "KEYS *" is unavoidable. - -- Shutdown must kill other background savings before to start saving. Otherwise the DB can get replaced by the child that rename(2) after the parent for some reason. -- Add missing commands in documentation -- Document replication -- Objects sharing configuration, add the directive "objectsharingpool " -- Make sure to convert all the fstat() calls to 64bit versions. -- SINTERCOUNT, SUNIONCOUNT, SDIFFCOUNT - -FUTURE HINTS - -- 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. +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?