An XML schema specifies the structural properties of XML documents generated from the schema and, thus, is useful to manage XML data efficiently. However, there are often XML documents without a valid schema or with an incorrect schema in practice. This leads us to study the problem of inferring a Relax NG schema from a set of XML documents that are presumably generated from a specific XML schema. Relax NG is an XML schema language developed for the next generation of XML schema languages such as document type definitions (DTDs) and XML Schema Definitions (XSDs). Regular hedge grammars accept regular tree languages and the design of Relax NG is closely related with regular hedge grammars. We develop an XML schema inference system using hedge grammars. We employ a genetic algorithm and state elimination heuristics in the process of retrieving a concise Relax NG schema. We present experimental results using real-world benchmark.
|Title of host publication||Language and Automata Theory and Applications - 10th International Conference, LATA 2016, Proceedings|
|Editors||Bianca Truthe, Jan Janoušek, Adrian-Horia Dediu, Carlos Martín-Vide|
|Number of pages||12|
|Publication status||Published - 2016|
|Event||10th International Conference on Language and Automata Theory and Applications, LATA 2016 - Prague, Czech Republic|
Duration: 2016 Mar 14 → 2016 Mar 18
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Other||10th International Conference on Language and Automata Theory and Applications, LATA 2016|
|Period||16/3/14 → 16/3/18|
Bibliographical notePublisher Copyright:
© Springer International Publishing Switzerland 2016.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)