Search Co-ordination by Semantic Routed Network Conference Paper

abstract

• 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. 2009 IEEE.

name of conference

• 2009 Proceedings of 18th International Conference on Computer Communications and Networks

authors

• Mahapatra, Rabinarayan

published proceedings

• 2009 Proceedings of 18th International Conference on Computer Communications and Networks

author list (cited authors)

• Biswas, A., Mohan, S., & Mahapatra, R.

citation count

• 6

complete list of authors

• Biswas, Amitava||Mohan, Suneil||Mahapatra, Rabi

publication date

• August 2009

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• Proceedings - International Conference on Computer Communications and Networks, ICCCN  Journal

Digital Object Identifier (DOI)

• 10.1109/icccn.2009.5235253

International Standard Book Number (ISBN) 13

• 9781424445813

start page

• 202

end page

• 214

URL

• http://dx.doi.org/10.1109/icccn.2009.5235253