TODO 4.9 KB
Newer Older
A
antirez 已提交
1 2
Redis TODO and Roadmap

A
antirez 已提交
3
VERSION 1.4 TODO (Hash type)
A
antirez 已提交
4
============================
5

6
* BRPOPLPUSH
A
antirez 已提交
7
* List ops like L/RPUSH L/RPOP should return the new list length.
8
* Save dataset / fsync() on SIGTERM
9
* MULTI/EXEC should support the "EXEC FSYNC" form?
10
* BLPOP & C. tests (write a non blocking Tcl client as first step)
A
antirez 已提交
11

12
Virtual Memory sub-TODO:
13
* Check if the page selection algorithm is working well
14
* Divide swappability of objects by refcount
15
* it should be possible to give the vm-max-memory option in megabyte, gigabyte, ..., just using 2GB, 100MB, and so forth.
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?).
A
antirez 已提交
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).
18 19
* EXISTS should avoid loading the object if possible without too make the code too specialized.
* vm-min-age <seconds> option
20

A
antirez 已提交
21
* Hashes (GET/SET/DEL/INCRBY/EXISTS/FIELDS/LEN/MSET/MGET). Special encoding for hashes with < N keys.
A
antirez 已提交
22

23
VERSION 2.2 TODO (Fault tolerant sharding)
A
antirez 已提交
24
===========================================
A
antirez 已提交
25

A
antirez 已提交
26
* Redis-cluster, a fast intermediate layer (proxy) that implements consistent hashing and fault tollerant nodes handling.
A
antirez 已提交
27

28 29 30 31
Interesting readings about this:

    - http://ayende.com/Blog/archive/2009/04/06/designing-rhino-dht-a-fault-tolerant-dynamically-distributed-hash.aspx

32
VERSION 2.4 TODO (Optimizations and latency)
A
antirez 已提交
33
============================================
A
antirez 已提交
34 35 36 37 38 39

* Lower the CPU usage.
* Lower the RAM usage everywhere possible.
* Use epool and alike to rewrite ae.c for Linux and other platforms suppporting fater-than-select() mutiplexing APIs.
* Implement an UDP interface for low-latency GET/SET operations.

40 41 42 43 44 45 46
OTHER IMPORTANT THINGS THAT WILL BE ADDED BUT I'M NOT SURE WHEN
===============================================================

BIG ONES:

* Specially encoded memory-saving integer sets.
* A command to export a JSON dump (there should be mostly working patch needing major reworking).
A
antirez 已提交
47
* Specially encoded sets of integers (this includes a big refactoring providing an higher level layer for Sets manipulation)
48
* 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
49 50 51 52

SMALL ONES:

* 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.
A
antirez 已提交
53
* MSADD (n keys) (n values). See this thread in the Redis google group: http://groups.google.com/group/redis-db/browse_thread/thread/e766d84eb375cd41
A
antirez 已提交
54 55
* Don't save empty lists / sets / zsets on disk with snapshotting.
* Remove keys when a list / set / zset reaches length of 0.
56

A
antirez 已提交
57 58
THE "MAYBE" TODO LIST: things that may or may not get implemented
=================================================================
A
antirez 已提交
59

A
antirez 已提交
60 61 62
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 ;)

A
antirez 已提交
63
* Move dict.c from hash table to skip list, in order to avoid the blocking resize operation needed for the hash table.
64 65 66 67 68 69 70 71 72 73 74 75
* 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.
76
* 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?
A
antirez 已提交
77
* Multiple BY in SORT.