The complexity of word problems—this time with interleaving
Information and Computation
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
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
One-unambiguity of regular expressions with numeric occurrence indicators
Information and Computation
Lower bounds for natural proof systems
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Efficient asymmetric inclusion between regular expression types
Proceedings of the 12th International Conference on Database Theory
Efficient inclusion for a class of XML types with interleaving and counting
Information Systems
Regular Expressions with Counting: Weak versus Strong Determinism
MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
Efficient inclusion checking for deterministic tree automata and XML Schemas
Information and Computation
Linear inclusion for XML regular expression types
Proceedings of the 18th ACM conference on Information and knowledge management
Efficient inclusion for a class of XML types with interleaving and counting
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Precision and complexity of XQuery type inference
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Optimizing schema languages for XML: numerical constraints and interleaving
ICDT'07 Proceedings of the 11th international conference on Database Theory
The inclusion problem for regular expressions
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
| Hi-index | 0.00 |
Type inclusion is a fundamental operation in every type-checking compiler, but it is quite expensive for XML manipulation languages. A polynomial inclusion checking algorithm for an expressive family of XML type languages is known, but it runs in quadratic time both in the best and in the worst cases. We present here an algorithm that has a linear-time backbone, and resorts to the quadratic approach for some specific parts of the compared types. Our experiments show that the new algorithm is much faster than the quadratic one, and that it typically runs in linear time, hence it can be used as a building block for a practical type-checking compiler.