메뉴 건너뛰기




Volumn 12, Issue 3, 2000, Pages 353-371

Discovering structural association of semistructured data

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ASSOCIATIVE PROCESSING; DATA STRUCTURES; HTML; QUERY LANGUAGES; THEOREM PROVING; TREES (MATHEMATICS); WEB BROWSERS;

EID: 0033699332     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/69.846290     Document Type: Article
Times cited : (104)

References (15)
  • 1
    • 0002176154 scopus 로고    scopus 로고
    • Querying Semi-Structured Data
    • S. Abiteboul, "Querying Semi-Structured Data," Proc. Int'l Conf. Data Engineering, 1997. http://www-db.stanford.edu/pub/ papers/icdt97.semistructured.ps.
    • (1997) Proc. Int'l Conf. Data Engineering
    • Abiteboul, S.1
  • 2
    • 0027621699 scopus 로고
    • Mining Association Rules between Sets of Items in Large Databases
    • R. Agrawal, T. Imielinski, and A. Swami, "Mining Association Rules Between Sets of Items in Large Databases," Proc. SIGMOD, pp. 207-216, 1993.
    • (1993) Proc. SIGMOD , pp. 207-216
    • Agrawal, R.1    Imielinski, T.2    Swami, A.3
  • 3
    • 0002221136 scopus 로고
    • Fast Algorithms for Mining Association Rules
    • R. Agrawal and R. Srikant, "Fast Algorithms for Mining Association Rules," Very Large Data Bases, pp. 487-499, 1994.
    • (1994) Very Large Data Bases , pp. 487-499
    • Agrawal, R.1    Srikant, R.2
  • 4
    • 0030156981 scopus 로고    scopus 로고
    • A Query Language and Optimization Techniques for Unstructured Data
    • P. Buneman, S. Davidson, G. Hillebrand, and D. Suciu, "A Query Language and Optimization Techniques for Unstructured Data," Proc. SIGMOD, pp. 505-516, 1996.
    • (1996) Proc. SIGMOD , pp. 505-516
    • Buneman, P.1    Davidson, S.2    Hillebrand, G.3    Suciu, D.4
  • 5
    • 0001851329 scopus 로고
    • W3QS: A Query System for the World-Wide Web
    • D. Konopnicki and O. Shmueli, "W3QS: A Query System for the World-Wide Web," Very Large Data Bases, pp. 54-65, 1995.
    • (1995) Very Large Data Bases , pp. 54-65
    • Konopnicki, D.1    Shmueli, O.2
  • 11
    • 0000826845 scopus 로고
    • An Analysis of a Good Algorithm for the Subtree Problem
    • Dec.
    • S.W. Reyner, "An Analysis of a Good Algorithm for the Subtree Problem," SIAM J. Computing, vol. 6, no. 4, Dec. 1977.
    • (1977) SIAM J. Computing , vol.6 , Issue.4
    • Reyner, S.W.1
  • 12
    • 3042543056 scopus 로고    scopus 로고
    • Discovery of Schema Information from a Forest of Selectively Labeled Ordered Trees
    • May. See [15]
    • D.Y. Seo, D.H. Lee, K.M. Lee, and J.Y. Lee, "Discovery of Schema Information from a Forest of Selectively Labeled Ordered Trees," Proc. Workshop Management of Semistructured Data, pp. 54-59, May 1997. See [15].
    • (1997) Proc. Workshop Management of Semistructured Data , pp. 54-59
    • Seo, D.Y.1    Lee, D.H.2    Lee, K.M.3    Lee, J.Y.4


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