21st International Conference on Data Engineering (ICDE'05) Tokyo, Japan April 05-April 08 ISBN: 0-7695-2285-8
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 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||