Abstract
The state-of-the-art keyword search system for structured P2P systems is built on the distributed inverted index. However, Distributed inverted index by keywords may incur significant bandwidth for executing more complicated search queries such as multiple-attribute queries. In order to reduce query overhead, KSS (Keyword Set Search) by Gnawali partitions the index by a set of keywords. However, a KSS index is considerably larger than a standard inverted index, since there are much more word sets than individual words. And the insert overhead and storage overhead are obviously unacceptable for full-text search on a collection of documents. In this paper, we presents pKSS, a P2P keyword search system that that adopts term ranking approach such as TFIDF and exploits the relationship information between query keywords to improve performance of P2P keyword search. Experimental results clearly demonstrated that the improved keyword search is more efficient than KSS index in insert overhead and storage overhead, and much less than standard inverted index on bandwidth costs for a query.
Supported by The Science & Technology Committee of Shanghai Municipality Key Project Grant 03dz15027 and 03dz15028.
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.
Similar content being viewed by others
References
Stoica, I., Morris, R., Karger, D., Kaashoek, M., Balakrishnan, H.: Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In: Proc. ACM SIGCOMM 2001 (August 2001)
Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. Proc. Middleware (November 2001)
Omprakash, D.G.: A Keyword-set Search System for Peer-to-Peer Networks. MIT’s thesis Lib. (2002)
Reynolds, P., Vahdat, A.: Efficient peer-to-peer keyword searching. Technical Report 2002, Duke University, CS Department (February 2002)
Li, J., Loo, B.T., et al.: On the Feasibility of Peer-to-Peer Web Indexing and Search. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735. Springer, Heidelberg (2003)
Shi, S., Yang, G., Wang, D., Yu, J., Qu, S., Chen, M.: Making Peer-to-Peer Keyword Searching Feasible Using Multi-level Partitioning. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol. 3279, pp. 151–161. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, Y., Ma, F., Zhang, L. (2005). pKSS: An Efficient Keyword Search System in DHT Peer-to-Peer Network. In: Hobbs, M., Goscinski, A.M., Zhou, W. (eds) Distributed and Parallel Computing. ICA3PP 2005. Lecture Notes in Computer Science, vol 3719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11564621_12
Download citation
DOI: https://doi.org/10.1007/11564621_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29235-7
Online ISBN: 978-3-540-32071-5
eBook Packages: Computer ScienceComputer Science (R0)