-BEFORE REDIS 1.0.0-rc1
+VERSION 1.1 TODO
- * Add number of keys for every DB in INFO
- * Resize the expires and Sets hash tables if needed as well? For Sets the right moment to check for this is probably in SREM
- * check 'server.dirty' everywere. Make it proprotional to the number of objects modified.
- * Cover most of the source code with test-redis.tcl
+* 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, ...
+* ZSETs missing stuff: ZINCRBY
+* Add all the missing symbols for the statis functions into the table. This backtrace on segfault is indeed *very* useful.
+* Use strcoll() to compare objects in sorted sets, like it already happens for SORT.
+* LMOVE, as discussed in the Redis group.
-AFTER 1.0 stable release
+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).
+* Append mode log
+* 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
+
+* 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.
* 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 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)
+ * 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.
+- 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)
projects / redis.git / blobdiff