ABSTRACT
XML Schema Definitions (XSDs) can be adequately abstracted by the single-type regular tree languages. It is well-known, that these form a strict subclass of the robust class of regular unranked tree languages. Sadly, in this respect, XSDs are not closed under the basic operations of union and set difference, complicating important tasks in schema integration and evolution. The purpose of this paper is to investigate how the union and difference of two XSDs can be approximated within the framework of single-type regular tree languages. We consider both optimal lower and upper approximations. We also address the more general question of how to approximate an arbitrary regular tree language by an XSD and consider the complexity of associated decision problems.
- J. Albert, D. Giammerresi, and D. Wood. Normal form algorithms for extended context free grammars. Theoretical Computer Science, 267(1-2):35--47, 2001. Google Scholar
Digital Library
- D. Barbosa, L. Mignet, and P. Veltri. Studying the XML Web: Gathering statistics from an XML sample. World Wide Web, 8(4):413--438, 2005. Google Scholar
Digital Library
- P. A. Bernstein. Applying model management to classical meta data problems. In Conference on Innovative Data Systems Research (CIDR), 2003.Google Scholar
- G. J. Bex, W. Gelade, W. Martens, and F. Neven. Simplifying XML Schema: e ffortless handling of nondeterministic regular expressions. In SIGMOD, pages 731--744, 2009. Google Scholar
Digital Library
- G. J. Bex, F. Neven, and S. Vansummeren. Inferring XML Schema Definitions from XML data. In International Conference on Very Large Data Bases (VLDB), pages 998--1009, 2007. Google Scholar
Digital Library
- Mikolaj Bojanczyk. Forest expressions. In Jacques Duparc and Thomas A. Henzinger, editors, CSL, volume 4646 of Lecture Notes in Computer Science, pages 146--160. Springer, 2007. Google Scholar
Digital Library
- A. Bruggemann-Klein, M. Murata, and D. Wood. Regular tree and regular hedge languages over unranked alphabets: Version 1, april 3, 2001. Technical Report HKUST-TCSC-2001-0, The Hong kong University of Science and Technology, 2001.Google Scholar
- K. Ciesielski. Set Theory for the Working Mathematician. Cambridge University Press, 1997.Google Scholar
Cross Ref
- J. Clark and M. Murata. Relax NG specification. http://www.relaxng.org/spec-20011203.html, December 2001.Google Scholar
- S. Gao, C. M. Sperberg-McQueen, H.S. Thompson, N. Mendelsohn, D. Beech, and M. Maloney. W3C XML Schema Definition Language (XSD) 1.1 Part 1: Structures. W3C, April 2009.Google Scholar
- W. Gelade and F. Neven. Succinctness of the complement and intersection of regular expressions. In Annual Symposium on Theoretical Aspects of Computer Science (STACS), pages 325--336, 2008.Google Scholar
- J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979. Google Scholar
Digital Library
- W. Martens, F. Neven, and T. Schwentick. Simple off the shelf abstractions for XML Schema. Sigmod RECORD, 36(3):15--22, 2007. Google Scholar
Digital Library
- W. Martens, F. Neven, and T. Schwentick. Complexity of decision problems for XML schemas and chain regular expressions. Siam Journal on Computing, 39(4):1486--1530, 2009. Google Scholar
Digital Library
- W. Martens, F. Neven, T. Schwentick, and G.J. Bex. Expressiveness and complexity of XML Schema. ACM Transactions on Database Systems, 31(3):770--813, 2006. Google Scholar
Digital Library
- W. Martens and J. Niehren. On the minimization of xml schemas and tree automata for unranked trees. Journal of Computer and System Sciences, 73(4):550--583, 2007. Google Scholar
Digital Library
- M. Murata, D. Lee, M. Mani, and K. Kawaguchi. Taxonomy of XML schema languages using formal language theory. ACM Transactions on Internet Technology, 5(4):660--704, 2005. Google Scholar
Digital Library
- Y. Papakonstantinou and V. Vianu. DTD inference for views of XML data. In International Symposium on Principles of Database Systems (PODS), pages 35--46, 2000. Google Scholar
Digital Library
- A. Sahuguet. Everything you ever wanted to know about DTDs, but were afraid to ask. In International Workshop on the Web and Databases (WebDB), pages 69--74, 2000. Google Scholar
Digital Library
- H. Seidl. Deciding equivalence of finite tree automata. Siam Journal on Computing, 19(3):424--437, 1990. Google Scholar
Digital Library
Index Terms
Simplifying XML schema: single-type approximations of regular tree languages
Recommendations
Simplifying XML Schema: Single-type approximations of regular tree languages
XML Schema Definitions (XSDs) can be adequately abstracted by the single-type regular tree languages. It is well known that these form a strict subclass of the robust class of regular unranked tree languages. Sadly, in this respect, XSDs are not closed ...
XML-based XML schema access
WWW '07: Proceedings of the 16th international conference on World Wide WebXML Schema's abstract data model consists of components, which are the structures that eventually define a schema as a whole. XML Schema's XML syntax, on the other hand, is not a direct representation of the schema components, and it proves to be ...
Constraint Preserving Transformation from Relational Schema to XML Schema
XML has become the standard for publishing and exchanging data on the Web. However, most business data is managed and will remain to be managed by relational database management systems. As such, there is an increasing need to efficiently and accurately ...






Comments