Please use this identifier to cite or link to this item:
Title: Simple off the shelf abstractions for XML schema
Authors: MARTENS, Wim 
NEVEN, Frank 
Schwentick, Thomas
Issue Date: 2007
Publisher: ACM
Source: SIGMOD RECORD, 36(3). p. 15-22
Abstract: Although the advent of XML Schema [25] has rendered DTDs obsolete, research on practical XML optimization is mostly biased towards DTDs and tends to largely ignore XSDs (some notable exceptions non-withstanding). One of the underlying reasons is most probably the perceived simplicity of DTDs versus the alleged impenetrability of XML Schema. Indeed, optimization w.r.t. DTDs has a local flavor and usually reduces to reasoning about the accustomed formalism of regular expressions. XSDs, on the other hand, even when sufficiently stripped down, are related to the less pervious class of unranked regular tree automata [6, 19, 20, 21]. Recent results on the structural expressiveness of XSDs [19], however, show that XSDs are in fact much closer to DTDs than to tree automata, leveraging the possibility to directly extend techniques for DTD-based XML optimization to the realm of XML Schema. The goal of the present paper is to present the results in [19] in an easy and accessible way. At the same time, we discuss possible applications, related research, and future research directions. Throughout the paper, we try to restrict notation to a minimum. We refer to [19] for further details.
Document URI:
Link to publication:
ISSN: 0163-5808
e-ISSN: 1943-5835
ISI #: 000251215700002
Category: A1
Type: Journal Contribution
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
p15.libkin-martens.pdfPublished version210.24 kBAdobe PDFView/Open
Show full item record


checked on May 22, 2022

Page view(s)

checked on May 20, 2022


checked on May 20, 2022

Google ScholarTM


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