[erlang-questions] Problems Writing a Scalable Shared Data Structure
Scott Lystig Fritchie
Sat Aug 23 02:39:30 CEST 2008
Hi, Fuad. Sorry this is a month and a half late. Recently I came
across a tech report from HP Labs that sounded similar, at least in
intent, to the problem you were working on back in July.
Fuad Tabba <fuad@REDACTED> wrote:
ft> Another thing I've tried is I created a base for the tree; what I
ft> mean is that there's a known root, a known node to the left of the
ft> root and a known node that's to the right of the root. [...]
This sounds like a small scale version of what the HP researchers did,
except they applied client-side caching for *all* internal B-tree nodes.
A practical scalable distributed B-tree
Aguilera and Golab
In the event that client caches are stale, the clients can figure that
out and get up-to-date copies of the internal nodes.
More information about the erlang-questions