Skip to Main content Skip to Navigation

Induction de requêtes guidée par schéma

Abstract : XML is a generic data description language originally designed for storing, processing and exchanging information on the Internet. It has raised as a standard for database, document or Web communities, and it is used in numerous applications nowadays. The data format processed by the latter is usually specified by an XML schema. This is a meta-description that constrains the structure of XML documents and their data type.

Querying documents in order to extract information they contain is an essential task. Node selecting queries are for instance the basis for transforming XML documents. However, most existing tools for defining queries over XML documents require technical skills from the user. In contrast, inductive query learning is a way of designing information extraction tasks without any prior knowledge. In such a system, the user annotates some example documents with a graphical interface. A learning algorithm is then used in order to infer the query.

In this thesis, we suggest to use the knowledge provided by XML schemas into query induction algorithms based on grammatical inference techniques. As regular tree languages, schemas can be easily represented by tree automata. Thus their use is especially appropriate to automata inference algorithms. We have distinguished two of them.

1. The first idea is to force inferred queries to be consistent with the schema. For this purpose, we have designed an efficient inclusion test in deterministic factorized tree automata, a model of automata we have defined in order to represent DTDs in a compact manner.

2. The second idea is that information contained in XML schemas might be useful for tree pruning heuristics. Pruning is necessary when processed documents are pretty large and/or partially annotated. The counterpart is that some regular queries cannot be inferred anymore. We give a characterization of the class of queries that can be learned from a sample of pruned annotated trees, namely stable queries.

We have implemented and tested our schema-guided query induction algorithms. The developed system enables to simulate the user behavior when defining a new query. The results of our experiments supports the relevance of our approach. They indeed show that schema-guidance improves the learning process.
Document type :
Complete list of metadatas

Cited literature [3 references]  Display  Hide  Download
Contributor : Jérôme Champavère <>
Submitted on : Tuesday, September 14, 2010 - 1:08:25 PM
Last modification on : Thursday, February 21, 2019 - 10:52:49 AM
Long-term archiving on: : Tuesday, October 23, 2012 - 4:10:32 PM


  • HAL Id : tel-00517358, version 1



Jérôme Champavère. Induction de requêtes guidée par schéma. Autre [cs.OH]. Université des Sciences et Technologie de Lille - Lille I, 2010. Français. ⟨tel-00517358⟩



Record views


Files downloads