Heuristic Methods for Inference of XML Schemas: Lessons Learned and Open Issues

Article type: Research Article

Authors: Mlýnková, Irena^; | Nečaský, Martin

Affiliations: Department of Software Engineering, Faculty of Mathematics and Physics, Charles University in Prague, Czech Republic, e-mail: mlynkova@ksi.mff.cuni.cz, necasky@ksi.mff.cuni.cz

Note: [] Corresponding author.

Abstract: In this paper we focus on a specific class of XML schema inference approaches – so-called heuristic approaches. Contrary to grammar-inferring approaches, their result does not belong to any specific class of grammars and, hence, we cannot say anything about their features from the point of view of theory of languages. However, the heuristic approaches still form a wider and more popular set of approaches due to natural and user-friendly strategies. We describe a general framework of the inference algorithms and we show how its particular phases can be further enhanced and optimized to get more reasonable and realistic output. The aim of the paper is (1) to provide a general overview of the heuristic inference process and existing approaches, (2) to sum up the improvements and optimizations we have proposed so far in our research group, and (3) to discuss possible extensions and open problems which need to be solved. Hence, it enables the reader to get acquainted with the field fast.

Keywords: XML Schema inference, regular-tree grammars, heuristics, integrity constraints

Journal: Informatica, vol. 24, no. 4, pp. 577-602, 2013