메뉴 건너뛰기




Volumn 17, Issue 7, 2005, Pages 997-1009

Indexing useful structural patterns for XML query processing

Author keywords

Document indexing; Mining methods and algorithms; Query processing; XML XSL RDF

Indexed keywords

ALGORITHMS; DATA MINING; DATA PROCESSING; INFORMATION RETRIEVAL SYSTEMS; PATTERN RECOGNITION; QUERY LANGUAGES; XML;

EID: 22944487013     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2005.110     Document Type: Article
Times cited : (12)

References (31)
  • 6
    • 1142303692 scopus 로고    scopus 로고
    • D(k)-index: An adaptive structural summary for graph-structured data
    • Q. Chen, A. Lim, and K.W. Ong, "D(k)-Index: An Adaptive Structural Summary for Graph-Structured Data," Proc. ACM SIGMOD Conf., 2003.
    • (2003) Proc. ACM SIGMOD Conf.
    • Chen, Q.1    Lim, A.2    Ong, K.W.3
  • 7
    • 0029733589 scopus 로고    scopus 로고
    • Maintenance of discovered association rules in large databases: An incremental updating techniques
    • D.W. Cheung, J. Han, V. Ng, and C.Y. Wong, "Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Techniques," Proc. Int'l Conf. Data Eng., 1996.
    • (1996) Proc. Int'l Conf. Data Eng.
    • Cheung, D.W.1    Han, J.2    Ng, V.3    Wong, C.Y.4
  • 11
    • 0021615874 scopus 로고
    • R-trees: A dynamic index structure for spatial searching
    • A. Guttman, "R-Trees: A Dynamic Index Structure for Spatial Searching," Proc. ACM SIGMOD Conf., 1984.
    • (1984) Proc. ACM SIGMOD Conf.
    • Guttman, A.1
  • 18
    • 0344496711 scopus 로고    scopus 로고
    • Similarity search in sets and categorical data using the signature tree
    • N. Mamoulis, D.W. Cheung, and W. Lian, "Similarity Search in Sets and Categorical Data Using the Signature Tree," Proc. Int'l Conf. Data Eng., 2003.
    • (2003) Proc. Int'l Conf. Data Eng.
    • Mamoulis, N.1    Cheung, D.W.2    Lian, W.3
  • 19
    • 0346789280 scopus 로고    scopus 로고
    • Lore: A database management system for semistructured data
    • J. McHugh, S. Abiteboul, R. Goldman, D. Quass, and J. Widom, "Lore: A Database Management System for Semistructured Data," SIGMOD Record, vol. 26, no. 3, pp. 54-66, 1997.
    • (1997) SIGMOD Record , vol.26 , Issue.3 , pp. 54-66
    • McHugh, J.1    Abiteboul, S.2    Goldman, R.3    Quass, D.4    Widom, J.5
  • 22
    • 0001122858 scopus 로고
    • The tree-to-tree editing problem
    • S.M. Selkow, "The Tree-to-Tree Editing Problem," Information Processing Letters, vol. 6, no. 6, pp. 184-186, 1977.
    • (1977) Information Processing Letters , vol.6 , Issue.6 , pp. 184-186
    • Selkow, S.M.1
  • 25
    • 0033699332 scopus 로고    scopus 로고
    • Discovering structural association of semistructured data
    • May/June
    • K. Wang and H. Liu, "Discovering Structural Association of Semistructured Data," IEEE Trans. Knowledge and Data Eng., vol. 12, no. 3, pp. 353-371, May/June 2000.
    • (2000) IEEE Trans. Knowledge and Data Eng. , vol.12 , Issue.3 , pp. 353-371
    • Wang, K.1    Liu, H.2
  • 28
    • 0242709382 scopus 로고    scopus 로고
    • Efficiently mining frequent trees in a forest
    • M.J. Zaki, "Efficiently Mining Frequent Trees in a Forest," Proc. SIGKDD Conf., 2002.
    • (2002) Proc. SIGKDD Conf.
    • Zaki, M.J.1
  • 30
    • 0742329404 scopus 로고    scopus 로고
    • Feb.
    • DBLP XML Records, http://www.acm.org/sigmod/dblp/db/index.html, Feb. 2001.
    • (2001) DBLP XML Records
  • 31
    • 22944482767 scopus 로고    scopus 로고
    • International Press Telecommunications Council, News Industry Text Format (NITF), http://www.nift.org, 2000.
    • (2000)


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