A Survey of Blind Search Techniques in Structured P2P Networks
The ability to perform complex queries is one of the most important features in many of the P2P networks actually deployed today. While structured P2P networks can provide very efficient look-up operations via a Distributed Hash Table (DHT) interface, they traditionally do not provide any methods for complex queries. This can be attributed to the use of consistent hashing, which causes data to be distributed uniformly over the entire network. Since consistent hashing does not preserve locality there is no guarantee, in fact it is highly unlikely, that similar search terms will have their data stored together.