Query processing of streamed XML data
Proceedings of the eleventh international conference on Information and knowledge management
Efficient management of XML contents over wireless environment by Xstream
Proceedings of the 2004 ACM symposium on Applied computing
Hi-index | 0.00 |
Recently XML fragments processing prevails over the Web due to its flexibility and manageability. In this paper, we propose two techniques for document fragmentation considering the query statistics over XML data: path frequency tree (PFT) and Markov tables. Both techniques work by merging the nodes of low inquiring frequency to enhance fragment utilization, or by merging the nodes of high inquiring frequency to enhance fragment cohesion. Performance study shows that our algorithms perform well on query cost and other metrics.