Download Now Free registration required
Effective peer selection for intelligent query routing is a challenge in collaborative peer-based Web search systems, especially unstructured networks that do not have any centralized control of peer document collections. In particular, routing a query to multiple peers that provide the same results is a waste of resources. To deal with overlapping document collections the paper proposes a diverse peer selection approach for adaptive query routing. This approach takes into account not only which neighbors are the best resource providers for a given query, but also which combinations of neighbors can provide the least redundant results. The paper validates the feasibility of the proposed algorithm by presenting several simulation experiments conducted with different configurations of peer network environments.
- Format: PDF
- Size: 190.9 KB