]>
Commit | Line | Data |
---|---|---|
1 | Redis TODO and Roadmap | |
2 | ---------------------- | |
3 | ||
4 | VERSION 2.2 TODO (Optimizations and latency) | |
5 | ============================================ | |
6 | ||
7 | * Support for syslog(3). | |
8 | * Change the implementation of ZCOUNT to use the augmented skiplist in order to be much faster. | |
9 | ||
10 | VM TODO | |
11 | ======= | |
12 | ||
13 | * Use multiple open FDs against the VM file, one for thread. | |
14 | * 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. | |
15 | ||
16 | STRING COMMANDS | |
17 | =============== | |
18 | ||
19 | * Implement STRLEN, PEEK, POKE, SETBIT, GETBIT | |
20 | ||
21 | OTHER IMPORTANT THINGS THAT WILL BE ADDED BUT I'M NOT SURE WHEN | |
22 | =============================================================== | |
23 | ||
24 | BIG ONES: | |
25 | ||
26 | * BRPOPLPUSH | |
27 | * Specially encoded memory-saving integer sets. | |
28 | * A command to export a JSON dump (there should be mostly working patch needing major reworking). | |
29 | * Specially encoded sets of integers (this includes a big refactoring providing an higher level layer for Sets manipulation) | |
30 | ||
31 | SMALL ONES: | |
32 | ||
33 | * If sizeof(double) == sizeof(void*) we could store the double value of sorted sets directly in place of the pointer instead of allocating it in the heap. | |
34 | * Delete on writes against expire policy should only happen after argument parsing for commands doing their own arg parsing stuff. | |
35 | * Give errors when incrementing a key that does not look like an integer, when providing as a sorted set score something can't be parsed as a double, and so forth. | |
36 | * MSADD (n keys) (n values). See this thread in the Redis google group: http://groups.google.com/group/redis-db/browse_thread/thread/e766d84eb375cd41 | |
37 | * Don't save empty lists / sets / zsets on disk with snapshotting. | |
38 | * Remove keys when a list / set / zset reaches length of 0. | |
39 | * An option to exec a command slave-side if the master connection is lost: even cooler: if the script returns "0" the slave elects itself as master, otherwise continue trying to reconnect. | |
40 | * PING the master from time to time to check if it's gone. | |
41 | ||
42 | THE "MAYBE" TODO LIST: things that may or may not get implemented | |
43 | ================================================================= | |
44 | ||
45 | Most of this can be seen just as proposals, the fact they are in this list | |
46 | it's not a guarantee they'll ever get implemented ;) | |
47 | ||
48 | * SORT: Don't copy the list into a vector when BY argument is constant. | |
49 | * 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. | |
50 | * 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. | |
51 | * Read-only mode. | |
52 | * Kill the delete-on-write behavior of expires, replicating DELs | |
53 | * Multiple BY in SORT. | |
54 | ||
55 | KNOWN BUGS | |
56 | ========== | |
57 | ||
58 | * LRANGE and other commands are using 32 bit integers for ranges, and overflows are not detected. So LRANGE mylist 0 23498204823094823904823904 will have random effects. |