Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
×
The present article embarks on a fundamental study of such a theory and classifies the complexity of several crucial properties concerning XML keys in the ...
We use a formal- ization of XSD keys (defined in Section 3) consistent with the def- inition of XML keys by W3C [31]. We develop a key mining al- gorithm within ...
Jun 22, 2013 · The present paper embarks on a fundamental study of such a theory and classifies the complexity of several crucial properties concerning XML ...
A great deal of research into the learning of schemas from XML data has been conducted in recent years to enable the automatic dis-covery of XML Schemas ...
We use a formalization of XSD keys (defined in Section 3) consistent with the definition of XML keys by W3C [2004]. We develop a key mining algorithm within the ...
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 ...
The present article embarks on a fundamental study of such a theory and classifies the complexity of several crucial properties concerning XML keys in the ...
Discovering XSD Keys from XML Data 39:5 paper is NP-hardness of satisfiability w.r.t. a non-recursive DTD and for keys with only one key path. We show that ...
People also ask
Discovering XSD Keys from XML Data. M. Arenas, J. Daenen, F. Neven, M. Ugarte, J. den Bussche, and S. Vansummeren. ACM Trans. Database Syst., 39 (4): 28:1-28 ...
Bibliographic details on Discovering XSD keys from XML data.