Implement distributed b-tree.

In order to do ranged searches, Synapse will need more than a distributed hash table, it will need a distributed b-tree. Built on top of any database engine, each client node can act as tier in the tree, with multiple nodes in the network acting as a distributed root. Those roots would direct traffic through the tree to the client nodes that contained the specific records sought by a query.