Sciweavers

134 search results - page 6 / 27
» Using Regular Tree Automata as XML Schemas
Sort
View
POPL
2003
ACM
16 years 18 days ago
The essence of XML
The World-Wide Web Consortium (W3C) promotes XML and related standards, including XML Schema, XQuery, and XPath. This paper describes a formalization XML Schema. A formal semantic...
Jérôme Siméon, Philip Wadler
PODS
2007
ACM
171views Database» more  PODS 2007»
16 years 12 days ago
The complexity of reasoning about pattern-based XML schemas
In a recent paper, Martens et al. introduced a specification mechanism for XML tree languages, based on rules of the form r s, where r, s are regular expressions. Sets of such ru...
Gjergji Kasneci, Thomas Schwentick
99
Voted
PLANX
2008
15 years 1 months ago
Linear Time Membership for a Class of XML Types with Interleaving and Counting
Regular Expressions (REs) form the basis of most XML type languages, such as DTDs, XML Schema types, and XDuce types (Thompson et al. 2004; Hosoya and Pierce 2003). In this contex...
Giorgio Ghelli, Dario Colazzo, Carlo Sartiani
IRI
2009
IEEE
15 years 7 months ago
Collaborative Schema Construction using Regular Sequence Types
In this paper we describe an approach to build XML schemas in a collaborative way. The approach is based on computing intersection between sequences of type terms built over const...
Jorge Coelho, Mário Florido, Temur Kutsia
MFCS
2004
Springer
15 years 5 months ago
Complexity of Decision Problems for Simple Regular Expressions
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...
Wim Martens, Frank Neven, Thomas Schwentick