The complexity of word problems—this time with interleaving
Information and Computation
Computational problems related to the design of normal form relational schemas
ACM Transactions on Database Systems (TODS)
Minimization of tree pattern queries
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Containment for XPath Fragments under DTD Constraints
ICDT '03 Proceedings of the 9th International Conference on Database Theory
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
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
Optimizing schema languages for XML: numerical constraints and interleaving
ICDT'07 Proceedings of the 11th international conference on Database Theory
Simple off the shelf abstractions for XML schema
ACM SIGMOD Record
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Inclusion Test Algorithms for One-Unambiguous Regular Expressions
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Linear time membership in a class of regular expressions with interleaving and counting
Proceedings of the 17th ACM conference on Information and knowledge management
Efficient asymmetric inclusion between regular expression types
Proceedings of the 12th International Conference on Database Theory
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Simplifying XML schema: effortless handling of nondeterministic regular expressions
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Efficient inclusion for a class of XML types with interleaving and counting
Information Systems
Linear inclusion for XML regular expression types
Proceedings of the 18th ACM conference on Information and knowledge management
Subtyping algorithm of regular tree grammars with disjoint production rules
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
Complexity of Decision Problems for XML Schemas and Chain Regular Expressions
SIAM Journal on Computing
Journal of Computer and System Sciences
Succinctness of the Complement and Intersection of Regular Expressions
ACM Transactions on Computational Logic (TOCL)
The inclusion problem for regular expressions
Journal of Computer and System Sciences
Almost-linear inclusion for XML regular expression types
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.01 |
Inclusion between XML types is important but expensive, and is much more expensive when unordered types are considered. We prove here that inclusion for XML types with interleaving and counting can be decided in polynomial time in presence of two important restrictions: no element appears twice in the same content model, and Kleene star is only applied to disjunctions of single elements. Our approach is based on the transformation of each such type into a set of constraints that completely characterizes the type. We then provide a complete deduction system to verify whether the constraints of one type imply all the constraints of another one.