Document Server@UHasselt >
Research >
Research publications >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/11613

Title: Simplifying XML Schema: Single-Type Approximations of Regular Tree Languages
Authors: GELADE, Wouter
Idziaszek, Tomasz
Martens, Wim
NEVEN, Frank
Issue Date: 2010
Publisher: ACM
Citation: Proceedings of the 29th ACM Conference on Principles of Database Systems (PODS). p. 251-260.
Abstract: XML Schema Definitions (XSDs) can be adequately abstracted by the single-type regular three languages. It is well-known, tha these form a strict subclass of the robust class of regular unranked three 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 three languages. We consider both optimal lower and upper approximations. We also adress the more general question of how to approximate an arbitrary regular tree language by an XSD and consider the complexity of associated decision problems.
URI: http://hdl.handle.net/1942/11613
DOI: 10.1145/1807085.1807118
ISBN: 978-1-4503-0033-9
Category: C1
Type: Proceedings Paper
Appears in Collections: Research publications

Files in This Item:

Description SizeFormat
Published version457.72 kBAdobe PDF

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.