title: Distributed Network B+trees
body: <p>I would like to build a B+tree that spans a multi-node<br>
  computer network (internal subnet of Linux PCs) for<br>
  elastic massive storage. Range scans are important.  </p>
  
  <p>Is this basically the underlying data structure of<br>
  distributed DB systems? (Cassandra, HBase)  </p>
  
  <p>Is there any research out there on distributed B+Trees?<br>
  I saw the article at<br>
  <a href="http://www.cs.yale.edu/homes/aspnes/papers/opodis2005-b-trees-final.pdf" rel="nofollow">http://www.cs.yale.edu/homes/aspnes/papers/opodis2005-b-trees-final.pdf</a><br>
  but skip BTrees just take faulty nodes out (so there's data loss)  </p>
  
  <p>I'm particularly interested in B+Trees with built-in redundancy<br>
  (i.e. if a host fails and all the nodes it hosts are offline,<br>
  I'd like another replicated host to become the primary node<br>
  server and take the place of the failed host)  </p>
  
  <p>I don't want to use a collection of DB instances<br>
  (1 node, one DB) as sharding is not a good choice<br>
  for a massively scaled storage system (across commodity<br>
  x86,x64 hardware with FOSS OS).  </p>
  
  <p>Am I reinventing the wheel?<br>
  Should I just use Cassandra or HBase?  </p>