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 Scopus citations

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

All Science Journal Classification (ASJC) codes

  • Software
  • Signal Processing
  • Information Systems

Fingerprint Dive into the research topics of 'DUP: Dynamic-tree based update propagation in peer-to-peer networks'. Together they form a unique fingerprint.

Cite this