A Survey of Blind Search Techniques in Structured P2P Networks
Abstract
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. This means in a simple DHT it is not possible to perform range queries, wild-card or full-text searching, which limits their application in the real world. In this work we review the existing methods for performing complex queries on top of structured P2P networks; focusing on methods which allow for full-text search rather than only keyword queries. It should be obvious that to perform blind search with support for full-text queries the query must be processed locally at each node, and as such the problem of blind search is almost identical to the problem of efficiently broadcasting; with the difference that queries need not always reach all nodes to be successful. The majority of existing algorithms exploit the structure inherent in DHTs to efficiently broadcast the search query over the entire network.
Author-supplied keywords
Sign up today - FREE
Mendeley saves you time finding and organizing research. Learn more
- All your research in one place
- Add and import papers easily
- Access it anywhere, anytime