Informatica

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.

In this paper we describe possible approaches how to store XML data, which is a key aspect for their further processing. One popular technique for managing XML data is to map the data to an existing database system, e.g., to the relational or object-relational database management system. We describe possible ways how to store XML data in relational databases, because relational systems are still widely used for various purposes, including XML data management. But XML data are trees, not tables, so the main focus of this article is oriented to native XML databases. We describe general properties of such kind of databases and, in particular, explain possible solutions on two experimental native XML database management systems – ExDB and CellStore. Both have been proposed, implemented and optimized in our research groups in recent years for experimental purposes.