I wouldn't do a linked list using Riak links unless it was a small list. With a bytes you can transverse to the node the has a key closest to the left side of your range and then do a in order tranversal of the tree until you reach the right side of your range.
It's a lot like a binary search tree but is better for high latency reads like a disk or networked data store because each node in the tree has a chunk of keys. On Jan 23, 2011 1:47 PM, "Jeremiah Peschka" <jeremiah.pesc...@gmail.com> wrote:
_______________________________________________ riak-users mailing list riak-users@lists.basho.com http://lists.basho.com/mailman/listinfo/riak-users_lists.basho.com
