Distributed arrays: A P2P data structure for efficient logical arrays

Daisuke Fukuchi; Christian Sommer; Yuichi Sei; Shinichi Honiden

doi:10.1109/INFCOM.2009.5062062

Distributed arrays: A P2P data structure for efficient logical arrays

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

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Citation (Scopus)

Abstract

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.

Original language	English
Title of host publication	IEEE INFOCOM 2009 - The 28th Conference on Computer Communications
Pages	1458-1466
Number of pages	9
DOIs	https://doi.org/10.1109/INFCOM.2009.5062062
Publication status	Published - 2009
Externally published	Yes
Event	28th Conference on Computer Communications, IEEE INFOCOM 2009 - Rio de Janeiro, Brazil Duration: 2009 Apr 19 → 2009 Apr 25

Publication series

Name	Proceedings - IEEE INFOCOM
ISSN (Print)	0743-166X

Other

Other	28th Conference on Computer Communications, IEEE INFOCOM 2009
Country/Territory	Brazil
City	Rio de Janeiro
Period	09/4/19 → 09/4/25

ASJC Scopus subject areas

Computer Science(all)
Electrical and Electronic Engineering

Access to Document

10.1109/INFCOM.2009.5062062

Cite this

Fukuchi, D, Sommer, C, Sei, Y & Honiden, S 2009, Distributed arrays: A P2P data structure for efficient logical arrays. in IEEE INFOCOM 2009 - The 28th Conference on Computer Communications., 5062062, Proceedings - IEEE INFOCOM, pp. 1458-1466, 28th Conference on Computer Communications, IEEE INFOCOM 2009, Rio de Janeiro, Brazil, 09/4/19. https://doi.org/10.1109/INFCOM.2009.5062062

@inproceedings{056aead25d3741968053bbcafe2e6d51,

title = "Distributed arrays: A P2P data structure for efficient logical arrays",

abstract = "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.",

author = "Daisuke Fukuchi and Christian Sommer and Yuichi Sei and Shinichi Honiden",

year = "2009",

doi = "10.1109/INFCOM.2009.5062062",

language = "English",

isbn = "9781424435135",

series = "Proceedings - IEEE INFOCOM",

pages = "1458--1466",

booktitle = "IEEE INFOCOM 2009 - The 28th Conference on Computer Communications",

note = "28th Conference on Computer Communications, IEEE INFOCOM 2009 ; Conference date: 19-04-2009 Through 25-04-2009",

}

TY - GEN

T1 - Distributed arrays

T2 - 28th Conference on Computer Communications, IEEE INFOCOM 2009

AU - Fukuchi, Daisuke

AU - Sommer, Christian

AU - Sei, Yuichi

AU - Honiden, Shinichi

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=70349661632&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70349661632&partnerID=8YFLogxK

U2 - 10.1109/INFCOM.2009.5062062

DO - 10.1109/INFCOM.2009.5062062

M3 - Conference contribution

AN - SCOPUS:70349661632

SN - 9781424435135

T3 - Proceedings - IEEE INFOCOM

SP - 1458

EP - 1466

BT - IEEE INFOCOM 2009 - The 28th Conference on Computer Communications

Y2 - 19 April 2009 through 25 April 2009

ER -

Distributed arrays: A P2P data structure for efficient logical arrays

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this