P-Grid

In distributed data storage, a P-Grid is a self-organizing structured peer-to-peer system, which can accommodate arbitrary key distributions (and hence support lexicographic key ordering and range queries), still providing storage load-balancing and efficient search by using randomized routing.

Each peer, for each level of the trie, maintains autonomously routing entries chosen randomly from the complementary sub-trees.

[2] In fact, multiple entries are maintained for each level at each peer to provide fault-tolerance (as well as potentially for query-load management).

For diverse reasons including fault-tolerance and load-balancing, multiple peers are responsible for each leaf node in the P-Grid tree.

[5] Simple vector-based data storage architectural frameworks are also subject to variable query limitations within the P-Grid environment.