Optimized Cartesian product: A hybrid approach to derivation-chain checking in XSD 1.1
Maurizio Casimirri, Paolo Marinelli, Fabio Vitali · Balisage series on markup technologies · 2009
As XPath predicates are involved, XSD 1.1 conditional declarations make difficult the problem of statically verifying whether a type is a legal restriction of its base. The XSD 1.1 current draft adopts a full dynamic approach to the problem. In this paper we propose a hybrid solution (neither completely static, nor completely dynamic) to the same problem.