Efficient range indexing in DHT-based peer-to-peer networks

Tan Yunsong; Wu Yuntao

doi:10.1109/ifita.2009.516

Efficient range indexing in DHT-based peer-to-peer networks

Tan Yunsong, Wu Yuntao

Wuhan Institute of Technology

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

1 Scopus citations

Abstract

A fundamental problem of peer-to-peer (P2P) systems is efficiently locating a node that stores a desired data item. Distributed hash table (DHT) mechanisms have been proposed to address this problem and manage data in very large, structured P2P systems. DHT algorithms provide efficient exact match object search capabilities without requiring global indexing and are hence extremely scalable However, supporting range queries efficiently remains a difficult problem In this paper, we describe an extension to a currently available DHT implementation, in order to support range queries and at the same time preserve the important attributes of P2P systems.

Original language	English
Title of host publication	Proceedings - 2009 International Forum on Information Technology and Applications, IFITA 2009
Pages	626-628
Number of pages	3
DOIs	https://doi.org/10.1109/ifita.2009.516
State	Published - 2009
Externally published	Yes
Event	2009 International Forum on Information Technology and Applications, IFITA 2009 - Chengdu, China Duration: 15 May 2009 → 17 May 2009

Publication series

Name	Proceedings - 2009 International Forum on Information Technology and Applications, IFITA 2009
Volume	1

Conference

Conference	2009 International Forum on Information Technology and Applications, IFITA 2009
Country/Territory	China
City	Chengdu
Period	15/05/09 → 17/05/09

Keywords

DHT
P2P
Range query

Access to Document

10.1109/ifita.2009.516

Cite this

@inproceedings{a32329439b3e4a988659f078c74dce30,

title = "Efficient range indexing in DHT-based peer-to-peer networks",

abstract = "A fundamental problem of peer-to-peer (P2P) systems is efficiently locating a node that stores a desired data item. Distributed hash table (DHT) mechanisms have been proposed to address this problem and manage data in very large, structured P2P systems. DHT algorithms provide efficient exact match object search capabilities without requiring global indexing and are hence extremely scalable However, supporting range queries efficiently remains a difficult problem In this paper, we describe an extension to a currently available DHT implementation, in order to support range queries and at the same time preserve the important attributes of P2P systems.",

keywords = "DHT, P2P, Range query",

author = "Tan Yunsong and Wu Yuntao",

year = "2009",

doi = "10.1109/ifita.2009.516",

language = "אנגלית",

isbn = "9780769536002",

series = "Proceedings - 2009 International Forum on Information Technology and Applications, IFITA 2009",

pages = "626--628",

booktitle = "Proceedings - 2009 International Forum on Information Technology and Applications, IFITA 2009",

note = "2009 International Forum on Information Technology and Applications, IFITA 2009 ; Conference date: 15-05-2009 Through 17-05-2009",

}

Yunsong, T & Yuntao, W 2009, Efficient range indexing in DHT-based peer-to-peer networks. in Proceedings - 2009 International Forum on Information Technology and Applications, IFITA 2009., 5231718, Proceedings - 2009 International Forum on Information Technology and Applications, IFITA 2009, vol. 1, pp. 626-628, 2009 International Forum on Information Technology and Applications, IFITA 2009, Chengdu, China, 15/05/09. https://doi.org/10.1109/ifita.2009.516

Efficient range indexing in DHT-based peer-to-peer networks. / Yunsong, Tan; Yuntao, Wu.
Proceedings - 2009 International Forum on Information Technology and Applications, IFITA 2009. 2009. p. 626-628 5231718 (Proceedings - 2009 International Forum on Information Technology and Applications, IFITA 2009; Vol. 1).

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

TY - GEN

T1 - Efficient range indexing in DHT-based peer-to-peer networks

AU - Yunsong, Tan

AU - Yuntao, Wu

PY - 2009

Y1 - 2009

N2 - A fundamental problem of peer-to-peer (P2P) systems is efficiently locating a node that stores a desired data item. Distributed hash table (DHT) mechanisms have been proposed to address this problem and manage data in very large, structured P2P systems. DHT algorithms provide efficient exact match object search capabilities without requiring global indexing and are hence extremely scalable However, supporting range queries efficiently remains a difficult problem In this paper, we describe an extension to a currently available DHT implementation, in order to support range queries and at the same time preserve the important attributes of P2P systems.

AB - A fundamental problem of peer-to-peer (P2P) systems is efficiently locating a node that stores a desired data item. Distributed hash table (DHT) mechanisms have been proposed to address this problem and manage data in very large, structured P2P systems. DHT algorithms provide efficient exact match object search capabilities without requiring global indexing and are hence extremely scalable However, supporting range queries efficiently remains a difficult problem In this paper, we describe an extension to a currently available DHT implementation, in order to support range queries and at the same time preserve the important attributes of P2P systems.

KW - DHT

KW - P2P

KW - Range query

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

U2 - 10.1109/ifita.2009.516

DO - 10.1109/ifita.2009.516

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:70350523753

SN - 9780769536002

T3 - Proceedings - 2009 International Forum on Information Technology and Applications, IFITA 2009

SP - 626

EP - 628

BT - Proceedings - 2009 International Forum on Information Technology and Applications, IFITA 2009

T2 - 2009 International Forum on Information Technology and Applications, IFITA 2009

Y2 - 15 May 2009 through 17 May 2009

ER -

Efficient range indexing in DHT-based peer-to-peer networks

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this