DUP: Dynamic-Tree Based Update Propagation in Peer-to-Peer Networks

	This Article
	PDF RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Liangzhong Yin Articles by Guohong Cao

21st International Conference on Data Engineering (ICDE'05)

DUP: Dynamic-Tree Based Update Propagation in Peer-to-Peer Networks (PDF)

Tokyo, Japan

April 05-April 08

ISBN: 0-7695-2285-8

	ASCII Text	x
	Liangzhong Yin, Guohong Cao, "DUP: Dynamic-Tree Based Update Propagation in Peer-to-Peer Networks," Data Engineering, International Conference on, pp. 258-259, 21st International Conference on Data Engineering (ICDE'05), 2005.

	BibTex	x
	@article{ 10.1109/ICDE.2005.52, author = {Liangzhong Yin and Guohong Cao}, title = {DUP: Dynamic-Tree Based Update Propagation in Peer-to-Peer Networks}, journal ={Data Engineering, International Conference on}, volume = {0}, year = {2005}, issn = {1084-4627}, pages = {258-259}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICDE.2005.52}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Data Engineering, International Conference on TI - DUP: Dynamic-Tree Based Update Propagation in Peer-to-Peer Networks SN - 1084-4627 SP258 EP259 A1 - Liangzhong Yin, A1 - Guohong Cao, PY - 2005 KW - null VL - 0 JA - Data Engineering, International Conference on ER -

Liangzhong Yin, Pennsylvania State University

Guohong Cao, Pennsylvania State University

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDE.2005.52

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.

Citation:

Liangzhong Yin, Guohong Cao, "DUP: Dynamic-Tree Based Update Propagation in Peer-to-Peer Networks," icde, pp.258-259, 21st International Conference on Data Engineering (ICDE'05), 2005

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.