Bounded repairability for regular tree languages

Gabriele Puppis (1) , Cristian Riveros (1) , Slawomir Staworko (2, 3)

1 Department of Computer Science [Oxford]
2 MOSTRARE - Modeling Tree Structures, Machine Learning, and Information Extraction
3 LIFL - Laboratoire d'Informatique Fondamentale de Lille

We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a DTD) into unranked trees satisfying a given target specification T. Specifically, we focus on the question of whether one can get from any tree in a regular language R to some tree in another regular language T with a finite, uniformly bounded, number of edit operations (i.e., deletions and insertions of nodes). We give effective characterizations of the pairs of specifications R and T for which such a uniform bound exists, and we study the complexity of the problem under different representations of the regular tree languages (e.g., non-deterministic stepwise automata, deterministic stepwise automata, DTDs). Finally, we point out some connections with the analogous problem for regular languages of words.

Domaines: Base de données [cs.DB]

Gabriele Puppis, Cristian Riveros, Slawomir Staworko. Bounded repairability for regular tree languages. 15th International Conference on Database Theory, ICDT, Mar 2012, Berlin, Germany. pp.155-168, ⟨10.1145/2274576.2274593⟩. ⟨hal-00643100⟩