Distributed hash tables have been thoroughly examined in terms of robustness, topology-awareness and routing efficiency. However the dynamic composition of distributed hash tables has been neglected or has been dealt with only out of necessity. Future Internet networking envisions interaction and cooperation of autonomous networks, which often result in network (de)compositions where merging of distributed hash tables should be taken into consideration. Chord-Zip, a novel algorithm has been developed to efficiently and transparently handle the merging of Chord rings - a distributed hash table type - to their applications.