]> git.saurik.com Git - redis.git/blame - TODO
added function that preloads all keys needed to execute a MULTI/EXEC block
[redis.git] / TODO
CommitLineData
f284d963 1Redis TODO and Roadmap
2
6766f45e 3VERSION 2.0 TODO
4================
23cff1a8 5
b177fd30 6* BRPOPLPUSH
09f6f702 7* List ops like L/RPUSH L/RPOP should return the new list length.
b177fd30 8* Save dataset / fsync() on SIGTERM
b0d8747d 9* MULTI/EXEC should support the "EXEC FSYNC" form?
b177fd30 10* BLPOP & C. tests (write a non blocking Tcl client as first step)
7c775e09 11* Once ZRANK is implemented, change the implementation of ZCOUNT to use the augmented skiplist in order to be much faster.
12* Write doc for ZCOUNT, and for open / closed intervals of sorted sets range operations.
f6b141c5 13
f870935d 14Virtual Memory sub-TODO:
b0d8747d 15* Check if the page selection algorithm is working well
f870935d 16* Divide swappability of objects by refcount
7c775e09 17* Use multiple open FDs against the VM file, one for thread.
b72f6a4b 18* vm-min-age <seconds> option
d5d55fc3 19* Make sure objects loaded from the VM are specially encoded when possible.
478c2c6f 20* Check what happens performance-wise if instead to create 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.
9693e4f0 21* Sets of integers are slow to load, for a number of reasons. Fix it. (use slow_sets.rdb file for debugging). (p.s. this was now partially fixed).
22* On EXEC try to block the client until relevant keys are loaded.
f870935d 23
6766f45e 24* Hashes (GET/SET/DEL/INCRBY/EXISTS/FIELDS/LEN/MSET/MGET). Special encoding for hashes with less than N elements.
25* Write documentation for APPEND
a97b9060 26* Implement LEN, PEEK, POKE, SETBIT, GETBIT
7d65b33d 27
b0d8747d 28VERSION 2.2 TODO (Fault tolerant sharding)
c35f7d5b 29===========================================
7d65b33d 30
c35f7d5b 31* Redis-cluster, a fast intermediate layer (proxy) that implements consistent hashing and fault tollerant nodes handling.
7d65b33d 32
5b2a1c29 33Interesting readings about this:
34
35 - http://ayende.com/Blog/archive/2009/04/06/designing-rhino-dht-a-fault-tolerant-dynamically-distributed-hash.aspx
36
b0d8747d 37VERSION 2.4 TODO (Optimizations and latency)
c35f7d5b 38============================================
7d65b33d 39
40* Lower the CPU usage.
41* Lower the RAM usage everywhere possible.
42* Use epool and alike to rewrite ae.c for Linux and other platforms suppporting fater-than-select() mutiplexing APIs.
43* Implement an UDP interface for low-latency GET/SET operations.
44
3f477979 45OTHER IMPORTANT THINGS THAT WILL BE ADDED BUT I'M NOT SURE WHEN
46===============================================================
47
48BIG ONES:
49
50* Specially encoded memory-saving integer sets.
51* A command to export a JSON dump (there should be mostly working patch needing major reworking).
f0c138f6 52* Specially encoded sets of integers (this includes a big refactoring providing an higher level layer for Sets manipulation)
3f477979 53
54SMALL ONES:
55
ada386b2 56* 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.
978c2c94 57* Delete on writes against expire policy should only happen after argument parsing for commands doing their own arg parsing stuff.
3f477979 58* 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.
25e52257 59* MSADD (n keys) (n values). See this thread in the Redis google group: http://groups.google.com/group/redis-db/browse_thread/thread/e766d84eb375cd41
f0c138f6 60* Don't save empty lists / sets / zsets on disk with snapshotting.
61* Remove keys when a list / set / zset reaches length of 0.
5921aa36 62* 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.
3ea27d37 63* PING the master from time to time to check if it's gone.
3f477979 64
f0c138f6 65THE "MAYBE" TODO LIST: things that may or may not get implemented
66=================================================================
f6b141c5 67
0188805d 68Most of this can be seen just as proposals, the fact they are in this list
69it's not a guarantee they'll ever get implemented ;)
70
57033301 71* Move dict.c from hash table to skip list, in order to avoid the blocking resize operation needed for the hash table.
682ac724 72* FORK command (fork()s executing the commands received by the current
73 client in the new process). Hint: large SORTs can use more cores,
74 copy-on-write will avoid memory problems.
75* DUP command? DUP srckey dstkey, creates an exact clone of srckey value in dstkey.
76* SORT: Don't copy the list into a vector when BY argument is constant.
77* 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.
78* LOCK / TRYLOCK / UNLOCK as described many times in the google group
79* Replication automated tests
80* 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.
81* 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.
82* Read-only mode.
83* Pattern-matching replication.
ac945e2d 84* 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?
f0c138f6 85* Multiple BY in SORT.