From bb8716b6dc6980415da8b40b46ffb6e637f33a6c Mon Sep 17 00:00:00 2001 From: antirez Date: Thu, 1 Jul 2010 14:52:01 +0200 Subject: [PATCH] TODO updated --- TODO | 29 ++++++++++------------------- 1 file changed, 10 insertions(+), 19 deletions(-) diff --git a/TODO b/TODO index 30963848..4fcdb18f 100644 --- a/TODO +++ b/TODO @@ -5,25 +5,25 @@ VERSION 2.2 TODO (Optimizations and latency) ============================================ * Support for syslog(3). -* Implement an UDP interface for low-latency operations. - -VERSION 2.x TODO -================ - -* BRPOPLPUSH -* Save dataset / fsync() on SIGTERM * Change the implementation of ZCOUNT to use the augmented skiplist in order to be much faster. -Virtual Memory optimizations: +VM TODO +======= + * Use multiple open FDs against the VM file, one for thread. * Check what happens performance-wise if instead of creating threads again and again the same threads are reused forever. Note: this requires a way to disable this clients in the child, but waiting for empty new jobs queue can be enough. -* Implement LEN, PEEK, POKE, SETBIT, GETBIT + +STRING COMMANDS +=============== + +* Implement STRLEN, PEEK, POKE, SETBIT, GETBIT OTHER IMPORTANT THINGS THAT WILL BE ADDED BUT I'M NOT SURE WHEN =============================================================== BIG ONES: +* BRPOPLPUSH * Specially encoded memory-saving integer sets. * A command to export a JSON dump (there should be mostly working patch needing major reworking). * Specially encoded sets of integers (this includes a big refactoring providing an higher level layer for Sets manipulation) @@ -45,20 +45,11 @@ THE "MAYBE" TODO LIST: things that may or may not get implemented Most of this can be seen just as proposals, the fact they are in this list it's not a guarantee they'll ever get implemented ;) -* Move dict.c from hash table to skip list, in order to avoid the blocking resize operation needed for the hash table. -* FORK command (fork()s executing the commands received by the current - client in the new process). Hint: large SORTs can use more cores, - copy-on-write will avoid memory problems. -* DUP command? DUP srckey dstkey, creates an exact clone of srckey value in dstkey. * SORT: Don't copy the list into a vector when BY argument is constant. * 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. -* LOCK / TRYLOCK / UNLOCK as described many times in the google group -* Replication automated tests * Byte Array type (BA prefixed commands): BASETBIT BAGETBIT BASETU8 U16 U32 U64 S8 S16 S32 S64, ability to atomically INCRBY all the base types. BARANGE to get a range of bytes as a bulk value, BASETRANGE to set a range of bytes. -* 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. Already done for Mac OS X. * Read-only mode. -* Pattern-matching replication. -* Add an option to relax the delete-expiring-keys-on-write semantic *denying* replication and AOF when this is on? Can be handy sometimes, when using Redis for non persistent state, but can create problems. For instance should rename and move also "move" the timeouts? How does this affect other commands? +* Kill the delete-on-write behavior of expires, replicating DELs * Multiple BY in SORT. KNOWN BUGS -- 2.47.2