Analyses of multiple evidence combination
Proceedings of the 20th annual international ACM SIGIR conference on Research and development in information retrieval
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
NeuroGrid: Semantically Routing Queries in Peer-to-Peer Networks
Revised Papers from the NETWORKING 2002 Workshops on Web Engineering and Peer-to-Peer Computing
Make it fresh, make it quick: searching a network of personal webservers
WWW '03 Proceedings of the 12th international conference on World Wide Web
Peer-to-peer information retrieval using self-organizing semantic overlay networks
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Content-based retrieval in hybrid peer-to-peer networks
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Remindin': semantic query routing in peer-to-peer networks based on social metaphors
Proceedings of the 13th international conference on World Wide Web
Improving text collection selection with coverage and overlap statistics
WWW '05 Special interest tracks and posters of the 14th international conference on World Wide Web
Improving collection selection with overlap awareness in P2P search engines
Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval
Emerging semantic communities in peer web search
P2PIR '06 Proceedings of the international workshop on Information retrieval in peer-to-peer networks
A suite of testbeds for the realistic evaluation of peer-to-peer information retrieval systems
ECIR'05 Proceedings of the 27th European conference on Advances in Information Retrieval Research
Self-organizing peer-to-peer networks for collaborative document tracking
Proceedings of the 1st ACM international workshop on Complex networks meet information & knowledge management
| Hi-index | 0.00 |
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 we propose 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. We validate the feasibility of our proposed algorithm by presenting several simulation experiments conducted with different configurations of peer network environments. Two novel evaluation measures, distributed precision and distributed recall, are also introduced to provide an effective comparison of different peer network systems. These two performance measures extend the well known IR measures of precision and recall by integrating network costs, namely bandwidth and latency. Our algorithm finds results of equivalent quality using less time and generating less traffic in the presence of varying amounts of document duplication.