loading...
Frequent XML Query Pattern Mining based on FP-TRee
Regensburg, Germany September 03-September 07
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DEXA.2007.7818th International Conference on Data ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Mi Sug Gu, Chungbuk National University, Korea
Jeong Hee Hwang, Nam Seoul University, Korea
Keun Ho Ryu, Chungbuk National University, Korea
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.
Citation:
Mi Sug Gu, Jeong Hee Hwang, Keun Ho Ryu, "Frequent XML Query Pattern Mining based on FP-TRee," dexa, pp.555-559, 18th International Conference on Database and Expert Systems Applications (DEXA 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.