This report presents algorithms for building Distributed Hash Tables (DHT) or Structured Overlays. DHTs are used as self-managing system to deal with distributed data over large networks. The provided algorithms guarantee] building Efficient DHTs by ensuring selected proper- ties, and this for the general case. Our algorithms can be mainly used in DHT-based storage systems to build efficient systems or to recover the last configuration of the systems after crash very fast.