Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/40935
DC Field | Value | |
---|---|---|
dc.title | 2PXMiner - An efficient two pass mining of frequent XML query patterns | |
dc.contributor.author | Yang, L.H. | |
dc.contributor.author | Lee, M.L. | |
dc.contributor.author | Hsu, W. | |
dc.contributor.author | Guo, X. | |
dc.date.accessioned | 2013-07-04T08:15:47Z | |
dc.date.available | 2013-07-04T08:15:47Z | |
dc.date.issued | 2004 | |
dc.identifier.citation | 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. | |
dc.identifier.isbn | 1581138881 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/40935 | |
dc.description.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. | |
dc.source | Scopus | |
dc.subject | Tree Mining | |
dc.subject | XML Query Pattern | |
dc.type | Conference Paper | |
dc.contributor.department | COMPUTER SCIENCE | |
dc.description.sourcetitle | KDD-2004 - Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining | |
dc.description.page | 731-736 | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.