Re: Sorting of data using 2i pagination

2015-11-28 Thread Damien Krotkine
AFAIK secondary index pagination sorting doesn't support descending order. Maybe you can simple have an additional 2i whith your value inverted ? Grigory Fateyev wrote: Hello! We use 2i pagination and it is very good. The only thing that bothering me is sorting. Now data returns in ascending

Re: Sorting and searching with binary search trees

2010-09-01 Thread Alexander Sicular
I just put out a post on using map/reduce to sort. http://siculars.posterous.com/using-riaks-mapreduce-for-sorting. -Alexander On Sep 1, 2010, at 9:31 AM, Carlo Pires wrote: > Hi, > > I'm thinking to use riak as database for my next project but I don't > know how to deal with sorting and retri

Re: Sorting and searching with binary search trees

2010-09-01 Thread Joseph Lambert
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 an

Re: Sorting

2010-08-10 Thread Sean Cribbs
Since you won't likely be creating many blog posts at the same time, I'd suggest to store them as a single list in one key, or a tail-linked list with a single pointer to the head of the list. Either way, your access pattern is very simple. With the single list in one key, your first map functi