X-Git-Url: https://git.saurik.com/redis.git/blobdiff_plain/2c65cbc9e3aa3ff189de3bfe207f4ee8f75edecb..faa2a80f89b5a3cd35812e71893d812e2877ed2e:/TODO?ds=inline diff --git a/TODO b/TODO index 39937d2b..dd6ba28b 100644 --- a/TODO +++ b/TODO @@ -1,33 +1,85 @@ -Pre 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. -* Hashes (HSET, HGET, HEXISTS, HLEN, ...). - -After 1.1 todo - -* Expiring algorithm should be adaptive, if there are a lot of keys with an expire set and many of this happen to be already expired it should be, proportionally, more aggressive. - * 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. - * SORT ... STORE keyname. Instead to return the SORTed data set it into key. - * 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 - * some kind of sorted type, example: - ZADD mykey foo 100 - ZADD mykey bar 50 - ZRANGE mykey 0 1 => bar foo - This is able to take elements sorted because a binary tree is used to store - the elements by 'score', with the actual value being the key. On the other - side the type also takes an hash table with key->score mapping, so that when - there is an update we lookup the current score and can traverse the tree. - * BITMAP / BYTEARRAY type? - * LRANGE 4 0 should return the same elements as LRANGE 0 4 but in reverse order (only if we get enough motivated requests about it) - * 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. +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 + + +API CHANGES +=========== + +* Turn commands into variadic versions when it makes sense, that is, when + the variable number of arguments represent values, and there is no conflict + with the return value of the command. + +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?). + +APPEND ONLY FILE +================ + +* in AOF rewirte use HMSET to rewrite small hashes instead of multiple calls + to HSET. + +OPTIMIZATIONS +============= + +* Avoid COW due to incrementing the dict iterators counter. +* 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. + +REPORTING +========= + +* Better INFO output with sections. + +RANDOM +====== + +* Clients should be closed as far as the output buffer list is bigger than a given number of elements (configurable in redis.conf) +* Should the redis default configuration, and the default redis.conf, just bind 127.0.0.1? + +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. +* #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 undoubltly greater than + the replication link latency we should expire this key on the slave on + access? + +DISKSTORE TODO +============== + +* Fix FLUSHALL/FLUSHDB: the queue of pending reads/writes should be handled. +* Check that 00/00 and ff/ff exist at startup, otherwise exit with error. +* Implement sync flush option, where data is written synchronously on disk when a command is executed. +* Implement MULTI/EXEC as transaction abstract API to diskstore.c, with transaction_start, transaction_end, and a journal to recover. +* Stop BGSAVE thread on shutdown and any other condition where the child is killed during normal bgsave. +* Fix RANDOMKEY to really do something interesting +* Fix DBSIZE to really do something interesting +* Add a DEBUG command to check if an entry is or not in memory currently +* dscache.c near 236, kobj = createStringObject... we could use static obj.