Research highlight : ALMOST-LINEAR INCLUSION FOR XML REGULAR EXPRESSION TYPES
ALMOST-LINEAR INCLUSION FOR XML REGULAR EXPRESSION TYPES 21 March 2003
Dario Colazzo, Giorgio Ghelli, Luca Pardini, Carlo Sartiani.
ACM Transactions on Database Systems (TODS)
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.
