Name
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. |
Year | Venue | Field |
|---|---|---|
2008 | DATABASE PROGRAMMING LANGUAGES | XML,Computer science,Theoretical computer science,Interleaving |
DocType | Volume | ISSN |
Conference | 4797 | 0302-9743 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Giorgio Ghelli | 1 | 1300 | 255.19 |
| Dario Colazzo | 2 | 283 | 34.21 |
| Carlo Sartiani | 3 | 240 | 28.54 |