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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Deerwester, S.C., Dumais, S.T., Landauer, T.K., Furnas, G.W., Harshman, R.A.: Indexing by Latent Semantic Analysis. Journal of the American Society of Information Science 41(6), 391–407 (1990)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable –addressable network. In: ACM SIGCOMM 2001 (August 2001)
Gnutella, http://gnutella.wego.com
Kazaa, http://www.kazza.com
Ingram: Record Industry Plays Hardball with Kazaa, http://www.globeandmail.com/
Why Gnutella Can’t Scale. No, Really, http://www.darkridge.com/~jpr5/doc/gnutella.html
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content Addressable Network. In: Proceedings of the 2001 ACM SIGCOM Conference, Berkeley, CA (August 2001)
Rowstron, A., Druschel, P.: Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, p. 329. Springer, Heidelberg (2001)
Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: Scalable Peer- To-Peer
Berry, M., Drmac, Z., Jessup, E.: Matrices, Vector Spaces, and Information Retrieval. SIAM Review 41(2), 335–362 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, F., Zhang, Wj., Ma, Fy., Li, Ml. (2004). SPSS: A Case of Semantic Peer-to-Peer Search System. In: Zhou, X., Su, S., Papazoglou, M.P., Orlowska, M.E., Jeffery, K. (eds) Web Information Systems – WISE 2004. WISE 2004. Lecture Notes in Computer Science, vol 3306. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30480-7_74
Download citation
DOI: https://doi.org/10.1007/978-3-540-30480-7_74
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23894-2
Online ISBN: 978-3-540-30480-7
eBook Packages: Springer Book Archive