Log structural database has the append-only characteristics, e.g. BDB-JE. Is it an alternative for SSTable? Those matured database product might have done a lot for cache management. Not sure whether it can improve the performance of read or not.
Support of compression on those product is another issue.... Just as Avinash pointed out, distributed B-Tree may bring some trouble because of the complicated operations during re-balance, unless there is some elegant algorithm I'm not aware. best regards, hanzhu On Mon, Mar 29, 2010 at 8:12 PM, Jonathan Ellis <jbel...@gmail.com> wrote: > On Mon, Mar 29, 2010 at 6:52 AM, Michael Poole <mdpo...@troilus.org> > wrote: > > SSTables aren't written on every update. Why would a B-Tree > > implementation differ? > > Because traditional B-trees are update-in-place, and although CouchDB > has an append-only B-tree, it's limited to one writer at a time which > is (one reason) why they get 6x less throughput than we do on writes. >
