메뉴 건너뛰기




Volumn 31, Issue 3, 2006, Pages 770-813

Expressiveness and complexity of XML schema

Author keywords

Validation; XML; XML Schema

Indexed keywords

CONTEXTUAL PATTERNS; ELEMENT DECLARATIONS CONSISTENT (EDC); VALIDATION; XML SCHEMA;

EID: 33750148943     PISSN: 03625915     EISSN: 03625915     Source Type: Journal    
DOI: 10.1145/1166074.1166076     Document Type: Conference Paper
Times cited : (139)

References (47)
  • 6
    • 4243581489 scopus 로고    scopus 로고
    • Regular tree and regular hedge languages over unranked alphabets: Version 1
    • April 3, 2001 The Hongkong University of Science and Technology, Hong Kong
    • BRÜGGEMANN-KLEIN, A., MURATA, M., AND WOOD, D. 2001. Regular tree and regular hedge languages over unranked alphabets: Version 1, April 3, 2001. Tech. rep. HKUST-TCSC-2001-0. The Hongkong University of Science and Technology, Hong Kong.
    • (2001) Tech. Rep. , vol.HKUST-TCSC-2001-0
    • Brüggemann-Klein, A.1    Murata, M.2    Wood, D.3
  • 7
    • 0000447268 scopus 로고    scopus 로고
    • 1-unambiguous regular languages
    • BRÜGGEMANN-KLEIN, A. AND WOOD, D. 1998. 1-unambiguous regular languages. Inf. Comput. 142, 2, 182-206.
    • (1998) Inf. Comput. , vol.142 , Issue.2 , pp. 182-206
    • Brüggemann-Klein, A.1    Wood, D.2
  • 19
    • 1442286447 scopus 로고    scopus 로고
    • XDuce: A statically typed XML processing language
    • HOSOYA, H. AND PIERCE, B. C. 2003. XDuce: A statically typed XML processing language. ACM Trans. Internet Team. 3, 2, 117-148.
    • (2003) ACM Trans. Internet Team. , vol.3 , Issue.2 , pp. 117-148
    • Hosoya, H.1    Pierce, B.C.2
  • 20
    • 0035361928 scopus 로고    scopus 로고
    • Translating regular expressions into small ε-free nondeterministic finite automata
    • HROMKOVIC, J., SEIBERT, S., AND WILKE, T. 2001. Translating regular expressions into small ε-free nondeterministic finite automata. J. Comput. Syst. Sci, 62, 4, 565-588.
    • (2001) J. Comput. Syst. Sci , vol.62 , Issue.4 , pp. 565-588
    • Hromkovic, J.1    Seibert, S.2    Wilke, T.3
  • 21
    • 33750174090 scopus 로고    scopus 로고
    • The current state of the art of schema languages for XML
    • Sidney, Australia
    • JELLIFFE, R. 2001. The current state of the art of schema languages for XML. Presentation at XML Asia Pacific Conference, Sidney, Australia.
    • (2001) XML Asia Pacific Conference
    • Jelliffe, R.1
  • 22
    • 0342918866 scopus 로고    scopus 로고
    • JELLIFFE, R. 2005. Schematron. Go online to http://xml.ascc.net/ schematron/.
    • (2005) Schematron
    • Jelliffe, R.1
  • 25
    • 0000165321 scopus 로고    scopus 로고
    • Comparative analysis of six XML schema languages
    • LEE, D. AND CHU, W. 2000. Comparative analysis of six XML schema languages. ACM SIGMOD Rec. 29, 3, 76-87.
    • (2000) ACM SIGMOD Rec. , vol.29 , Issue.3 , pp. 76-87
    • Lee, D.1    Chu, W.2
  • 26
    • 35748929829 scopus 로고    scopus 로고
    • Keeping chess alive - Do we need 1-unambiguous content models?
    • MANI, M. 2001. Keeping chess alive - do we need 1-unambiguous content models? Presentation at Extreme Markup Languages Conference 2001.
    • (2001) Extreme Markup Languages Conference 2001
    • Mani, M.1
  • 28
    • 18144400980 scopus 로고    scopus 로고
    • On the complexity of typechecking top-down XML transformations
    • MARTENS, W. AND NEVEN, F. 2005. On the complexity of typechecking top-down XML transformations. Theor. Comput. Sci. 336, 1, 153-180.
    • (2005) Theor. Comput. Sci. , vol.336 , Issue.1 , pp. 153-180
    • Martens, W.1    Neven, F.2
  • 33
    • 33750169760 scopus 로고    scopus 로고
    • Taxonomy of XML schema languages using formal language theory
    • MURATA, M., LEE, D., MANI, M., AND KAWAOUCHI, K. 2005. Taxonomy of XML schema languages using formal language theory. ACM Trans. Internet Techn. 6, 4, 1-45.
    • (2005) ACM Trans. Internet Techn. , vol.6 , Issue.4 , pp. 1-45
    • Murata, M.1    Lee, D.2    Mani, M.3    Kawaouchi, K.4
  • 35
    • 0038180542 scopus 로고    scopus 로고
    • Automata theory for XML researchers
    • NEVEN, F. 2002b. Automata theory for XML researchers. SIGMOD Rec. 31, 3, 39-46.
    • (2002) SIGMOD Rec. , vol.31 , Issue.3 , pp. 39-46
    • Neven, F.1
  • 39
    • 0025445530 scopus 로고
    • Deciding equivalence of finite tree automata
    • SEIDL, H. 1990. Deciding equivalence of finite tree automata. SIAM J. Comput. 19, 3, 424-437.
    • (1990) SIAM J. Comput. , vol.19 , Issue.3 , pp. 424-437
    • Seidl, H.1


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