@inproceedings{06facab2548048df93b082b0dfd60d6f,
title = "Efficient inclusion for a class of XML types with interleaving and counting",
abstract = "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.",
author = "Giorgio Ghelli and Dario Colazzo and Carlo Sartiani",
year = "2007",
month = jan,
day = "1",
doi = "10.1007/978-3-540-75987-4\_16",
language = "English",
isbn = "9783540759867",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "231--245",
booktitle = "Database Programming Languages - 11th International Symposium, DBPL 2007, Revised Selected Papers",
note = "11th International Symposium on Database Programming Languages, DBPL 2007 ; Conference date: 23-09-2007 Through 24-09-2007",
}