On 20 October 2013 11:33, Benoit Chesneau <[email protected]> wrote:
> On Sun, Oct 20, 2013 at 11:11 AM, Alexander Shorin <[email protected]> > wrote: > > > Also there was good discussion about quite recently: > > http://www.mail-archive.com/[email protected]/msg18257.html > > -- > > ,,,^..^,,, > > > > > > On Sun, Oct 20, 2013 at 1:06 PM, Alexander Shorin <[email protected]> > > wrote: > > > A bit old, but may be useful: > > > > > > > > > http://web.archive.org/web/20110903011752/http://horicky.blogspot.com/2008/10/couchdb-implementation.html > > > http://ayende.com/blog/3608/more-couchdb-reading-btree-lookup > > > http://ayende.com/blog/3609/more-couchdb-reading-btree-query-modify > > > -- > > > ,,,^..^,,, > > > > > > > > Thanks Alexander! That will help me, I don't think the way we index/store > the data (can we really call that a btree?) changed too much since…. Maybe > Paul have some insights on that. > > > My goal for now is to document all the algorithmm used in a pseudo lang > like I did for the replicator. Then maybe write a simple implementation so > people can play with it and eventually improve it. > > - benoit > sounds great! Can you please point me to what you have already written about the replicator? I am just plain interested ;-) Thanks Andy -- Andy Wenk Hamburg - Germany RockIt!
