X-Git-Url: https://git.saurik.com/redis.git/blobdiff_plain/72e9fd40b63924355dd158ab552e5f339ad1f19b..f44dd428729064d75804c86223811badcf73716d:/TODO diff --git a/TODO b/TODO index cfd21b76..953da4aa 100644 --- a/TODO +++ b/TODO @@ -1,30 +1,32 @@ Redis TODO and Roadmap -VERSION 1.4 TODO (Hash type) -============================ +VERSION 2.0 TODO +================ * BRPOPLPUSH -* RPOPLPUSH should notify blocking POP operations * List ops like L/RPUSH L/RPOP should return the new list length. * Save dataset / fsync() on SIGTERM -* MULTI/EXEC should support the "EXEC FSYNC" form -* Synchronous Virtual Memory +* MULTI/EXEC should support the "EXEC FSYNC" form? * BLPOP & C. tests (write a non blocking Tcl client as first step) +* ZCOUNT sortedset min max Virtual Memory sub-TODO: -* Check if the page selection algorithm is working well. +* Check if the page selection algorithm is working well * Divide swappability of objects by refcount -* vm-swap-file . The swap file should go where the user wants, and if it's already there and of the right size we can avoid to create it again. * it should be possible to give the vm-max-memory option in megabyte, gigabyte, ..., just using 2GB, 100MB, and so forth. -* Make sure to wait all the IO threads are done before to fork() for BGSAVE and BGREWRITEAOF - -VERSION 1.6 TODO (Virtual memory) -================================= - -* Asynchronous Virtual Memory -* Hashes (HSET, HGET, HEXISTS, HLEN, ...). - -VERSION 1.8 TODO (Fault tollerant sharding) +* 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?). +* 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). +* EXISTS should avoid loading the object if possible without too make the code too specialized. +* vm-min-age option +* Make sure objects loaded from the VM are specially encoded when possible. +* 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. +* Sets of integers are slow to load, for a number of reasons. Fix it. (use slow_sets.rdb file for debugging). + +* Hashes (GET/SET/DEL/INCRBY/EXISTS/FIELDS/LEN/MSET/MGET). Special encoding for hashes with less than N elements. +* Write documentation for APPEND +* Implement LEN, SUBSTR, PEEK, POKE, SETBIT, GETBIT + +VERSION 2.2 TODO (Fault tolerant sharding) =========================================== * Redis-cluster, a fast intermediate layer (proxy) that implements consistent hashing and fault tollerant nodes handling. @@ -33,7 +35,7 @@ Interesting readings about this: - http://ayende.com/Blog/archive/2009/04/06/designing-rhino-dht-a-fault-tolerant-dynamically-distributed-hash.aspx -VERSION 2.0 TODO (Optimizations and latency) +VERSION 2.4 TODO (Optimizations and latency) ============================================ * Lower the CPU usage. @@ -41,11 +43,6 @@ VERSION 2.0 TODO (Optimizations and latency) * 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. -VERSION 2.2 TODO (Optimizations and latency) -============================================ - -* JSON command able to access data serialized in JSON format. For instance if I've a key foobar with a json object I can alter the "name" file using somthing like: "JSON SET foobar name Kevin". We should have GET and INCRBY as well. - OTHER IMPORTANT THINGS THAT WILL BE ADDED BUT I'M NOT SURE WHEN ===============================================================