Hi Carlos, Actually, we are doing just that for sorted indexes. We have small indexes in an index bucket, where the key is a related to our user, and the value is the binary tree of sorted entries. We do this because there are a lot of users, but the trees will never be very large. I don't have any performance results on how fast that is compared to other methods yet though, but there are methods built in to do sorting and slicing. Look at http://hg.basho.com/riak_kv/src/tip/priv/mapred_builtins.js for the reduceSort and reduceSlice functions and in http://bitbucket.org/basho/riak_kv/src/tip/src/riak_kv_mapreduce.erl.
- Joe Lambert
_______________________________________________ riak-users mailing list [email protected] http://lists.basho.com/mailman/listinfo/riak-users_lists.basho.com
