Cart (Loading....) | Create Account
Close category search window
 

Frequent XML Query Pattern Mining based on FP-TRee

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Mi Sug Gu ; Chungbuk Nat. Univ., Cheongju ; Jeong Hee Hwang ; Keun Ho Ryu

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.

Published in:

Database and Expert Systems Applications, 2007. DEXA '07. 18th International Workshop on

Date of Conference:

3-7 Sept. 2007

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.