Frequent XML Query Pattern Mining based on FP-TRee

Authors:
Mi Sug Gu;Jeong Hee Hwang;Keun Ho Ryu
Affiliations:
Chungbuk National University, Korea;Nam Seoul University, Korea;Chungbuk National University, Korea
Venue:
DEXA '07 Proceedings of the 18th International Conference on Database and Expert Systems Applications
Year:
2007

Citing 0
Cited 2

Bottom-up discovery of frequent rooted unordered subtrees

Information Sciences: an International Journal
An efficient algorithm of frequent XML query pattern mining for ebXML applications in e-commerce

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

XML data are increasing in many areas including internet and public documentation. XML data change dynamically while processing the query. Many kinds of techniques have been researched to speed up the query performance about XML data structures. In this paper, based on the XML structure, we analyze the query pattern and propose the data mining technique about extracting the similar query pattern by the users. In this paper to speed up the performance we used FP-growth algorithm for mining similar query patterns about the XML data structure. We confirmed that the proposed method using FP-growth algorithm applied to XML query subtrees outperforms Apriori algorithm. The proposed method gives the fast query result about the repeatedly occurring queries.