摘要
针对海量XML文档查询复杂等问题,本文尝试通过XML键约束及其矢量化操作,根据混沌原理,融入蚁群聚类算法构建并行XML数据库分片新模型(简称ACC);通过定义相应混沌适应度函数衡量蚂蚁与其邻域的相似程度,让整个人工蚁群在移动中动态地形成多个独立的子群体,同时对函数参数进行自适应的调整,使得人工蚁的移动仅仅使用少量的局部信息,加快XML分片速度并且提高分片质量.对比其它XML分片算法,一系列仿真实验表明利用混沌蚁群模型分片XML,在模型上更直观,计算代价较小.
Considering the complexity of query for the mass XML documents, this paper proposed a new model of the parallel XML Databases by the restriction and the vector operation of XML-keys basing the chaos principle and combining the ACO clustering algorithm （contraction is ACC）. By defining relevant chaos fitness function to weight the similarity of ants and neighborhoods, let the whole manual ant-swarm move dynamically to form many independent sub populations, meanwhile adjust the parameters of the function so as to need only a few of partial, information in the manual ants movement to faster the XML document syncopation and improve the placement quality. Contrasted with other XML placement algorithms, a series of emulation experiments show that this algorithm has a more visible model and a less computation in XML documents by the chaos ant model.
出处
《小型微型计算机系统》
CSCD
北大核心
2008年第12期2319-2323,共5页
Journal of Chinese Computer Systems
基金
湖南信息职业学院科技创新项目(108652006011)资助
湖南省教育厅科研基金项目(05C671)资助
