2PXMiner: an efficient two pass mining of frequent XML query patterns
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Finding hot query patterns over an XQuery stream
The VLDB Journal — The International Journal on Very Large Data Bases
Mining Closed and Maximal Frequent Subtrees from Databases of Labeled Rooted Trees
IEEE Transactions on Knowledge and Data Engineering
Exploit sequencing to accelerate hot XML query pattern mining
Proceedings of the 2006 ACM symposium on Applied computing
Frequent Subtree Mining - An Overview
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
Efficient mining of XML query patterns for caching
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Efficient mining of frequent XML query patterns with repeating-siblings
Information and Software Technology
Efficient mining of frequent closed XML query pattern
Journal of Computer Science and Technology
Bottom-up discovery of frequent rooted unordered subtrees
Information Sciences: an International Journal
Mediation-Based XML Query Answerability
OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part II on On the Move to Meaningful Internet Systems
Incremental sequence-based frequent query pattern mining from XML queries
Data Mining and Knowledge Discovery
On the Discovery of Conserved XML Query Patterns for Evolution-Conscious Caching
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
A materialized view selection technique for XPath queries
ECC'08 Proceedings of the 2nd conference on European computing conference
BUXMiner: an efficient bottom-up approach to mining XML query patterns
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
Weigted-FP-tree based XML query pattern mining
ADMA'10 Proceedings of the 6th international conference on Advanced data mining and applications: Part I
An efficient algorithm of frequent XML query pattern mining for ebXML applications in e-commerce
Expert Systems with Applications: An International Journal
Search tree patterns for mobile and distributed XML processing
DBISP2P'04 Proceedings of the Second international conference on Databases, Information Systems, and Peer-to-Peer Computing
Frequent Subtree Mining - An Overview
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
| Hi-index | 0.00 |
As XML prevails over the Internet, the efficient retrievalof XML data becomes important. Research to improvequery response times has been largely concentrated onindexing XML documents and processing regular pathexpressions. Another approach is to discover frequentquery patterns since the answers to these queries can bestored and indexed. Mining frequent query patternsrequires more than simple tree matching since the XMLqueries involves special characters such as "*" or "//".In addition, the matching process can be expensive sincethe search space is exponential to the size of XMLschema. In this paper, we present two mining algorithms,XQPMiner and XQPMinerTID, to discover frequent querypattern trees from a large collection of XML queriesefficiently. Both algorithms exploit schema information toguide the enumeration of candidate subtrees, thuseliminating unnecessary node expansions. Experimentsresults show that the proposed methods are efficient andhave good scalability.