| [1]郭健美,宋顺林,肖仁财.高效的关联规则挖掘算法［J］.计算机工程与设计,2008,29(13):3378-3380.[2]AGRAWAL R, IMIELINSK T, SWAMI A. Mining association rules between sets of items in large database ［J］. ACM SIGMOD Record, 2008, 22(2): 207-216.[3]GRAHNE G, ZHU J F. Fast algorithms for frequent itemset mining using FP-trees ［J］. IEEE Transactions on Knowledge and Data Engineering, 2010, 17(10): 1347-1362.[4]ZHOU JIAOGEN, GUAN JIHONG, LI PINGXIANG. DCAD: A dual clustering algorithm for distributed spatial databases [J]. Geo-spatial Information Science, 2007, 10(2):137-144.[5]谭淑丹,彭舰,李雪韬.基于Chord的多集群网格系统资源查找算法改进［J］.计算机应用,2009,29(S1):26-29.[6]李建军,熊选东,谭晓贞.基于多环的Chord改进算法［J］.计算机工程,2010,36(2):116-118.[7]RAMASWAMY L, GEDIK B, LIU L. A distributed approach to node clustering in decentralized peer-to-peer networks ［J］. IEEE Transactions on Parallel and Distributed Systems, 2008, 16(9):814-829.[8]LEI PENG, GUODONG LI, LIU CHANGAN. The application research of resources catalog in the network technology information organizations ［C］// Proceedings of 2010 4th International Conference on Intelligent Information Databases. Oulu, Finland: Academy Publisher, 2007: 167-172.[9]王必晴,钟志水,孟伟东. S-Chord:一种层次式Chord路由模型［J］.计算机工程,2011,37(1):96-100.[10]赵静,张振宇.基于Chord的P2P路由模型［J］.计算机应用,2010,30(10):2645-2647.[11]DABEK F, COX R, KAASHOEK F. Vivaldi: A decentralized network coordinate system ［C］// Proceedings of the 2004 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. New York: ACM Press, 2003: 15-26.[12]郭松梅,王新生,龚华,等.基于网络拓扑和节点异构的Chord系统［J］.计算机科学,2009,36(3):90-92. |
