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 | Source: | 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. | Keywords: | XML; XML schema; approximation; complexity | Document URI: | http://hdl.handle.net/1942/11613 | ISBN: | 978-1-4503-0033-9 | DOI: | 10.1145/1807085.1807118 | Category: | C1 | Type: | Proceedings Paper |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
p251-gelade.pdf | Published version | 457.72 kB | Adobe PDF | View/Open |
SCOPUSTM
Citations
11
checked on Sep 2, 2020
WEB OF SCIENCETM
Citations
3
checked on Oct 14, 2024
Page view(s)
60
checked on Sep 7, 2022
Download(s)
86
checked on Sep 7, 2022
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.