-- Protocol changes as discussed in the Redis group
-- keys expire
-- sunion ssub
-- write integers in a special way on disk, use the unused 11|.... length.
-- compact types for disk storing of short strings (no 4 bytes overhead!)
-- network layer stresser in test in demo
-- maxclients directive
-- check 'server.dirty' everywere
-- replication automated tests
-- a command, or an external tool, to perform the SHA1SUM of the whole dataset, so that if the dataset between two servers is identical, so will be the MD5SUM
-- an external tool able to perform the 'difference' between two Redis servers. It's like 'diff', but against Redis servers, and the output is the set of commands needed to turn the first server into the second, suitable to be sent via netcat.
+BEFORE REDIS 1.0.0-rc1
- $ ./redis-diff 192.168.1.1 192.168.1.2 > diff.txt
- $ cat diff.txt | nc 192.168.1.1 6379
- $ ./redis-diff 192.168.1.1 192.168.1.2
- $ # No output now the servers are identical
+ * 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
-This command should be smart and don't use too much memory, that is, take two connections at the same time against the two servers and perform the comparison key by key. Probably the initial "KEYS *" is unavoidable.
+AFTER 1.0 stable release
-- objects sharing, "objectsharing yes", "objectsharingpool 1024"
+ * 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
-* Include Lua and Perl bindings
+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.
projects / redis.git / blobdiff