[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/1014052.1014148acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
Article

2PXMiner: an efficient two pass mining of frequent XML query patterns

Published: 22 August 2004 Publication History

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 2PXMiner is both efficient and scalable.

References

[1]
T. Asai, K. Abe, S. Kawasoe, H. Arimura, H. Sakamoto, S. Arikawa. Efficient substructure discovery from large semistructured data. 2nd SIAM International Conference on Data Mining, 2002.
[2]
R. Agrawal and R. Srikant. Fast algorithms for mining association rules. VLDB, pp:487--499, 1994.
[3]
L. Chen, E. A. Rundensteiner, S. Wang. XCache-A Semantic Caching System for XML Queries. ACM SIGMOD, pp:618, 2002.
[4]
G. Miklau, D. Suciu. Containment and Equivalence of Tree Pattern Queries. ACM PODS, pp:65--76, 2002.
[5]
L.H. Yang, M.L. Lee, W. Hsu. Efficient Mining of XML Query Patterns for Caching. VLDB, pp:69--80, 2003.
[6]
L.H. Yang, M.L. Lee, W. Hsu, S. Acharya. Mining Frequent Query Patterns from XML Queries. DASFAA, pp:355--362, 2003.
[7]
M. Zaki. Efficiently Mining Frequent Trees in a Forest. ACM SIGKDD, pp:71--80, 2002.

Cited By

View all

Index Terms

  1. 2PXMiner: an efficient two pass mining of frequent XML query patterns

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    KDD '04: Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
    August 2004
    874 pages
    ISBN:1581138881
    DOI:10.1145/1014052
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 22 August 2004

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. XML query pattern
    2. tree mining

    Qualifiers

    • Article

    Conference

    KDD04

    Acceptance Rates

    Overall Acceptance Rate 1,133 of 8,635 submissions, 13%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)1
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 11 Dec 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2016)A Parallel Encoding Method of XML User Query Patterns2016 5th IIAI International Congress on Advanced Applied Informatics (IIAI-AAI)10.1109/IIAI-AAI.2016.234(1190-1191)Online publication date: Jul-2016
    • (2013)Frequent Pattern Discovery and Association Rule Mining of XML DataData Mining10.4018/978-1-4666-2455-9.ch044(859-879)Online publication date: 2013
    • (2012)Frequent Pattern Discovery and Association Rule Mining of XML DataXML Data Mining10.4018/978-1-61350-356-0.ch011(243-263)Online publication date: 2012
    • (2012)Fast support vector machines for convolution tree kernelsData Mining and Knowledge Discovery10.1007/s10618-012-0276-825:2(325-357)Online publication date: 1-Sep-2012
    • (2010)A Novel Top-Down Algorithm of Frequent XML Query Pattern MiningProceedings of the 2010 Second International Conference on Computer Engineering and Applications - Volume 0210.1109/ICCEA.2010.205(276-280)Online publication date: 19-Mar-2010
    • (2009)Incremental sequence-based frequent query pattern mining from XML queriesData Mining and Knowledge Discovery10.1007/s10618-009-0126-518:3(472-516)Online publication date: 1-Jun-2009
    • (2009)On the Discovery of Conserved XML Query Patterns for Evolution-Conscious CachingProceedings of the 14th International Conference on Database Systems for Advanced Applications10.1007/978-3-642-00887-0_46(527-542)Online publication date: 16-Mar-2009
    • (2006)Data conceptualisation for web-based data-centred application designProceedings of the 18th international conference on Advanced Information Systems Engineering10.1007/11767138_15(205-219)Online publication date: 5-Jun-2006
    • (2005)Mining conserved XML query paths for dynamic-conscious cachingProceedings of the 14th ACM international conference on Information and knowledge management10.1145/1099554.1099596(219-220)Online publication date: 31-Oct-2005

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media