SPSS: A case of Semantic Peer-to-Peer Search System

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

Abstract

Traditional search system approaches have either been centralized or use flooding to ensure accuracy of the results returned which have bad performance. This paper presents SPSS (Semantic Peer-to-Peer Search System) that search documents through the P2P network hierarchically based on document semantic vector generated by Latent Semantic Indexing (LSI) [1]. The search cost for a given query is thereby reduced, since the indices of semantically related documents are likely to be co-located in the network. SPSS organize contents around their semantics in a P2P network. This makes it achieve accuracy comparable to centralized search systems. CAN [2] and range addressable network are used to organize the computing nodes. Owning to the hierarchical overlay network, the average number of logical hops per query is smaller than other flat architectures. Both theoretical analysis and experimental results show that SPSS has higher accuracy and less logic hops. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Liu, F., Zhang, W. J., Ma, F. Y., & Li, M. L. (2004). SPSS: A case of Semantic Peer-to-Peer Search System. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3306, 718–723. https://doi.org/10.1007/978-3-540-30480-7_74

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