Abstract
This paper discusses large scale keyword searching on top of peer-to-peer (P2P) networks. The state-of-the-art keyword searching techniques for unstructured and structured P2P systems are query flooding and inverted list intersection respectively. However, it has been demonstrated that P2P-based large scale full-text searching is not feasible by using either of the two techniques. We propose in this paper a new index partitioning and building scheme, multi-level partitioning (MLP), and discuss its implementation on top of P2P networks. MLP can dramatically reduce bisection bandwidth consumption and end-user latency compared with the partition-by-keyword scheme. And comparing with partition-by-document, it need only broadcast a query to moderate number of peers to generate precise results.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Badue, C., Baeza-Yates, R., Ribeiro-Neto, B., Ziviani, N.: Distributed query processing using partitioned inverted files. In: Laender, A.H.F., Oliveira, A.L. (eds.) SPIRE 2002. LNCS, vol. 2476, Springer, Heidelberg (2002)
Bhattacharjee, B., Chawathe, S., Gopalakrishnan, V., Keleher, P., Silaghi, B.: Efficient Peer-To-Peer Searches Using Result-Caching. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, Springer, Heidelberg (2003)
Eugene Ng, S., Zhang, H.: Predicting Internet Network Distance with Coordinates-Based Approaches. In: IEEE INFOCOM 2002 (2002)
Gnutella, http://gnutella.wego.com
Google, http://www.google.com
Gnawali, O.D.: A Keyword Set Search System for Peer-to-Peer Networks. Master’s thesis, Massachusetts Institute of Technology (June 2002); UCB/CSD-01-1141, UC Berkeley (April 2001)
Harren, M., Hellerstein, J.M., et al.: Complex Queries in DHT-based Peer-to-Peer Networks. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 242. Springer, Heidelberg (2002)
KaZaA, http://kazaa.com
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)
Pias, M., Crowcroft, J., Wilbur, S., Harris, T., Bhatti, S.: Lighthouse for Scalable Distributed Location. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, Springer, Heidelberg (2003)
Harvey, N.J.A., Jones, M.B., Saroiu, S., Theimer, M., Wolman, A.: SkipNet: A Scalable Overlay Network with Practical Locality Properties. In: USITS 2003 (2003)
Ratnasamy, S., et al.: A Scalable Content-Addressable Network. In: ACM SIGCOMM, San Diego, CA, USA (2001)
Reynolds, P., Vahdat, A.: Efficient Peer-to-Peer Keyword Searching. In: Endler, M., Schmidt, D.C. (eds.) Middleware 2003. LNCS, vol. 2672, Springer, Heidelberg (2003)
Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for largescale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, p. 329. Springer, Heidelberg (2001)
Sornil, O., Fox, E.A.: Hybrid partitioned inverted indices for large-scale digital libraries. In: Proceedings of the 4th International Conference of Asian Digital Libraries, Bangalore, India (2001)
Stoica, I., et al.: Chord: A scalable peer-to-peer lookup service for Internet applications. In: ACM SIGCOMM, San Diego, CA, USA (2001)
Tang, C., Xu, Z., Mahalingam, M.: Peersearch: Efficient information retrieval in peer-topeer networks. In: Proceedings of HotNets-I, ACM SIGCOMM (2002)
Xu, Z., Mahalingam, M., Karlsson, M.: Turning Heterogeneity into an Advantage in Overlay Routing. In: Infocom 2003 (2003)
Xu, Z., Tang, C., Zhang, Z.: Building Topology-Aware Overlays Using Global Soft-State. In: ICDCS 2003 (2003)
Yang, B., Garcia-Molina, H.: Efficient Search in Peer-to-peer Networks. In: ICDCS 2002 (2002)
Zegura, E., Calvert, K., Bhattacharjee, S.: How to Model an Internetwork. In: Proc. of IEEE Infocom 1996, CA (May 1996)
Zhao, B.Y.,, Kubiatowicz, J.D., Josep, A.D.: Tapestry: An infrastructure for faulttolerant wide-area location and routing. Tech. Rep. UCB/CSD-01-1141, UC Berkeley, EECS (2001)
Shi, S., Yang, G., Wang, D., Yu, J., Qu, S., Chen, M.: Peer-to-Peer Index Partitioning for Large Scale Keyword Searching. Technique report, Tsinghua University (2003), http://hpc.cs.tsinghua.edu.cn/clairvoyant/index.htm
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
Shi, S., Yang, G., Wang, D., Yu, J., Qu, S., Chen, M. (2005). Making Peer-to-Peer Keyword Searching Feasible Using Multi-level Partitioning. In: Voelker, G.M., Shenker, S. (eds) Peer-to-Peer Systems III. IPTPS 2004. Lecture Notes in Computer Science, vol 3279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30183-7_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-30183-7_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24252-9
Online ISBN: 978-3-540-30183-7
eBook Packages: Computer ScienceComputer Science (R0)