by Shuming Shi, Guangwen Yang, Dingxing Wang, Jin Yu, Shaogang Qu, Ming Chen
In Proceedings of the 3rd IPTPS
http://iptps04.cs.ucsd.edu/papers/shi-keysearch.pdf
Add To MetaCart
Abstract:
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. 1.
Citations
|
2113
|
Chord: A scalable peer-to-peer lookup service for internet applications
– Stoica, Morris, et al.
|
|
1137
|
Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems
– Rowstron, Druschel
- 2001
|
|
768
|
Tapestry: An infrastructure for fault-tolerant wide-area location and routing
– Zhao, Kubiatowicz, et al.
- 2001
|
|
499
|
How to Model an Internetwork
– Zegura, Calvert, et al.
- 1996
|
|
304
|
Predicting Internet Network Distance with Coordinates-Based Approaches
– Ng, Zhan
- 2002
|
|
177
|
Skipnet: A scalable overlay network with practical locality properties
– Harvey, Jones, et al.
- 2003
|
|
114
|
Complex queries in dht-based peerto-peer networks
– Harren
- 2002
|
|
105
|
Efficient peer-to-peer keyword searching
– Reynolds, Vahdat
- 2002
|
|
84
|
On the feasibility of peer-to-peer web indexing and search
– Li, Loo, et al.
- 2003
|
|
43
|
A keyword set search system for peer-to-peer networks
– Gnawali
- 2002
|
|
39
|
et al., “A Scalable Content Addressable Network
– Ratnasamy
|
|
28
|
PeerSearch: Efficient Information Retrieval in Peer-to-Peer Networks
– Tang, Xu, et al.
- 2002
|
|
22
|
Distributed query processing using partitioned inverted files
– Badue, Baeza-Yates, et al.
- 2001
|
|
3
|
Sudarshan Chawathe, Vijay Gopalakrishnan, Pete Keleher, and Bujor Silaghi, “Efficient peer-to-peer searches using result-caching
– Bhattacharjee
- 2003
|
|
2
|
Chunqiang Tang and Zheng Zhang, Building Topology-Aware Overlays Using Global Soft-State
– Xu
|
|
1
|
Hybrid partitioned inverted indices for large-scale digital libraries
– Sornil, Fox
- 2001
|
|
1
|
Mallik Mahalingam and Magnus Karlsson. Turning Heterogeneity into an Advantage in Overlay Routing
– Xu
- 2003
|
