Document Server@UHasselt >
Research >
Research publications >

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

Title: Which XML Schemas Admit 1-Pass Preorder Typing?
Authors: MARTENS, Wim
NEVEN, Frank
Schwentick, Thomas
Issue Date: 2005
Citation: DATABASE THEORY - ICDT 2005. p. 68-82
Abstract: It is shown that the class of regular tree languages admitting one-pass preorder typing is exactly the class defined by restrained competition tree grammars introduced by Murata et al. [14]. In a streaming context, the former is the largest class of XSDs where every element in a document can be typed when its opening tag is met. The main technical machinery consists of semantical characterizations of restrained competition grammars and their subclasses. In particular, they can be characterized in terms of the context of nodes, closure properties, allowed patterns and guarded DTDs. It is further shown that deciding whether a schema is restrained competition is tractable. Deciding whether a schema is equivalent to a restained competition tree grammar, or one of its subclasses, is much more difficult: it is complete for EXPTIME. We show that our semantical characterizations allow for easy optimization and minimization algorithms. Finally, we relate the notion of one-pass preorder typing to the existing XML Schema standard.
URI: http://hdl.handle.net/1942/606
DOI: 10.1007/b104421
ISI #: 000227472000005
ISSN: 0302-9743
Category: A1
Type: Journal Contribution
Validation: ecoom, 2006
Appears in Collections: Research publications

Files in This Item:

Description SizeFormat
N/A381 kBAdobe PDF

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