[redis.git] / TODO

BEFORE REDIS 1.0.0-rc1

 * S*STORE should allow as dest key one of the source keys
 * Warning if using default config, with hint about 'redis-server redis.conf'
 * Add number of keys for every DB in INFO
 * maxmemory support
 * maxclients support
 * Resize the expires and Sets hash tables if needed as well? For Sets the right moment to check for this is probably in SREM
 * TTL command that returns -1 if a key is not volatile otherwise the time to live of a volatile key in seconds.
 * What happens if the saving child gets killed or segfaults instead of ending normally? Handle this.
 * Make sinterstore / unionstore / sdiffstore returning the cardinality of the resulting set.
 * check 'server.dirty' everywere
 * 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. Child should trap the signal and remove the temp file name.
 * Objects sharing configuration, add the directive `objectsharingpool <size>`
 * Make sure to convert all the fstat() calls to 64bit versions.
 * Cover most of the source code with test-redis.tcl

AFTER 1.0 stable release

 * 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

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.
Commit	Line	Data
0c66a471	1	BEFORE REDIS 1.0.0-rc1
0c66a471	2
75fd597d	3	* S*STORE should allow as dest key one of the source keys
74077975	4	* Warning if using default config, with hint about 'redis-server redis.conf'
391b4a60	5	* Add number of keys for every DB in INFO
	6	* maxmemory support
	7	* maxclients support
	8	* Resize the expires and Sets hash tables if needed as well? For Sets the right moment to check for this is probably in SREM
	9	* TTL command that returns -1 if a key is not volatile otherwise the time to live of a volatile key in seconds.
	10	* What happens if the saving child gets killed or segfaults instead of ending normally? Handle this.
	11	* Make sinterstore / unionstore / sdiffstore returning the cardinality of the resulting set.
	12	* check 'server.dirty' everywere
	13	* 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. Child should trap the signal and remove the temp file name.
	14	* Objects sharing configuration, add the directive `objectsharingpool <size>`
	15	* Make sure to convert all the fstat() calls to 64bit versions.
	16	* Cover most of the source code with test-redis.tcl
0c66a471	17
f2923bec	18	AFTER 1.0 stable release
f2923bec	19
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
f2923bec	28
0c66a471	29	FUTURE HINTS
0c66a471	30
f2923bec	31	- 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.