[redis.git] / TODO

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, ...
* 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.

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

* 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
 * 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)
Commit	Line	Data
23cff1a8	1	VERSION 1.1 TODO
f6b141c5	2
f6b141c5	3	* 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".
23cff1a8	4	* Man pages for MSET MSETNX and SRANDMEMBER, Z-commands, ...
d7f43c08	5	* ZSETs missing stuff: ZINCRBY
d13f767c	6	* Add all the missing symbols for the statis functions into the table. This backtrace on segfault is indeed very useful.
	7	* Use strcoll() to compare objects in sorted sets, like it already happens for SORT.
	8	* LMOVE, as discussed in the Redis group.
23cff1a8	9
	10	VERSION 1.2 TODO
	11
d13f767c	12	* Basic Redis-cluster (at least all the features of the Ruby client distribute implementation + ability to set every key in M nodes).
23cff1a8	13	* Hashes (HSET, HGET, HEXISTS, HLEN, ...).
cb7e07cc	14	* 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.
f6b141c5	15
23cff1a8	16	LONG TERM TODO
f6b141c5	17
f6b141c5	18	* 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.
a3b21203	19	* Add a command to inspect the currently selected DB index
391b4a60	20	* Consistent hashing implemented in all the client libraries having an user base
d214bb48	21	* SORT: Don't copy the list into a vector when BY argument is constant.
d214bb48	22	* SORT ... STORE keyname. Instead to return the SORTed data set it into key.
391b4a60	23	* Profiling and optimization in order to limit the CPU usage at minimum
	24	* 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.
	25	* Elapsed time in logs for SAVE when saving is going to take more than 2 seconds
	26	* LOCK / TRYLOCK / UNLOCK as described many times in the google group
	27	* Replication automated tests
557a74e5	28	* BITMAP / BYTEARRAY type?
ec93bba3	29	* 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.
f2923bec	30
0c66a471	31	FUTURE HINTS
0c66a471	32
23cff1a8	33	- 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)