A parallel XML documents placement algorithm based on adaptive ant clustering of chaos

To improve the placement quality of massive extensible markup language (XML) document clustering, this paper proposes a parallel xml documents placement algorithm based on the chaos principle and an ant clustering model (ACC). With the XML key the algorithm combines the ACC clustering algorithm to create a new parallel XML documents placement algorithm. The whole manual ant-swarm move dynamically by defining relevant chaos fitness function to weigh the similarity of ants and neighbor- hoods, form many independent sub populations. In the mean time, it only requires partial information to adjust the parameters of the function automatically to drive the manual ants´ movement. This series executions result in the acceleration of the XML document syncopation and improvement of the placement quality. Contrasted with other XML placement algorithms, a series of emulation experiments showed that this algorithm had a model with more visibility and less computation in XML documents.