Distributed suffix tree overlay for peer-to-peer search

IEEE Transactions on Knowledge and Data Engineering

Volumn 20, Issue 2, 2008, Pages 276-285

  Zhuge, Hai ^a,b   Feng, Liang ^b  

^a IEEE   (China)

^b INSTITUTE OF COMPUTING TECHNOLOGY   (China)

Author keywords

DHT; Knowledge grid; Load balance; Peer to peer; Semantic overlay; Suffix tree

Indexed keywords

COMPUTER NETWORKS; KNOWLEDGE ACQUISITION; PARALLEL ALGORITHMS; RESOURCE ALLOCATION;

DISTRIBUTED SUFFIX TREE; KEYWORD SEQUENCE; KNOWLEDGE GRID; PEER-TO-PEER SEARCH; SEMANTIC OVERLAY;

SEARCH ENGINES;

EID: 37549025868     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2007.190688     Document Type: Article

References (37)

1. B. H. Bloom. Space/Time Trade-offs in Hash Coding with Allowable Errors. Communications of the ACM, vol.13, no.7, 1970, pp.422–426.
2. A. Bonifati, U. Matrangolo, A. Cuzzocrea, and M. Jain. XPath Lookup Queries in P2P Networks. In ACM CIKM International Workshop on Web Information and Data Management, 2004.
3. Y. Chawathe, S. Ramabhadran, S. Ratnasamy, A. LaMarca, J. Hellerstein, and S. Shenker. A Case Study in Building Layered DHT Applications. In Proceedings of ACM SIGCOMM, Aug. 2005, pp. 97–108
4. I. Clarke, O. Sandberg, B. Wiley, and T. Hong. Freenet: A Distributed Anonymous Information Storage and Retrieval System. In Proceedings of the Workshop on Design Issues in Anonymity and Unobservability, Jul. 2000, pp. 46–66.
5. A. Crespo, and H. Garcia-Molina. Routing Indices for Peer-to-Peer Systems. In Proceedings of the International Conference on Distributed Computing Systems, Jul. 2002, pp. 23–32.i
6. F. M. Cuenca-Acuna, and T. D. Nguyen. Text-based Content Search and Retrieval in ad hoc P2P Communities. In Proceedings of the International Workshop on Peer-to-Peer Computing, May. 2002, pp. 220-234.
7. DBLP XML Database. http://dblp.uni-trier.de/xml
8. F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica. Wide-area Cooperative Storage with CFS. In Proceedings of the ACM Symposium on Operating Systems Principles, Oct. 2001, pp. 202–215.
9. M. J. Freedman, and R. Vingralek. Efficient Peer-to-Peer Lookup Based on a Distributed Trie. In Proceedings of the International Workshop on Peer-to-Peer Systems, Mar. 2002, pp. 66–75.
10. L. Galanis, Y. Wang, S. Jeffery, and D. DeWitt. Locating Data Sources in Large Distributed Systems. In Proceedings of the International Conference on Very Large Data Bases, Sep. 2003, pp. 874–885.
11. L. Garcés-Erice, P.A. Felber, E.W. Biersack, G. Urvoy-Keller, and K.W. Ross, "Data Indexing in Peer-to-Peer DHT Networks," Proc. 24th Int'l Conf. Distributed Computing Systems (ICDCS '04), pp. 200-208, Mar. 2004.
12. O. D. Gnawali. A Keyword Set Search System for Peer-to-Peer Networks. Master's thesis, Massachusetts Institute of Technology, Jun. 2002.
13. Gnutella website. http://www.gnutella.com
14. M. Harren, et al. Complex Queries in DHT-based Peer-to-Peer Networks. In Proceedings of the International Workshop on Peer-to-Peer Systems, 2002, pp. 242–250.
15. D. Karger, E. Lehman, F. Leighton, M. Levine, D. Lewin, and R. Panigrahy. Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web. In Proceedings of the Annual ACM Symposium on Theory of Computing, May. 1997, pp. 654–663.
16. D. E. Knuth. The Art of Computer Programming, vol. 3: Sorting and Searching. Second Edition, Addison-Wesley, Mass, 1973.
17. G. Koloniari, and E. Pitoura. Peer to Peer Management of XML Data: Issues and Research Challenges. In Proceedings of ACM SIGMOD, Jun. 2005, pp. 6–17.
18. B. Kröll, and P. Widmayer. Distributing a Search Tree among a Growing Number of Processors. In Proceedings of the ACM SIGMOD, May. 1994, pp. 265–276.
19. J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells, and B. Zhao. OceanStore: An Architecture for Global-Scale Persistent Storage. In Proceedings of the International Conference on Architectural Support for Programming Languages and Operating Systems, Nov. 2000, pp. 190–201.
20. J. Li, B. T. Loo, J. Hellerstein, F. Kaashoek, D. R. Karger, and R. Morris. On the Feasibility of Peer-to-Peer Web Indexing and Search. In Proceedings of the International Workshop on Peer-to-Peer Systems, Feb. 2003, pp. 207–215.
21. E.M. McCreight, "A Space-Economical Suffix Tree Construction Algorithm," J. ACM, vol. 23, no. 2, pp. 262-272, 1976.
22. R. Motwani, and P. Raghavan. Randomized Algorithms. Cambridge University Press, New York, 1995.
23. Napster. http://www.napster.com
24. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A Scalable Content-Addressable Network," Proc. ACM SIGCOMM '01, pp. 161-172, Aug. 2001.
25. P. Reynolds and A. Vahdat. Efficient Peer-to-peer Keyword Searching. In Proceedings of International Middleware Conference, Jun. 2003, pp. 21–44.
26. A. Rowstron, and P. Druschel. Pastry: Scalable, Distributed Object Location and Routing for Large-scale Peer-to-peer Systems. In ACM/IFIP/USENIX International Middleware Conference, Nov. 2001.
27. C. Schmidt, and M. Parashar. Flexible Information Discovery in Decentralized Distributed Systems. In the IEEE International Symposium on High-Performance Distributed Computing, 2003.
28. I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H. Balakrishnan, "Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications," Proc. ACM SIGCOMM '01, pp. 149-160, Aug. 2001.
29. C. Tang and S. Dwarkadas, "Hybrid Global-Local Indexing for Efficient Peer-to-Peer Information Retrieval," Proc. First Symp. Networked Systems Design and Implementation (NSDI '04), pp. 211-224, Mar. 2004.
30. C. Tang, Z. Xu, and S. Dwarkadas. Peer-to-Peer Information Retrieval Using Self-Organizing Semantic Overlay Networks. In Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, Aug. 2003, pp. 175–186.
31. B. Yang, and H. Garcia-Molina. Efficient Search in Peer-to-peer Networks. Technical Report 2001-47, Stanford University, Oct. 2001.
32. C. Zhang, A. Krishnamurthy, and R.Y. Wang, "Brushwood: Distributed Trees in Peer-to-Peer Systems," Proc. Fourth Int'l Workshop Peer-to-Peer Systems (IPTPS '05), pp. 47-57, Feb. 2005.
33. Skipindex: Towards a scalable peer-to-peer index service for high dimensional data.
34. B. Y. Zhao, J. Kubiatowicz, and A. Joseph. Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing. Technical Report: UCB/CSD-01-1141, University of California at Berkeley, Computer Science Department, 2001.
35. H. Zhuge. The Knowledge Grid. World Scientific, Singapore, 2004.
36. H. Zhuge, J. Liu, L. Feng, X. Sun, and C. He. Query Routing in a Peer-to-Peer Semantic Link Network. Computational Intelligence, vol. 21, no. 2, 2005, pp.197–216.
37. H. Zhuge, X. Sun, J. Liu, E. Yao, and X. Chen, "A Scalable P2P Platform for the Knowledge Grid," IEEE Trans. Knowledge and Data Eng., vol. 17, no. 12, pp. 1721-1736, Dec. 2005.