Making peer-to-peer keyword searching feasible using multi-level partitioning

Lecture Notes in Computer Science

Volumn 3279, Issue , 2004, Pages 151-161

  Shi, Shuming ^a   Yang, Guangwen ^a   Wang, Dingxing ^a   Yu, Jin ^a   Qu, Shaogang ^a   Chen, Ming ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; COMMUNICATION SYSTEMS; COMPUTER NETWORKS; LARGE SCALE SYSTEMS;

KEYWORD SEARCHING; MULTI-LEVEL PARTITIONING (MLP); P2P NETWORKS; QUERY FLOODING;

ONLINE SEARCHING;

EID: 23944443271     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. C. Badue, R. Baeza-Yates, B. Ribeiro-Neto, and N. Ziviani. Distributed query processing using partitioned inverted files. In Proc. of the 9th String Processing and Information Retrieval Symposium (SPIRE), September 2002.
2. Bobby Bhattacharjee, Sudarshan Chawathe, Vijay Gopalakrishnan, Pete Keleher and Bujor Silaghi. Efficient Peer-To-Peer Searches Using Result-Caching. IPTPS 2003.
3. S. Eugene Ng and Hui Zhang. Predicting Internet Network Distance with Coordinates-Based Approaches. In IEEE INFOCOM'02, 2002.
4. Gnutella. http://gnutella.wego.com.
5. Google. http://www.google.com.
6. O. D. Gnawali. 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, Apr. 2001.
7. M. Harren, J. M. Hellerstein, etc. Complex Queries in DHT-based Peer-to-Peer Networks. IPTPS'02.
8. http://e.pku.edu.cn.
9. KaZaA. http://kazaa.com.
10. Jinyang Li, Boon Thau Loo, etc. On the Feasibility of Peer-to-Peer Web Indexing and Search. IPTPS 2003.
11. Marcelo Pias, Jon Crowcroft, Steve Wilbur, Tim Harris, and Saleem Bhatti. Lighthouse for Scalable Distributed Location. IPTPS 2003.
12. Nicholas J. A. Harvey, Michael B. Jones, Stefan Saroiu, Marvin Theimer and Alec Wolman. SkipNet: A Scalable Overlay Network with Practical Locality Properties. USITS'03, 2003.
13. S. Ratnasamy, et al. A Scalable Content-Addressable Network, in ACM SIGCOMM' 2001. San Diego, CA, USA.
14. P. Reynolds and A. Vahdat. Efficient Peer-to-Peer Keyword Searching. Middleware'03, 2003.
15. Rowstron, A. and P. Druschel. Pastry: Scalable, distributed object location and routing for largescale peer-to-peer systems, in IFIP/ACM Middleware. 2001. Heidelberg, Germany.
16. O. Sornil and E. A. Fox. Hybrid partitioned inverted indices for large-scale digital libraries. In Proceedings of the 4th International Conference of Asian Digital Libraries, Bangalore, India, 2001.
17. Stoica, I., et al. Chord: A scalable peer-to-peer lookup service for Internet applications, in ACM SIGCOMM. 2001. San Diego, CA, USA.
18. C. Tang, Z. Xu and M. Mahalingam. Peersearch: Efficient information retrieval in peer-to-peer networks. In Proceedings of HotNets-I, ACM SIGCOMM, 2002.
19. Zhichen Xu, Mallik Mahalingam and Magnus Karlsson. Turning Heterogeneity into an Advantage in Overlay Routing. Infocom'03, 2003.
20. Zhichen Xu, Chunqiang Tang, Zheng Zhang. Building Topology-Aware Overlays Using Global Soft-State. ICDCS 2003.
21. Beverly Yang and Hector Garcia-Molina. Efficient Search in Peer-to-peer Networks. ICDCS'02, 2002.
22. E. Zegura, K. Calvert, and S. Bhattacharjee. How to Model an Internetwork. In Proc. of IEEE Infocom'96, CA, May 1996.
23. Zhao, B. Y,. Kubiatowicz, J.D., and Josep, A.D. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Tech. Rep. UCB/CSD-01-1141, UC Berkeley, EECS, 2001.
24. Shuming Shi, Guangwen Yang, Dingxing Wang, Jin Yu, Shaogang Qu, Ming Chen. Peer-to-Peer Index Partitioning for Large Scale Keyword Searching. Technique report, Tsinghua University, 2003. http://hpc.cs.tsinghua.edu.cn/ clairvoyant/index.htm.