• Cite Icon14
  • https://doi.org/10.1145/1807085.1807118Copy DOI Icon

Simplifying XML schema

  • Jun 6, 2010
  • Wouter Gelade +3 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
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.

Similar Papers
  • Research Article
  • Citations4

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

  • Jan 21, 2013
  • Journal of Computer and System Sciences
  • Wouter Gelade +4
  • Research Article
  • Citations2

Generating, Sampling and Counting Subclasses of Regular Tree Languages

  • Oct 26, 2012
  • Theory of Computing Systems
  • Timos Antonopoulos +3
  • Conference Article
  • Citations6

Generating, sampling and counting subclasses of regular tree languages

  • Mar 21, 2011
  • Timos Antonopoulos +3
  • Book Chapter

Analysis of Logic Programs Using Regular Tree Languages

  • Jan 01, 2012
  • John P Gallagher
  • Research Article
  • Citations18

Regular Tree Languages as an Abstract Domain in Program Specialisation

  • Sep 01, 2001
  • Higher-Order and Symbolic Computation
  • John P Gallagher +1
  • Research Article
  • Citations11

On regular tree languages and deterministic pushdown automata

  • Sep 01, 2009
  • Acta Informatica
  • Jan Janoušek +1
  • Research Article
  • Citations9

Unambiguity and uniformization problems on infinite trees

  • Jan 01, 2013
  • DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
  • Marcin Bilkowski +1
  • Research Article
  • Citations25

Closure properties of linear context-free tree languages with an application to optimality theory

  • Dec 15, 2005
  • Theoretical Computer Science
  • Stephan Kepser +1
  • Research Article
  • Citations2

PROPERTIES OF QUASI-RELABELING TREE BIMORPHISMS

  • Jun 01, 2010
  • International Journal of Foundations of Computer Science
  • Andreas Maletti +1
  • Research Article

Alignment distance of regular tree languages

  • Jul 03, 2019
  • Theoretical Computer Science
  • Yo-Sub Han +1
  • Research Article
  • Citations2

Learning tree languages from text

  • Sep 25, 2007
  • RAIRO - Theoretical Informatics and Applications
  • Henning Fernau
  • Book Chapter
  • Citations26

Learning Tree Languages from Text

  • Jan 01, 2002
  • Henning Fernau
  • Research Article
  • Citations19

Learning tree languages from positive examples and membership queries

  • Mar 30, 2007
  • Theoretical Computer Science
  • Jérôme Besombes +1
  • Research Article
  • Citations1

Top-down tree edit-distance of regular tree languages

  • Jul 11, 2018
  • International Journal of Advances in Engineering Sciences and Applied Mathematics
  • Sang-Ki Ko +2
  • Book Chapter
  • Citations21

Polynomial time inductive inference of regular term tree languages from positive data

  • Jan 01, 1997
  • Satoshi Matsumoto +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.