1
0
mirror of https://github.com/fluencelabs/redis synced 2025-04-02 15:51:05 +00:00

TODO cahnges

This commit is contained in:
antirez 2010-01-26 05:02:27 -05:00
parent b72f6a4b70
commit a544018d04

8
TODO

@ -14,10 +14,11 @@ Virtual Memory sub-TODO:
* Divide swappability of objects by refcount * Divide swappability of objects by refcount
* it should be possible to give the vm-max-memory option in megabyte, gigabyte, ..., just using 2GB, 100MB, and so forth. * it should be possible to give the vm-max-memory option in megabyte, gigabyte, ..., just using 2GB, 100MB, and so forth.
* 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?). * 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. * EXISTS should avoid loading the object if possible without too make the code too specialized.
* vm-min-age <seconds> option * vm-min-age <seconds> option
* Hashes (HSET, HGET, HDEL, HEXISTS, HLEN, ...). * Hashes (GET/SET/DEL/INCRBY/EXISTS/FIELDS/LEN/MSET/MGET). Special encoding for hashes with < N keys.
VERSION 2.2 TODO (Fault tolerant sharding) VERSION 2.2 TODO (Fault tolerant sharding)
=========================================== ===========================================
@ -36,11 +37,6 @@ VERSION 2.4 TODO (Optimizations and latency)
* Use epool and alike to rewrite ae.c for Linux and other platforms suppporting fater-than-select() mutiplexing APIs. * 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. * Implement an UDP interface for low-latency GET/SET operations.
VERSION 2.6 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 OTHER IMPORTANT THINGS THAT WILL BE ADDED BUT I'M NOT SURE WHEN
=============================================================== ===============================================================