Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/40935
Title: 2PXMiner - An efficient two pass mining of frequent XML query patterns
Authors: Yang, L.H.
Lee, M.L. 
Hsu, W. 
Guo, X.
Keywords: Tree Mining
XML Query Pattern
Issue Date: 2004
Source: Yang, L.H.,Lee, M.L.,Hsu, W.,Guo, X. (2004). 2PXMiner - An efficient two pass mining of frequent XML query patterns. KDD-2004 - Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining : 731-736. ScholarBank@NUS Repository.
Abstract: Caching the results of frequent query patterns can improve the performance of query evaluation. This paper describes a 2-pass mining algorithm called 2PXMiner to discover frequent XML query patterns. We design 3 data structures to expedite the mining process. Experiments results indicate that ZPXMiner is both efficient and scalable.
Source Title: KDD-2004 - Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
URI: http://scholarbank.nus.edu.sg/handle/10635/40935
ISBN: 1581138881
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

126
checked on Dec 9, 2017

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.