Tree-based index overlay in hybrid peer-to-peer systems

Insung Kang, Sungjin Choi, Soon Young Jung, Sang-Geun Lee

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Hybrid Peer-to-Peer (P2P) systems that construct overlay networks structured among superpeers have great potential in that they can give the benefits such as scalability, search speed and network traffic, taking advantages of superpeer-based and the structured P2P systems. In this article, we enhance keyword search in hybrid P2P systems by constructing a tree-based index overlay among directory nodes that maintain indices, according to the load and popularity of a keyword. The mathematical analysis shows that the keyword search based on semi-structured P2P overlay can improve the search performance, reducing the message traffic and maintenance costs.

Original languageEnglish
Pages (from-to)313-329
Number of pages17
JournalJournal of Computer Science and Technology
Volume25
Issue number2
DOIs
Publication statusPublished - 2010 Mar 1

Fingerprint

Peer-to-peer Systems
Overlay networks
P2P Systems
Hybrid systems
Overlay
Hybrid Systems
Scalability
Keyword Search
Costs
Overlay Networks
Peer-to-peer (P2P)
Network Traffic
Mathematical Analysis
Maintenance
Traffic
Vertex of a graph

Keywords

  • Fault-tolerance
  • Keyword search
  • Performance
  • Tree-based index overlay

ASJC Scopus subject areas

  • Hardware and Architecture
  • Software
  • Computational Theory and Mathematics
  • Theoretical Computer Science
  • Computer Science Applications

Cite this

Tree-based index overlay in hybrid peer-to-peer systems. / Kang, Insung; Choi, Sungjin; Jung, Soon Young; Lee, Sang-Geun.

In: Journal of Computer Science and Technology, Vol. 25, No. 2, 01.03.2010, p. 313-329.

Research output: Contribution to journalArticle

@article{5ce6f37a194e4b3eba58564a0e9c4242,
title = "Tree-based index overlay in hybrid peer-to-peer systems",
abstract = "Hybrid Peer-to-Peer (P2P) systems that construct overlay networks structured among superpeers have great potential in that they can give the benefits such as scalability, search speed and network traffic, taking advantages of superpeer-based and the structured P2P systems. In this article, we enhance keyword search in hybrid P2P systems by constructing a tree-based index overlay among directory nodes that maintain indices, according to the load and popularity of a keyword. The mathematical analysis shows that the keyword search based on semi-structured P2P overlay can improve the search performance, reducing the message traffic and maintenance costs.",
keywords = "Fault-tolerance, Keyword search, Performance, Tree-based index overlay",
author = "Insung Kang and Sungjin Choi and Jung, {Soon Young} and Sang-Geun Lee",
year = "2010",
month = "3",
day = "1",
doi = "10.1007/s11390-010-9326-0",
language = "English",
volume = "25",
pages = "313--329",
journal = "Journal of Computer Science and Technology",
issn = "1000-9000",
publisher = "Springer New York",
number = "2",

}

TY - JOUR

T1 - Tree-based index overlay in hybrid peer-to-peer systems

AU - Kang, Insung

AU - Choi, Sungjin

AU - Jung, Soon Young

AU - Lee, Sang-Geun

PY - 2010/3/1

Y1 - 2010/3/1

N2 - Hybrid Peer-to-Peer (P2P) systems that construct overlay networks structured among superpeers have great potential in that they can give the benefits such as scalability, search speed and network traffic, taking advantages of superpeer-based and the structured P2P systems. In this article, we enhance keyword search in hybrid P2P systems by constructing a tree-based index overlay among directory nodes that maintain indices, according to the load and popularity of a keyword. The mathematical analysis shows that the keyword search based on semi-structured P2P overlay can improve the search performance, reducing the message traffic and maintenance costs.

AB - Hybrid Peer-to-Peer (P2P) systems that construct overlay networks structured among superpeers have great potential in that they can give the benefits such as scalability, search speed and network traffic, taking advantages of superpeer-based and the structured P2P systems. In this article, we enhance keyword search in hybrid P2P systems by constructing a tree-based index overlay among directory nodes that maintain indices, according to the load and popularity of a keyword. The mathematical analysis shows that the keyword search based on semi-structured P2P overlay can improve the search performance, reducing the message traffic and maintenance costs.

KW - Fault-tolerance

KW - Keyword search

KW - Performance

KW - Tree-based index overlay

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

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

U2 - 10.1007/s11390-010-9326-0

DO - 10.1007/s11390-010-9326-0

M3 - Article

VL - 25

SP - 313

EP - 329

JO - Journal of Computer Science and Technology

JF - Journal of Computer Science and Technology

SN - 1000-9000

IS - 2

ER -