메뉴 건너뛰기




Volumn 36, Issue 3, 2007, Pages 15-22

Simple off the shelf abstractions for XML schema

Author keywords

[No Author keywords available]

Indexed keywords

CONTENT MODELS; STOCK ITEMS; SUBTREE-EXCHANGE PROPERTY; TREE AUTOMATA;

EID: 35748963231     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/1324185.1324188     Document Type: Conference Paper
Times cited : (29)

References (26)
  • 1
    • 84893833429 scopus 로고    scopus 로고
    • Inference of concise DTDs from XML data
    • G.J. Bex, F. Neven, T. Schwentick, and K. Tuyls. Inference of concise DTDs from XML data. In VLDB, pages 115-126, 2006.
    • (2006) VLDB , pp. 115-126
    • Bex, G.J.1    Neven, F.2    Schwentick, T.3    Tuyls, K.4
  • 2
    • 77954428731 scopus 로고    scopus 로고
    • DTDs versus XML Schema: A practical study
    • G.J. Bex, F. Neven, and J. Van den Bussche. DTDs versus XML Schema: A practical study. In WebDB, pages 79-84, 2004.
    • (2004) WebDB , pp. 79-84
    • Bex, G.J.1    Neven, F.2    Van den Bussche, J.3
  • 3
    • 84882718707 scopus 로고    scopus 로고
    • Inferring XML Schema, Definitions from XML data
    • G.J. Bex, F. Neven, and S. Vansummeren. Inferring XML Schema, Definitions from XML data. In VLDB, pages 998-1009, 2007.
    • (2007) VLDB , pp. 998-1009
    • Bex, G.J.1    Neven, F.2    Vansummeren, S.3
  • 4
    • 0027694328 scopus 로고
    • Regular expressions into finite automata
    • A. Brüggemann-Klein. Regular expressions into finite automata. Theoretical Computer Science, 120(2):197-213, 1993.
    • (1993) Theoretical Computer Science , vol.120 , Issue.2 , pp. 197-213
    • Brüggemann-Klein, A.1
  • 6
    • 4243581489 scopus 로고    scopus 로고
    • Regular tree and regular hedge languages over unranked alphabets: Version 1, april 3, 2001
    • Technical Report HKUSTTCSC-2001-0, The Hongkong University of Science and Technology
    • A. Brüggemann-Klein, M. Murata, and D. Wood. Regular tree and regular hedge languages over unranked alphabets: Version 1, april 3, 2001. Technical Report HKUSTTCSC-2001-0, The Hongkong University of Science and Technology, 2001.
    • (2001)
    • Brüggemann-Klein, A.1    Murata, M.2    Wood, D.3
  • 7
    • 0008595474 scopus 로고    scopus 로고
    • RELAX NG Specification
    • December
    • J. Clark and M. Murata. RELAX NG Specification. OASIS, December 2001.
    • (2001) OASIS
    • Clark, J.1    Murata, M.2
  • 8
    • 19944377531 scopus 로고    scopus 로고
    • Schemapath, a minimal extension to XML Schema for conditional constraints
    • C. Sacerdoti Coen, P. Marinelli, and F. Vitali. Schemapath, a minimal extension to XML Schema for conditional constraints. In WWW, pages 164-174, 2004.
    • (2004) , pp. 164-174
    • Sacerdoti Coen, C.1    Marinelli, P.2    Vitali, F.3
  • 9
    • 84858362659 scopus 로고    scopus 로고
    • R. Cover. The Cover pages, http://xml.coverpages.org/, 2005.
    • (2005) The Cover
    • Cover, R.1
  • 10
    • 84878717097 scopus 로고    scopus 로고
    • Optimizing schema languages for XML: Numerical constraints and interleaving
    • W. Gelade, W. Martens, and F. Neven. Optimizing schema languages for XML: Numerical constraints and interleaving. In ICDT, pages 269-283, 2007.
    • (2007) ICDT , pp. 269-283
    • Gelade, W.1    Martens, W.2    Neven, F.3
  • 11
    • 35748936329 scopus 로고    scopus 로고
    • Succinctness of pattern-based schema languages for XML
    • W. Gelade and F. Neven. Succinctness of pattern-based schema languages for XML. In DBPL, 2007.
    • (2007) DBPL
    • Gelade, W.1    Neven, F.2
  • 12
    • 38449111461 scopus 로고    scopus 로고
    • Efficient inclusion for a class of XML types with interleaving and counting
    • G. Ghelli, D. Colazzo, and C. Sartiani. Efficient inclusion for a class of XML types with interleaving and counting. In DBPL, 2007.
    • (2007) DBPL
    • Ghelli, G.1    Colazzo, D.2    Sartiani, C.3
  • 13
    • 35448937638 scopus 로고    scopus 로고
    • The complexity of reasoning about pattern-based XML schémas
    • G. Kasneci and T. Schwentick. The complexity of reasoning about pattern-based XML schémas. In PODS, pages 155-164, 2007.
    • (2007) PODS , pp. 155-164
    • Kasneci, G.1    Schwentick, T.2
  • 14
    • 20344392994 scopus 로고    scopus 로고
    • Regular expressions with numerical occurrence indicators - preliminary results
    • P. Kilpeläinen and R. Tuhkanen. Regular expressions with numerical occurrence indicators - preliminary results. In SPLST, pages 163-173, 2003.
    • (2003) SPLST , pp. 163-173
    • Kilpeläinen, P.1    Tuhkanen, R.2
  • 15
    • 20344388271 scopus 로고    scopus 로고
    • Towards efficient implementation of XML schema content models
    • P. Kilpeläinen and R. Tuhkanen. Towards efficient implementation of XML schema content models. In DOCENG, pages 239-241, 2004.
    • (2004) DOCENG , pp. 239-241
    • Kilpeläinen, P.1    Tuhkanen, R.2
  • 16
    • 84856016943 scopus 로고    scopus 로고
    • One-unambiguity of regular expressions with numeric occurrence indicators
    • P. Kilpeläinen and R. Tuhkanen. One-unambiguity of regular expressions with numeric occurrence indicators. Inf. Comput., 205(6):890-916, 2007.
    • (2007) Inf. Comput , vol.205 , Issue.6 , pp. 890-916
    • Kilpeläinen, P.1    Tuhkanen, R.2
  • 17
    • 35748929829 scopus 로고    scopus 로고
    • Keeping chess alive - Do we need 1-unambiguous content models?
    • Montreal, Canada
    • M. Mani. Keeping chess alive - Do we need 1-unambiguous content models? In Extreme Markup Languages, Montreal, Canada, 2001.
    • (2001) Extreme Markup Languages
    • Mani, M.1
  • 18
    • 35048829973 scopus 로고    scopus 로고
    • Complexity of decision problems for simple regular expressions
    • W. Martens, F. Neven, and T. Schwentick. Complexity of decision problems for simple regular expressions. In MFCS, pages 889-900, 2004.
    • (2004) MFCS , pp. 889-900
    • Martens, W.1    Neven, F.2    Schwentick, T.3
  • 21
    • 0038180542 scopus 로고    scopus 로고
    • Automata theory for XML researchers
    • F. Neven. Automata theory for XML researchers. SIGMOD Record, 31(3):39-46, 2002.
    • (2002) SIGMOD Record , vol.31 , Issue.3 , pp. 39-46
    • Neven, F.1
  • 22
    • 0036036851 scopus 로고    scopus 로고
    • Validating streaming XML documents
    • L. Segoufin and V. Vianu. Validating streaming XML documents. In PODS, pages 53-64, 2002.
    • (2002) PODS , pp. 53-64
    • Segoufin, L.1    Vianu, V.2
  • 23
    • 0025445530 scopus 로고
    • Deciding equivalence of finite tree automata
    • H. Seidl. Deciding equivalence of finite tree automata,. SIAM Journal on Computing, 19(3):424-437, 1990.
    • (1990) SIAM Journal on Computing , vol.19 , Issue.3 , pp. 424-437
    • Seidl, H.1
  • 25
    • 84858362988 scopus 로고    scopus 로고
    • Technical report, World Wide Web Consortium
    • CM. Sperberg-McQueen and H. Thompson. XML Schema. Technical report, World Wide Web Consortium, 2005. http://www.w3.org/XML/Schema.
    • (2005)
    • Sperberg-McQueen, C.M.1    Thompson, H.2    Schema, X.M.L.3


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