A Novel Top-down Algorithm of Frequent XML Query Pattern Mining

摘要

Providing efficient query to XML documents is crucial, as XML has become the most important technique to exchange data in WWW. Due to its tree-structure paradigm, XML is superior for its capability of storing and querying complex data. Therefore, discovering frequent XML query patterns over user queries has become an interesting topic for XML data management. In this paper, we present an efficient mining algorithm, named TXMiner, to find frequent XML query patterns. Unlike the existing algorithms, we propose a new idea by only enumerating and testing candidate subtrees from infrequent XML queries in our TXMiner algorithm. Furthermore, our Simulation results show that TXMiner outperforms other algorithms in its execution time.