SemSearch: A scalable semantic searching algorithm for unstructured P2P network

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Resource searching in the current peer-to-peer (P2P) applications is mainly based on the keyword match. However, more and more P2P applications require an efficient semantic searching based on the contents. In this paper, we propose a novel scalable semantic searching algorithm named SemSearch for the unstructured P2P networks. For the consistency and flexibility of semantic analysis, we integrate global and local semantic information to do the semantic analysis. Moreover, SemSearch transfers the searching requests to the peers whose shared resources are more semantic similar to implement semantic searching. We further evaluate the performance of SemSearch through the simulation experiments. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Song, W., Li, R., Lu, Z., & Sarem, M. (2008). SemSearch: A scalable semantic searching algorithm for unstructured P2P network. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4976 LNCS, pp. 631–636). https://doi.org/10.1007/978-3-540-78849-2_63

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free