| | 1 | VERSION 1.1 TODO (Zsets, Integer encoding, Append only journal) |
| | 2 | =============================================================== |
| | 3 | |
| | 4 | 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: |
| | 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". |
| | 7 | * Man pages for MSET MSETNX and SRANDMEMBER, missing Z-commands, ... |
| | 8 | * Use strcoll() to compare objects in sorted sets, like it already happens for SORT. |
| | 9 | * Write docs for the "STORE" operaiton of SORT. Link to the article about SORT by written by defunkt. |
| | 10 | * Append only mode: testing and a command to rebuild the log from scratch. |
| | 11 | * ZRANGEBYSCORE test, ZRANGEBYSCORE LIMIT option. |
| | 12 | * Sorted sets infinity tests. |
| | 13 | * Support for epool in ae.c. |
| | 14 | |
| | 15 | VERSION 1.2 TODO (Hash type) |
| | 16 | ============================ |
| | 17 | |
| | 18 | * Hashes (HSET, HGET, HEXISTS, HLEN, ...). |
| | 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. |
| | 20 | |
| | 21 | VERSION 1.3 TODO (Virtual memory) |
| | 22 | ================================= |
| | 23 | |
| | 24 | * Redis Virtual Memory for datasets bigger than RAM (http://groups.google.com/group/redis-db/msg/752997c7b38553cd) |
| | 25 | |
| | 26 | VERSION 1.4 TODO (Fault tollerant sharding) |
| | 27 | =========================================== |
| | 28 | |
| | 29 | * Redis-cluster, a fast intermediate layer (proxy) that implements consistent hashing and fault tollerant nodes handling. |
| | 30 | |
| | 31 | Interesting readings about this: |
| | 32 | |
| | 33 | - http://ayende.com/Blog/archive/2009/04/06/designing-rhino-dht-a-fault-tolerant-dynamically-distributed-hash.aspx |
| | 34 | |
| | 35 | VERSION 1.5 TODO (Optimizations and latency) |
| | 36 | ============================================ |
| | 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 | |
| | 43 | SHORT/LONG TERM RANDOM TODO ITEMS |
| | 44 | ================================= |
| | 45 | |
| | 46 | * SORT: Don't copy the list into a vector when BY argument is constant. |
| | 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. |
| | 48 | * LOCK / TRYLOCK / UNLOCK as described many times in the google group |
| | 49 | * Replication automated tests |
| | 50 | * BYTEDARRAY type |
| | 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. |
projects / redis.git / blame_incremental