Selecting frequent paths in XML queries
Weiyi Liu · Yunnan Daxue xuebao. Shehui kexue ban · 2007
The algorithm for selecting frequent paths in XML query statements conforming to the given DTD is proposed.That is,the most frequent appearing paths are selected from a workload of XML queries.First,XML queries are decomposed into discrete ones.Then the frequent paths are selected based on the algorithm for mining frequent item sets without candidates.Following,the XML queries including the frequent paths are reconstructed.Experimental analysis shows the effectiveness and feasibility of our methods.