Distributed arrays: A P2P data structure for efficient logical arrays

Daisuke Fukuchi*, Christian Sommer, Yuichi Sei, Shinichi Honiden

*この研究の対応する著者

研究成果: Conference contribution

1 被引用数 (Scopus)

抄録

Distributed hash tables (DHT) are used for data management in P2P environments. However, since most hash functions ignore relations between items, DHTs are not efficient for operations on related items. In this paper, we modify a DHT into a distributed array (DA) that enables efficient operations on logical arrays. The array elements of a DA are placed in a P2P overlay network according to a simple rule such that the load is balanced and the number of messages required to access elements sequentially is reduced. The number of messages required for array operations is much smaller than that for operations on DHTs. We demonstrate this theoretically and experimentally.

本文言語English
ホスト出版物のタイトルIEEE INFOCOM 2009 - The 28th Conference on Computer Communications
ページ1458-1466
ページ数9
DOI
出版ステータスPublished - 2009 10月 12
外部発表はい
イベント28th Conference on Computer Communications, IEEE INFOCOM 2009 - Rio de Janeiro, Brazil
継続期間: 2009 4月 192009 4月 25

出版物シリーズ

名前Proceedings - IEEE INFOCOM
ISSN(印刷版)0743-166X

Other

Other28th Conference on Computer Communications, IEEE INFOCOM 2009
国/地域Brazil
CityRio de Janeiro
Period09/4/1909/4/25

ASJC Scopus subject areas

  • コンピュータ サイエンス(全般)
  • 電子工学および電気工学

フィンガープリント

「Distributed arrays: A P2P data structure for efficient logical arrays」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル