Making Peer-to-Peer Keyword Searching Feasible Using Multi-level Partitioning

—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 and end-user latency compared to the partition-by-keyword scheme. And compare to partition-bydocument, it need only broadcast a query to moderate number of peers to generate precise results.

• Type: Conference
• Year: 2004
• Where: IPTPS
• Authors: Shuming Shi, Guangwen Yang, Dingxing Wang, Jin Yu, Shaogang Qu, Ming Chen
• Keywords: IPTPS 2004, Keyword Searching Techniques, Large Scale, Large Scale Keyword