par Arenas, Marcelo;Daenen, Jonny;Neven, Frank;Ugarte, Martin;Van den Bussche, Jan;Vansummeren, Stijn 
Référence Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, ACM, page (61-72)
Publication Publié, 2013
Référence Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, ACM, page (61-72)
Publication Publié, 2013
Publication dans des actes
| Résumé : | A great deal of research into the learning of schemas from XML data has been conducted in recent years to enable the automatic discovery of XML Schemas from XML documents when no schema, or only a low-quality one is available. Unfortunately, and in strong contrast to, for instance, the relational model, the automatic discovery of even the simplest of XML constraints, namely XML keys, has been left largely unexplored in this context. A major obstacle here is the unavailability of a theory on reasoning about XML keys in the presence of XML schemas, which is needed to validate the quality of candidate keys. The present paper embarks on a fundamental study of such a theory and classifies the complexity of several crucial properties concerning XML keys in the presence of an XSD, like, for instance, testing for consistency, boundedness, satisfiability, universality, and equivalence. Of independent interest, novel results are obtained related to cardinality estimation of XPath result sets. A mining algorithm is then developed within the framework of levelwise search. The algorithm leverages known discovery algorithms for functional dependencies in the relational model, but incorporates the above mentioned properties to assess and refine the quality of derived keys. An experimental study on an extensive body of real world XML data evaluating the effectiveness of the proposed algorithm is provided. |
