2[2]S Ratnasamy, P Francis, M Handley et al. A scalable content addressable network. In: ACM Special Interest Group on Data Communication (SIGCOMM) 2001. New York: ACM Press, 2001. 161～172
3[3]E Cohen, A Fiat, H Kaplan. Associative search in peer to peer networks: Harnessing latent semantics. In: The 22nd Annual Joint Conf of the IEEE Computer and Communications Societies (INFOCOM 2003). Vol 2. California: IEEE Computer Society Press, 2003. 1261～1271
4[4]B Bloom. Space/time tradeoffs in Hash coding with allowable errors. Communications of the ACM, 1970, 13 (7): 422～426
5[5]A Broder, M Mitzenmacher. Network applications of Bloom filters: A survey. In: Proc of the 40th Annual Allerton Conf on Communication, Control, and Computing. Illinois: University of Illinoisat Urbana-Champaign, 2002. 636～646
6[6]A Crespo, H Garcia-Molina. Semantic overlay networks, 2003. http://www-db.stanford.edu/～crespo/publications/op2p.pdf
7[7]B Y Ricardo, R N Berthier. Modern Information Retrieval. New York: Addison Wesley, 1999
8[8]I Witten, E Frank. Data mining: Practical Machine Learning Tools and Techniques with Java Implementations. San Francisco, CA: Morgan Kaufmann, 1999
9[9]Q Lv, P Cao, E Cohen et al. Search and replication in unstructured peer to peer networks. In: Proc of the 16th Annual ACM Int'l Conf on Supercomputing. New York: ACM Press, 2002. 84～95
10[10]M Mitzenmacher. Compressed Bloom filters. IEEE/ACM Trans on Networks, 2002, 10 (5): 613～620
5Ian Clarke,Oskar Sandberg,Brandon Wiley,Theodore W Hong.Freenet:A Distributed Anonymous Information Storage and Retrieval System. Lecture Notes in Computer Science . 2001
6Ye,Y,Xiao,L,Yen,I.-L,Bastani,F.Secure,dependable,and high performance cloud storage. Proceedings of the IEEE Symposium on Reliable Distributed Systems . 2010
