Search Co-Ordination by Semantic Routed Network
Amitava Biswas, Suneil Mohan, Rabi Mahapatra · 2009
Specialized search engines have potential to provide superior search precision, relevance and recall. A specialized P2P overlay network called semantic routed network, which forwards search queries based on their meanings, can unify a large number of specialized search engines under a single Internet wide search service. Providing fast and successful routing of search queries is a challenging task due to conflicting tradeoff requirements. We present P2P topology generation and semantic routing table compaction techniques to realize fast and successful query routing. Our simulation shows that a SRN coordinating 800 search engines can achieve a competitive 100% query routing success within 6 messaging delays, and have query delivery response of 1.89 messaging delays.