|
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. == Salient features == * Good storage load-balancing despite arbitrary load-distribution over the key-space. * Range queries can be naturally supported and efficiently processed on P-Grid because P-Grid abstracts a trie-structure, and supports (rather) arbitrary distribution of keys, as observed in realistic scenarios. * A Self-referential directory is realized to provide peer identity persistence over multiple sessions. * A gossip primitive based update mechanism for keeping replicated content up-to-date. * Easy merger of multiple P-Grids, and hence decentralized bootstrapping of the P-Grid network. * Query-adaptive caching is easy to realize on P-Grid to provide query load-balancing where peers have restricted capacity. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「P-Grid」の詳細全文を読む スポンサード リンク
|