An efficient algorithm of frequent XML query pattern mining for ebXML applications in e-commerce

Authors:
Tsui-Ping Chang;Shih-Ying Chen
Affiliations:
Department of Information Technology, Ling Tung University, Taichung 408, Taiwan, ROC;Department of Computer Science and Information Engineering, National Taichung Institute of Technology, Taichung 404, Taiwan, ROC
Venue:
Expert Systems with Applications: An International Journal
Year:
2012

Citing 13
Cited 0

Mining association rules between sets of items in large databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Mining Frequent Quer Patterns from XML Queries

DASFAA '03 Proceedings of the Eighth International Conference on Database Systems for Advanced Applications
ViST: a dynamic index method for querying XML data by tree structures

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach

Data Mining and Knowledge Discovery
Path sharing and predicate evaluation for high-performance XML filtering

ACM Transactions on Database Systems (TODS)
Mining association rules from XML data using XQuery

ACSW Frontiers '04 Proceedings of the second workshop on Australasian information security, Data Mining and Web Intelligence, and Software Internationalisation - Volume 32
FiST: scalable XML document filtering by sequencing twig patterns

VLDB '05 Proceedings of the 31st international conference on Very large data bases
Frequent XML Query Pattern Mining based on FP-TRee

DEXA '07 Proceedings of the 18th International Conference on Database and Expert Systems Applications
Early profile pruning on XML-aware publish-subscribe systems

VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Efficient mining of frequent XML query patterns with repeating-siblings

Information and Software Technology
Value-based predicate filtering of XML documents

Data & Knowledge Engineering
Bottom-up discovery of frequent rooted unordered subtrees

Information Sciences: an International Journal

Quantified Score

Hi-index	12.05

Visualization

Abstract

Providing efficient query to XML data for ebXML applications in e-commerce is crucial, as XML has become the most important technique to exchange data over the Internet. ebXML is a set of specifications for companies to exchange their data in e-commerce. Following the ebXML specifications, companies have a standard method to exchange business messages, communicate data, and business rules in e-commerce. Due to its tree-structure paradigm, XML is superior for its capability of storing and querying complex data for ebXML applications. Therefore, discovering frequent XML query patterns has become an interesting topic for XML data management in ebXML applications. In this paper, we present an efficient mining algorithm, namely ebXMiner, to discover the frequent XML query patterns for ebXML applications. Unlike the existing algorithms, we propose a new idea by collecting the equivalent XML queries and then enumerating the candidates from infrequent XML queries in our ebXMiner. Furthermore, our simulation results show that ebXMiner outperforms other algorithms in its execution time.