]> git.saurik.com Git - redis.git/blame - TODO
ae.c initial refactoring for epoll implementation
[redis.git] / TODO
CommitLineData
7d65b33d 1VERSION 1.1 TODO (Zsets, Integer encoding, Append only journal)
c35f7d5b 2===============================================================
3
4Most 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:
f6b141c5 5
6* For now only the last argument gets integer encoded, so make sure that: 1) every multi bulk commands 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".
7d65b33d 7* Man pages for MSET MSETNX and SRANDMEMBER, missing Z-commands, ...
d13f767c 8* Use strcoll() to compare objects in sorted sets, like it already happens for SORT.
5b2a1c29 9* Write docs for the "STORE" operaiton of SORT. Link to the article about SORT by written by defunkt.
cdd140aa 10* Append only mode: testing and a command to rebuild the log from scratch.
5b2a1c29 11* ZRANGEBYSCORE test, ZRANGEBYSCORE LIMIT option.
12* Sorted sets infinity tests.
13* Support for epool in ae.c.
23cff1a8 14
7d65b33d 15VERSION 1.2 TODO (Hash type)
c35f7d5b 16============================
23cff1a8 17
18* Hashes (HSET, HGET, HEXISTS, HLEN, ...).
cb7e07cc 19* 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.
f6b141c5 20
7d65b33d 21VERSION 1.3 TODO (Virtual memory)
c35f7d5b 22=================================
7d65b33d 23
24* Redis Virtual Memory for datasets bigger than RAM (http://groups.google.com/group/redis-db/msg/752997c7b38553cd)
25
26VERSION 1.4 TODO (Fault tollerant sharding)
c35f7d5b 27===========================================
7d65b33d 28
c35f7d5b 29* Redis-cluster, a fast intermediate layer (proxy) that implements consistent hashing and fault tollerant nodes handling.
7d65b33d 30
5b2a1c29 31Interesting readings about this:
32
33 - http://ayende.com/Blog/archive/2009/04/06/designing-rhino-dht-a-fault-tolerant-dynamically-distributed-hash.aspx
34
7d65b33d 35VERSION 1.5 TODO (Optimizations and latency)
c35f7d5b 36============================================
7d65b33d 37
38* Lower the CPU usage.
39* Lower the RAM usage everywhere possible.
40* Use epool and alike to rewrite ae.c for Linux and other platforms suppporting fater-than-select() mutiplexing APIs.
41* Implement an UDP interface for low-latency GET/SET operations.
42
c35f7d5b 43SHORT/LONG TERM RANDOM TODO ITEMS
44=================================
f6b141c5 45
d214bb48 46 * SORT: Don't copy the list into a vector when BY argument is constant.
391b4a60 47 * 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.
391b4a60 48 * LOCK / TRYLOCK / UNLOCK as described many times in the google group
49 * Replication automated tests
7d65b33d 50 * BYTEDARRAY type
ec93bba3 51 * 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.