DUP: Dynamic-tree based update propagation in peer-to-peer networks

Liangzhong Yin, Guohong Cao

Research output: Chapter in Book/Report/Conference proceedingConference contribution

28 Citations (Scopus)

Abstract

In peer-to-peer networks, indices are used to map data id to nodes that host the data. The performance of data access can be improved by actively pushing indices to interested nodes. This paper proposes the Dynamic-tree based Update Propagation (DUP) scheme, which builds the update propagation tree to facilitate the propagation of indices. Because the update propagation tree only involves nodes that are essential for update propagation, the overhead of DUP is very small and the query latency is significantly reduced.

Original languageEnglish (US)
Title of host publicationProceedings - 21st International Conference on Data Engineering, ICDE 2005
Pages258-259
Number of pages2
DOIs
StatePublished - Dec 12 2005
Event21st International Conference on Data Engineering, ICDE 2005 - Tokyo, Japan
Duration: Apr 5 2005Apr 8 2005

Publication series

NameProceedings - International Conference on Data Engineering
ISSN (Print)1084-4627

Other

Other21st International Conference on Data Engineering, ICDE 2005
CountryJapan
CityTokyo
Period4/5/054/8/05

Fingerprint

Peer to peer networks

All Science Journal Classification (ASJC) codes

  • Software
  • Signal Processing
  • Information Systems

Cite this

Yin, L., & Cao, G. (2005). DUP: Dynamic-tree based update propagation in peer-to-peer networks. In Proceedings - 21st International Conference on Data Engineering, ICDE 2005 (pp. 258-259). (Proceedings - International Conference on Data Engineering). https://doi.org/10.1109/ICDE.2005.52
Yin, Liangzhong ; Cao, Guohong. / DUP : Dynamic-tree based update propagation in peer-to-peer networks. Proceedings - 21st International Conference on Data Engineering, ICDE 2005. 2005. pp. 258-259 (Proceedings - International Conference on Data Engineering).
@inproceedings{a892a0fff2a54f60bc2166773966337a,
title = "DUP: Dynamic-tree based update propagation in peer-to-peer networks",
abstract = "In peer-to-peer networks, indices are used to map data id to nodes that host the data. The performance of data access can be improved by actively pushing indices to interested nodes. This paper proposes the Dynamic-tree based Update Propagation (DUP) scheme, which builds the update propagation tree to facilitate the propagation of indices. Because the update propagation tree only involves nodes that are essential for update propagation, the overhead of DUP is very small and the query latency is significantly reduced.",
author = "Liangzhong Yin and Guohong Cao",
year = "2005",
month = "12",
day = "12",
doi = "10.1109/ICDE.2005.52",
language = "English (US)",
isbn = "0769522858",
series = "Proceedings - International Conference on Data Engineering",
pages = "258--259",
booktitle = "Proceedings - 21st International Conference on Data Engineering, ICDE 2005",

}

Yin, L & Cao, G 2005, DUP: Dynamic-tree based update propagation in peer-to-peer networks. in Proceedings - 21st International Conference on Data Engineering, ICDE 2005. Proceedings - International Conference on Data Engineering, pp. 258-259, 21st International Conference on Data Engineering, ICDE 2005, Tokyo, Japan, 4/5/05. https://doi.org/10.1109/ICDE.2005.52

DUP : Dynamic-tree based update propagation in peer-to-peer networks. / Yin, Liangzhong; Cao, Guohong.

Proceedings - 21st International Conference on Data Engineering, ICDE 2005. 2005. p. 258-259 (Proceedings - International Conference on Data Engineering).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - DUP

T2 - Dynamic-tree based update propagation in peer-to-peer networks

AU - Yin, Liangzhong

AU - Cao, Guohong

PY - 2005/12/12

Y1 - 2005/12/12

N2 - In peer-to-peer networks, indices are used to map data id to nodes that host the data. The performance of data access can be improved by actively pushing indices to interested nodes. This paper proposes the Dynamic-tree based Update Propagation (DUP) scheme, which builds the update propagation tree to facilitate the propagation of indices. Because the update propagation tree only involves nodes that are essential for update propagation, the overhead of DUP is very small and the query latency is significantly reduced.

AB - In peer-to-peer networks, indices are used to map data id to nodes that host the data. The performance of data access can be improved by actively pushing indices to interested nodes. This paper proposes the Dynamic-tree based Update Propagation (DUP) scheme, which builds the update propagation tree to facilitate the propagation of indices. Because the update propagation tree only involves nodes that are essential for update propagation, the overhead of DUP is very small and the query latency is significantly reduced.

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

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

U2 - 10.1109/ICDE.2005.52

DO - 10.1109/ICDE.2005.52

M3 - Conference contribution

AN - SCOPUS:28444446676

SN - 0769522858

T3 - Proceedings - International Conference on Data Engineering

SP - 258

EP - 259

BT - Proceedings - 21st International Conference on Data Engineering, ICDE 2005

ER -

Yin L, Cao G. DUP: Dynamic-tree based update propagation in peer-to-peer networks. In Proceedings - 21st International Conference on Data Engineering, ICDE 2005. 2005. p. 258-259. (Proceedings - International Conference on Data Engineering). https://doi.org/10.1109/ICDE.2005.52