]> git.saurik.com Git - redis.git/blob - TODO
sorted sets saving fixed
[redis.git] / TODO
1 Redis TODO and Roadmap
2
3 VERSION 1.1 TODO (Zsets, Integer encoding, Append only journal)
4 ===============================================================
5
6 Most of the features already implemented for this release. The following is a list of the missing things in order to release the first beta tar.gz:
7
8 * For now only the last argument gets integer encoded, so make sure that: 1) every multi bulk command implemented will have the last arg that is indeed a value, and not used otherwise. 2) to explicitly call the function to encode the object in MSET and other commands where there are multiple "values".
9 * Man pages for SRANDMEMBER, missing Z-commands, ...
10 * Use strcoll() to compare objects in sorted sets, like it already happens for SORT.
11 * Write docs for the "STORE" operaiton of SORT. Link to the article about SORT by written by defunkt.
12 * Append only mode: testing and a command to rebuild the log from scratch.
13 * ZRANGEBYSCORE test, ZRANGEBYSCORE LIMIT option.
14 * Sorted sets infinity tests.
15
16 VERSION 1.2 TODO (Hash type)
17 ============================
18
19 * Hashes (HSET, HGET, HEXISTS, HLEN, ...).
20 * An utility able to export an .rdb file into a text-only JSON dump, we can't live anymore without such a tool. Probably an extension to redis-cli.
21
22 VERSION 1.3 TODO (Virtual memory)
23 =================================
24
25 * Redis Virtual Memory for datasets bigger than RAM (http://groups.google.com/group/redis-db/msg/752997c7b38553cd)
26
27 VERSION 1.4 TODO (Fault tollerant sharding)
28 ===========================================
29
30 * Redis-cluster, a fast intermediate layer (proxy) that implements consistent hashing and fault tollerant nodes handling.
31
32 Interesting readings about this:
33
34 - http://ayende.com/Blog/archive/2009/04/06/designing-rhino-dht-a-fault-tolerant-dynamically-distributed-hash.aspx
35
36 VERSION 1.5 TODO (Optimizations and latency)
37 ============================================
38
39 * Lower the CPU usage.
40 * Lower the RAM usage everywhere possible.
41 * Use epool and alike to rewrite ae.c for Linux and other platforms suppporting fater-than-select() mutiplexing APIs.
42 * Implement an UDP interface for low-latency GET/SET operations.
43
44 SHORT/LONG TERM RANDOM TODO ITEMS
45 =================================
46
47 * SORT: Don't copy the list into a vector when BY argument is constant.
48 * 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.
49 * LOCK / TRYLOCK / UNLOCK as described many times in the google group
50 * Replication automated tests
51 * BYTEDARRAY type
52 * 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.