메뉴 건너뛰기




Volumn 1777, Issue , 2000, Pages 302-316

Approximate graph schema extraction for semi-structured data

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; EXTRACTION; QUERY PROCESSING;

EID: 84937413223     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46439-5_21     Document Type: Conference Paper
Times cited : (29)

References (20)
  • 8
    • 3342974034 scopus 로고
    • Knowledge acquisition via incremental conceptual clustering
    • J. Shavlik and T. Dietterich, editors, Morgan Kaufmann Publishers
    • D. Fisher. Knowledge acquisition via incremental conceptual clustering. In J. Shavlik and T. Dietterich, editors, Readings in Machine Learning. Morgan Kaufmann Publishers, 1990.
    • (1990) Readings in Machine Learning
    • Fisher, D.1
  • 12
    • 0027608375 scopus 로고
    • Query evaluation techniques for large databases
    • G. Graefe. Query evaluation techniques for large databases. ACM Computing Surveys, 25(2):73-170, 1993.
    • (1993) ACM Computing Surveys , vol.25 , Issue.2 , pp. 73-170
    • Graefe, G.1
  • 16
    • 84867524779 scopus 로고
    • Finding regular simple paths in graph databases
    • A. Mendelzon and P. Wood. Finding regular simple paths in graph databases. SIAM Journal of Computing, 24(6):1235-1258, 1995.
    • (1995) SIAM Journal of Computing , vol.24 , Issue.6 , pp. 1235-1258
    • Mendelzon, A.1    Wood, P.2


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