Sciweavers

Share
ICDT
2012
ACM

Bounded repairability for regular tree languages

8 years 5 months ago
Bounded repairability for regular tree languages
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, which was previously studied in [6]. Categories and Subject Descriptors H.2.m [Information Systems]: Database Management— Repair Keywords XML, ed...
Gabriele Puppis, Cristian Riveros, Slawek Staworko
Added 29 Sep 2012
Updated 29 Sep 2012
Type Journal
Year 2012
Where ICDT
Authors Gabriele Puppis, Cristian Riveros, Slawek Staworko
Comments (0)
books