메뉴 건너뛰기




Volumn 22, Issue 5, 2007, Pages 725-735

Efficient mining of frequent closed XML query pattern

Author keywords

Computer software; Data mining; Frequent closed pattern; XML; XPath

Indexed keywords

FREQUENT CLOSED PATTERNS; QUERY PATTERNS; QUERY PERFORMANCE ENHANCEMENT;

EID: 34548747032     PISSN: 10009000     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11390-007-9081-z     Document Type: Article
Times cited : (4)

References (28)
  • 1
    • 1142303692 scopus 로고    scopus 로고
    • D(k)-index: An adaptive structural summary for graph-structured data
    • San Diego, CA, USA, Jun. 9-12
    • Chen Q, Lim A et al. D(k)-index: An adaptive structural summary for graph-structured data. In Proc. the ACM SIGMOD Int. Conf. Management of Data, San Diego, CA, USA, Jun. 9-12, 2003, pp.134-144.
    • (2003) Proc. the ACM SIGMOD Int. Conf. Management of Data , pp. 134-144
    • Chen, Q.1    Lim, A.2
  • 2
    • 0036211171 scopus 로고    scopus 로고
    • Exploiting local similarity for efficient indexing of paths in graph structured data
    • San Jose, CA, USA, Feb. 26-Mar. 1
    • Kaushik R, Shenoy P et al. Exploiting local similarity for efficient indexing of paths in graph structured data. In Proc. the 18th Int. Conf. Data Engineering, San Jose, CA, USA, Feb. 26-Mar. 1, 2002, pp.129-140.
    • (2002) Proc. the 18th Int. Conf. Data Engineering , pp. 129-140
    • Kaushik, R.1    Shenoy, P.2
  • 3
    • 80052793558 scopus 로고    scopus 로고
    • Index structures for path expressions
    • Jerusalem, Israel, Jan. 10-12
    • Milo T, Suciu D. Index structures for path expressions. In Proc. the 7th Int. Conf. Database Theory, Jerusalem, Israel, Jan. 10-12, 1999, pp.277-295.
    • (1999) Proc. the 7th Int. Conf. Database Theory , pp. 277-295
    • Milo, T.1    Suciu, D.2
  • 4
    • 85012146515 scopus 로고    scopus 로고
    • Efficient mining of XML query patterns for caching
    • Berlin, Germany, Sept. 9-12
    • Yang L H, Lee M L et al. Efficient mining of XML query patterns for caching. In Proc. the 29th Int. Conf. Very Large Data Bases, Berlin, Germany, Sept. 9-12, 2003, pp.69-80.
    • (2003) Proc. the 29th Int. Conf. Very Large Data Bases , pp. 69-80
    • Yang, L.H.1    Lee, M.L.2
  • 5
    • 4444326044 scopus 로고    scopus 로고
    • Mining closed sequential patterns in large databases
    • San Francisco, CA, USA, May 1-3, Electronic Edition
    • Yan X, Han J et al. Mining closed sequential patterns in large databases. In Proc. the 3rd SIAM Int. Conf. Data Mining, San Francisco, CA, USA, May 1-3, 2003, Electronic Edition.
    • (2003) Proc. the 3rd SIAM Int. Conf. Data Mining
    • Yan, X.1    Han, J.2
  • 7
    • 0002740930 scopus 로고    scopus 로고
    • Mining temporal relationals with multiple granularities in time sequences
    • Bettini C, Wang X et al. Mining temporal relationals with multiple granularities in time sequences. IEEE Data Engineering Bulletin, 1998, 21(1): 32-38.
    • (1998) IEEE Data Engineering Bulletin , vol.21 , Issue.1 , pp. 32-38
    • Bettini, C.1    Wang, X.2
  • 8
    • 0035016443 scopus 로고    scopus 로고
    • PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth
    • Heidelberg, Germany, April 2-6
    • Pei J, Han J et al. PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth. In Proc. the 18th Int. Conf. Data Engineering, Heidelberg, Germany, April 2-6, 2001, pp.215-224.
    • (2001) Proc. the 18th Int. Conf. Data Engineering , pp. 215-224
    • Pei, J.1    Han, J.2
  • 9
    • 33751066441 scopus 로고    scopus 로고
    • Exploit sequencing to accelerate hot XML query pattern mining
    • Dijon, France, Apr. 23-27
    • Feng J, Qian Q et al. Exploit sequencing to accelerate hot XML query pattern mining. In Proc. the 2006 ACM Symp. Applied Computing, Dijon, France, Apr. 23-27, 2006, pp.517-524.
    • (2006) Proc. the 2006 ACM Symp. Applied Computing , pp. 517-524
    • Feng, J.1    Qian, Q.2
  • 11
    • 2442446148 scopus 로고    scopus 로고
    • Wang J, Han J. BIDE: Efficient mining of frequent closed sequences. In Proc. the 20th Int. Conf. Data Engineering, Boston, MA, USA, Mar. 30-Apr. 2, 2004, pp.79-90.
    • Wang J, Han J. BIDE: Efficient mining of frequent closed sequences. In Proc. the 20th Int. Conf. Data Engineering, Boston, MA, USA, Mar. 30-Apr. 2, 2004, pp.79-90.
  • 13
    • 0001882616 scopus 로고
    • Fast algorithms for mining association rules
    • Santiago de Chile, Chile, Sept. 12-15
    • Agrawal R, Srikant R. Fast algorithms for mining association rules. In Proc. the 20th Int. Conf. Very Large Data Bases, Santiago de Chile, Chile, Sept. 12-15, 1994, pp.487-499.
    • (1994) Proc. the 20th Int. Conf. Very Large Data Bases , pp. 487-499
    • Agrawal, R.1    Srikant, R.2
  • 15
    • 4544334171 scopus 로고    scopus 로고
    • Efficient substructure discovery from large semi-structured data
    • Arlington, VA, USA, Apr. 11-13, Electronic Edition
    • Asai T, Abe K et al. Efficient substructure discovery from large semi-structured data. In Proc. the 2nd SIAM Int. Conf. Data Mining, Arlington, VA, USA, Apr. 11-13, 2002, Electronic Edition.
    • (2002) Proc. the 2nd SIAM Int. Conf. Data Mining
    • Asai, T.1    Abe, K.2
  • 16
    • 3042780922 scopus 로고    scopus 로고
    • TreeFinder: A first step towards XML data mining
    • Maebashi, Japan, Dec. 9-12
    • Termier A, Rousset M C et al. TreeFinder: A first step towards XML data mining. In Proc. the 2nd IEEE Int. Conf. Data Mining, Maebashi, Japan, Dec. 9-12, 2002, pp.450-457.
    • (2002) Proc. the 2nd IEEE Int. Conf. Data Mining , pp. 450-457
    • Termier, A.1    Rousset, M.C.2
  • 19
    • 0029212693 scopus 로고    scopus 로고
    • Mining sequential patterns: Generalizations and performance improvements
    • Avignon, France, Mar. 25-29
    • Srikant R, Agrawal R. Mining sequential patterns: Generalizations and performance improvements. In Proc. the 5th Int. Conf. Extending Database Technology, Avignon, France, Mar. 25-29, 1996, pp.3-17.
    • (1996) Proc. the 5th Int. Conf. Extending Database Technology , pp. 3-17
    • Srikant, R.1    Agrawal, R.2
  • 22
    • 0036373130 scopus 로고    scopus 로고
    • Mining long sequential patterns in a noisy environment
    • Madison, WI, USA, Jun. 3-6
    • Yang J, Yu P S et al. Mining long sequential patterns in a noisy environment. In Proc. 2003 ACM SIGMOD Int. Conf. Management of Data, Madison, WI, USA, Jun. 3-6, 2002, pp.406-417.
    • (2002) Proc. 2003 ACM SIGMOD Int. Conf. Management of Data , pp. 406-417
    • Yang, J.1    Yu, P.S.2
  • 23
    • 14644411753 scopus 로고    scopus 로고
    • Mining closed and maximal frequent subtrees from databases of labeled rooted trees
    • Chi Y, Xia Y et al. Mining closed and maximal frequent subtrees from databases of labeled rooted trees. IEEE Trans. Knowledge and Data Engineering, 2005, 17(2): 190-202.
    • (2005) IEEE Trans. Knowledge and Data Engineering , vol.17 , Issue.2 , pp. 190-202
    • Chi, Y.1    Xia, Y.2
  • 25
    • 0141783373 scopus 로고    scopus 로고
    • XQuery 1.0: An XML query language
    • Recommendation, June
    • Boag S, Chamberlin D et al. XQuery 1.0: An XML query language. W3C Candidate Recommendation, June, 2006, http://www.w3.org/TR/xquery.
    • (2006) Candidate , vol.W3C
    • Boag, S.1    Chamberlin, D.2
  • 26
    • 2442531722 scopus 로고    scopus 로고
    • Raw P R, Moon B. PRIX: Indexing and querying XML using Prufer sequences. In Proc. the 20th Int. Conf. Data Engineering, Boston, MA, USA, Mar. 30-Apr. 2, 2004, pp.288-300.
    • Raw P R, Moon B. PRIX: Indexing and querying XML using Prufer sequences. In Proc. the 20th Int. Conf. Data Engineering, Boston, MA, USA, Mar. 30-Apr. 2, 2004, pp.288-300.
  • 27
    • 0005261636 scopus 로고    scopus 로고
    • Dissertation, University of California, San Diego, USA
    • Picciotto S. How to encode a tree [Dissertation]. University of California, San Diego, USA, 1999.
    • (1999) How to encode a tree
    • Picciotto, S.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.