]> git.saurik.com Git - redis.git/blame - TODO
Fixed VM corruption due to child fclosing the VM file directly or indirectly calling...
[redis.git] / TODO
CommitLineData
f284d963 1Redis TODO and Roadmap
2
2014c437 3VERSION 1.4 TODO (Hash type)
c35f7d5b 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)
f6b141c5 11
f870935d 12Virtual Memory sub-TODO:
b0d8747d 13* Check if the page selection algorithm is working well
f870935d 14* Divide swappability of objects by refcount
ec6c7a1d 15* it should be possible to give the vm-max-memory option in megabyte, gigabyte, ..., just using 2GB, 100MB, and so forth.
b0d8747d 16* Try to understand what can be moved into I/O threads that currently is instead handled by the main thread. For instance swapping file table scannig to find contiguous page could be a potential candidate (but I'm not convinced it's a good idea, better to improve the algorithm, for instance double the fast forward at every step?).
a544018d 17* Possibly decrRefCount() against swapped objects can be moved into I/O threads, as it's a slow operation against million elements list, and in general consumes CPU time that can be consumed by other threads (and cores).
b72f6a4b 18* EXISTS should avoid loading the object if possible without too make the code too specialized.
19* vm-min-age <seconds> option
d5d55fc3 20* Make sure objects loaded from the VM are specially encoded when possible.
478c2c6f 21* 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.
f870935d 22
a544018d 23* Hashes (GET/SET/DEL/INCRBY/EXISTS/FIELDS/LEN/MSET/MGET). Special encoding for hashes with < N keys.
7d65b33d 24
b0d8747d 25VERSION 2.2 TODO (Fault tolerant sharding)
c35f7d5b 26===========================================
7d65b33d 27
c35f7d5b 28* Redis-cluster, a fast intermediate layer (proxy) that implements consistent hashing and fault tollerant nodes handling.
7d65b33d 29
5b2a1c29 30Interesting readings about this:
31
32 - http://ayende.com/Blog/archive/2009/04/06/designing-rhino-dht-a-fault-tolerant-dynamically-distributed-hash.aspx
33
b0d8747d 34VERSION 2.4 TODO (Optimizations and latency)
c35f7d5b 35============================================
7d65b33d 36
37* Lower the CPU usage.
38* Lower the RAM usage everywhere possible.
39* Use epool and alike to rewrite ae.c for Linux and other platforms suppporting fater-than-select() mutiplexing APIs.
40* Implement an UDP interface for low-latency GET/SET operations.
41
3f477979 42OTHER IMPORTANT THINGS THAT WILL BE ADDED BUT I'M NOT SURE WHEN
43===============================================================
44
45BIG ONES:
46
47* Specially encoded memory-saving integer sets.
48* A command to export a JSON dump (there should be mostly working patch needing major reworking).
f0c138f6 49* Specially encoded sets of integers (this includes a big refactoring providing an higher level layer for Sets manipulation)
322fc7d8 50* ZRANK: http://docs.google.com/viewer?a=v&q=cache:tCQaP3ZeN4YJ:courses.csail.mit.edu/6.046/spring04/handouts/ps5-sol.pdf+skip+list+rank+operation+augmented&hl=en&pid=bl&srcid=ADGEEShXuNjTcZyXw_1cq9OaWpSXy3PprjXqVzmM-LE0ETFznLyrDXJKQ_mBPNT10R8ErkoiXD9JbMw_FaoHmOA4yoGVrA7tZWiy393JwfCwuewuP93sjbkzZ_gnEp83jYhPYjThaIzw&sig=AHIEtbRF0GkYCdYRFtTJBE69senXZwFY0w
3f477979 51
52SMALL ONES:
53
54* 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 55* 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 56* Don't save empty lists / sets / zsets on disk with snapshotting.
57* Remove keys when a list / set / zset reaches length of 0.
3f477979 58
f0c138f6 59THE "MAYBE" TODO LIST: things that may or may not get implemented
60=================================================================
f6b141c5 61
0188805d 62Most of this can be seen just as proposals, the fact they are in this list
63it's not a guarantee they'll ever get implemented ;)
64
57033301 65* Move dict.c from hash table to skip list, in order to avoid the blocking resize operation needed for the hash table.
682ac724 66* FORK command (fork()s executing the commands received by the current
67 client in the new process). Hint: large SORTs can use more cores,
68 copy-on-write will avoid memory problems.
69* DUP command? DUP srckey dstkey, creates an exact clone of srckey value in dstkey.
70* SORT: Don't copy the list into a vector when BY argument is constant.
71* 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.
72* LOCK / TRYLOCK / UNLOCK as described many times in the google group
73* Replication automated tests
74* 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.
75* 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.
76* Read-only mode.
77* Pattern-matching replication.
ac945e2d 78* 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 79* Multiple BY in SORT.