Università di Pisa
Sistema bibliotecario di ateneo

Efficient inclusion for a class of XML types with interleaving and counting

Colazzo, Dario and Ghelli, Giorgio and Sartiani, Carlo (2008) Efficient inclusion for a class of XML types with interleaving and counting. Information Systems, Availa (Availa). ISSN 0306-4379 (In Press)

Download (274Kb) | Preview


    SUMMARY: 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 the 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 content model into a set of constraints that completely characterizes the generated language. We then reduce inclusion checking to constraint implication. We exhibit a quadratic algorithm to perform inclusion checking on a RAM machine.

    Item Type: Article
    Uncontrolled Keywords: XML, Regular expressions, Subtyping, XML Schema
    Subjects: Area01 - Scienze matematiche e informatiche > INF/01 - Informatica
    Divisions: Dipartimenti (until 2012) > DIPARTIMENTO DI INFORMATICA
    Depositing User: Giorgio Ghelli
    Date Deposited: 25 Dec 2008
    Last Modified: 20 Dec 2010 11:54
    URI: http://eprints.adm.unipi.it/id/eprint/552

    Repository staff only actions

    View Item