Weigted-FP-tree based XML query pattern mining

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

According as XML data have been prevailing in many areas such as internet and public documentation, we need to research data mining algorithm to XML data. And many kinds of techniques have been researched to speed up the query performance about XML data. In this paper, therefore, as the method for speeding up the query performance we analyze the XML query pattern and propose Weighted- FP-growth algorithm extracting the similar XML query pattern fast. The proposed method is applied to XML query subtrees. And we experimented our method compared with the existing algorithm. And we showed the proposed method outperform the other methods and give the fast query result to the repeatedly occurring queries. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Gu, M. S., Hwang, J. H., & Ho Ryu, K. (2010). Weigted-FP-tree based XML query pattern mining. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6440 LNAI, pp. 417–428). https://doi.org/10.1007/978-3-642-17316-5_40

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free