메뉴 건너뛰기




Volumn 3261, Issue , 2004, Pages 96-106

Finding maximal similar paths between XML documents using sequential patterns

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; INFORMATION SERVICES; INFORMATION SYSTEMS; MANAGEMENT INFORMATION SYSTEMS; WORD PROCESSING;

EID: 34250881613     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30198-1_11     Document Type: Article
Times cited : (2)

References (10)
  • 2
    • 0032094142 scopus 로고    scopus 로고
    • Extracting Schema from Semistructured Data
    • Nestorov, Abiteboul, Motwani.: Extracting Schema from Semistructured Data. In Proc. of SIGMOD, pages 295-306. 1998.
    • (1998) Proc. of SIGMOD , pp. 295-306
    • Nestorov1    Abiteboul2    Motwani3
  • 4
    • 0010477872 scopus 로고    scopus 로고
    • Storing Semistructured Data with STORED
    • Deutsch, Fernandez and Suciu.: "Storing Semistructured Data with STORED. In Proc. of SIGMOD, pages 431-442. 1999.
    • (1999) Proc. of SIGMOD , pp. 431-442
    • Deutsch1    Fernandez2    Suciu3
  • 5
    • 0019899359 scopus 로고
    • Pattern Matching in Trees
    • Jan.
    • C. M. Hoffmann and M. J. O'Donnell.: Pattern Matching in Trees. Journal of ACM 29(1), pages 68-95. Jan. 1982.
    • (1982) Journal of ACM , vol.29 , Issue.1
    • Hoffmann, C.M.1    O'Donnell, M.J.2
  • 7
    • 0032283420 scopus 로고    scopus 로고
    • Discovering Typical Structures of Documents: A Road Map Approach
    • K. Wang and H. Liu.: Discovering Typical Structures of Documents: a Road Map Approach. In Proc. of SIGIR, pages 146-154. 1998.
    • (1998) Proc. of SIGIR , pp. 146-154
    • Wang, K.1    Liu, H.2


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