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

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

doi:10.1007/s11390-010-9326-0

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

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

Research output: Contribution to journal › Article › peer-review

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 language	English
Pages (from-to)	313-329
Number of pages	17
Journal	Journal of Computer Science and Technology
Volume	25
Issue number	2
DOIs	https://doi.org/10.1007/s11390-010-9326-0
Publication status	Published - 2010 Mar

Keywords

Fault-tolerance
Keyword search
Performance
Tree-based index overlay

ASJC Scopus subject areas

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

Access to Document

10.1007/s11390-010-9326-0

Fingerprint Dive into the research topics of 'Tree-based index overlay in hybrid peer-to-peer systems'. Together they form a unique fingerprint.

Cite this

@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",

note = "Funding Information: Regular Paper ∗Corresponding Author This work was supported by the Korea Research Foundation Grant funded by the Korean Government (MOEHRD) under Grant Copyright: Copyright 2012 Elsevier B.V., All rights reserved.",

year = "2010",

month = mar,

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

N1 - Funding Information: Regular Paper ∗Corresponding Author This work was supported by the Korea Research Foundation Grant funded by the Korean Government (MOEHRD) under Grant Copyright: Copyright 2012 Elsevier B.V., All rights reserved.

PY - 2010/3

Y1 - 2010/3

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

AN - SCOPUS:77952217378

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 -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this