Simplifying XML schema: Single-type approximations of regular tree languages

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2010, Pages 251-260

  Gelade, Wouter ^a   Idziaszek, Tomasz ^b   Martens, Wim ^c   Neven, Frank ^a  

^a HASSELT UNIVERSITY   (Belgium)

^b UNIVERSITY OF WARSAW   (Poland)

^c TU DORTMUND UNIVERSITY   (Germany)

Author keywords

approximation; complexity; xml; xml schema

Indexed keywords

APPROXIMATION; APPROXIMATION COMPLEXITY; BASIC OPERATION; DECISION PROBLEMS; LOWER AND UPPER APPROXIMATIONS; REGULAR TREE LANGUAGES; SCHEMA INTEGRATION; UNRANKED TREES; XML SCHEMA DEFINITIONS; XML SCHEMAS;

LINGUISTICS; MARKUP LANGUAGES; XML;

QUERY LANGUAGES;

EID: 77954751911     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1807085.1807118     Document Type: Conference Paper

References (20)

1. J. Albert, D. Giammerresi, and D. Wood. Normal form algorithms for extended context free grammars. Theoretical Computer Science, 267(1-2):35-47, 2001.
2. 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.
3. P. A. Bernstein. Applying model management to classical meta data problems. In Conference on Innovative Data Systems Research (CIDR), 2003.
4. G. J. Bex, W. Gelade, W. Martens, and F. Neven. Simplifying XML Schema: effortless handling of nondeterministic regular expressions. In SIGMOD, pages 731-744, 2009.
5. 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.
6. 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.
7. 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 HKUST-TCSC-2001-0, The Hongkong University of Science and Technology, 2001.
8. K. Ciesielski. Set Theory for the Working Mathematician. Cambridge University Press, 1997.
9. J. Clark and M. Murata. Relax NG specification. http://www.relaxng.org/ spec-20011203.html, December 2001.
10. 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.
11. 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.
12. J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
13. W. Martens, F. Neven, and T. Schwentick. Simple off the shelf abstractions for XML Schema. Sigmod RECORD, 36(3):15-22, 2007.
14. 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.
15. 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.
16. 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.
17. 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.
18. 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.
19. 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.
20. H. Seidl. Deciding equivalence of finite tree automata. Siam Journal on Computing, 19(3):424-437, 1990.