Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
