[redis.git] / TODO

BEFORE REDIS 1.0.0-rc1

 * Add number of keys for every DB in INFO
 * maxmemory 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
 * 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.
 * 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
 * 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

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