The complexity of word problems—this time with interleaving
Information and Computation
Derivatives of Regular Expressions
Journal of the ACM (JACM)
Containment for XPath Fragments under DTD Constraints
ICDT '03 Proceedings of the 9th International Conference on Database Theory
XDuce: A statically typed XML processing language
ACM Transactions on Internet Technology (TOIT)
The XML benchmark project
Efficient Incremental Validation of XML Documents
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
DTDs versus XML schema: a practical study
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
Inference of concise DTDs from XML data
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Inferring XML schema definitions from XML data
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Efficient inclusion for a class of XML types with interleaving and counting
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Efficient incremental validation of XML documents after composite updates
XSym'06 Proceedings of the 4th international conference on Database and XML Technologies
XPath query satisfiability is in PTIME for real-world DTDs
XSym'07 Proceedings of the 5th international conference on Database and XML Technologies
Efficient asymmetric inclusion between regular expression types
Proceedings of the 12th International Conference on Database Theory
Simplifying XML schema: effortless handling of nondeterministic regular expressions
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Regular Expressions with Numerical Constraints and Automata with Counters
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Hi-index | 0.00 |
The extension of Regular Expressions (REs) with an interleaving (shuffle) operator has been proposed in many occasions, since it would be crucial to deal with unordered data. However, interleaving badly affects the complexity of basic operations, and, expecially, makes membership NP-hard [13], which is unacceptable for most uses of REs. REs form the basis of most XML type languages, such as DTDs and XML Schema types, and XDuce types [16, 11]. In this context, the interleaving operator would be a natural addition to the language of REs, as witnessed by the presence of limited forms of interleaving in XSD (the all group), Relax-NG, and SGML, provided that the NP-hardness of membership could be avoided. We present here a restricted class of REs with interleaving and counting which admits a linear membership algorithm, and which is expressive enough to cover the vast majority of real-world XML types. We first present an algorithm for membership of a list of words into a RE with interleaving and counting, based on the translation of the RE into a set of constraints. We generalize the approach in order to check membership of XML trees into a class of EDTDs with interleaving and counting, which models the crucial aspects of DTDs and XSD schemas.