TY - GEN
T1 - DUP
T2 - 21st International Conference on Data Engineering, ICDE 2005
AU - Yin, Liangzhong
AU - Cao, Guohong
PY - 2005
Y1 - 2005
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
Y2 - 5 April 2005 through 8 April 2005
ER -