<Towards a unifying framework for complex query processing over structured peer-to-peer data network>
For a resource R(a1,a2,...,ak) with k attributes, store in DHT. First the key of the tuple R:(a1,a2,...,ak) is inserted, then the key of its k attribute values in inserted. totally (k+1) copies.
