[redis.git] / TODO

BEFORE REDIS 1.0.0-rc1

 * 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
 * What happens if the saving child gets killed or segfaults instead of ending normally? Handle this.
 * check 'server.dirty' everywere. Make it proprotional to the number of objects modified.
 * 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.
 * 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
 * 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)
 * 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.
Commit	Line	Data
0c66a471	1	BEFORE REDIS 1.0.0-rc1
0c66a471	2
391b4a60	3	* Add number of keys for every DB in INFO
391b4a60	4	* Resize the expires and Sets hash tables if needed as well? For Sets the right moment to check for this is probably in SREM
391b4a60	5	* What happens if the saving child gets killed or segfaults instead of ending normally? Handle this.
0b420168	6	* check 'server.dirty' everywere. Make it proprotional to the number of objects modified.
391b4a60	7	* 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.
391b4a60	8	* Make sure to convert all the fstat() calls to 64bit versions.
391b4a60	9	* Cover most of the source code with test-redis.tcl
0c66a471	10
f2923bec	11	AFTER 1.0 stable release
f2923bec	12
391b4a60	13	* Consistent hashing implemented in all the client libraries having an user base
d214bb48	14	* SORT: Don't copy the list into a vector when BY argument is constant.
d214bb48	15	* SORT ... STORE keyname. Instead to return the SORTed data set it into key.
391b4a60	16	* Profiling and optimization in order to limit the CPU usage at minimum
	17	* 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.
	18	* Elapsed time in logs for SAVE when saving is going to take more than 2 seconds
	19	* LOCK / TRYLOCK / UNLOCK as described many times in the google group
	20	* Replication automated tests
a56785f7	21	* some kind of sorted type, example:
	22	ZADD mykey foo 100
	23	ZADD mykey bar 50
	24	ZRANGE mykey 0 1 => bar foo
	25	This is able to take elements sorted because a binary tree is used to store
	26	the elements by 'score', with the actual value being the key. On the other
	27	side the type also takes an hash table with key->score mapping, so that when
	28	there is an update we lookup the current score and can traverse the tree.
	29	* BITMAP type
ec93bba3	30	* 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)
ec93bba3	31	* 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	32
0c66a471	33	FUTURE HINTS
0c66a471	34
f2923bec	35	- 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.