Approximate schemas, source-consistency and query answering

We use the Edit distance with Moves on words and trees and say that two regular (tree) languages are ε-close if every word (tree) of one language is ε-close to the other. A transducer model is introduced to compare tree languages (schemas) with different alphabets and attributes. Using the statistical embedding of Fischer et al. (Proceedings of 21st IEEE Symposium on Logic in Computer Science, pp. 421–430, 2006), we show that Source-Consistency and Approximate Query Answering are testable on words and trees, i.e. can be approximately decided within ε by only looking at a constant fraction of the input.

[1]  Marcelo Arenas,et al.  XML data exchange: consistency and query answering , 2005, PODS '05.

[2]  Kuo-Chung Tai,et al.  The Tree-to-Tree Correction Problem , 1979, JACM.

[3]  Ronald Fagin,et al.  Data exchange: semantics and query answering , 2003, Theor. Comput. Sci..

[4]  Andrei Z. Broder,et al.  On the resemblance and containment of documents , 1997, Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171).

[5]  Noga Alon,et al.  Regular languages are testable with a constant number of queries , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[6]  Graham Cormode,et al.  The string edit distance matching problem with moves , 2007, TALG.

[7]  Michel de Rougemont,et al.  Correctors for XML Data , 2004, XSym.

[8]  Z. Galil,et al.  Pattern matching algorithms , 1997 .

[9]  Dana Ron,et al.  Property testing and its connection to learning and approximation , 1998, JACM.

[10]  Mike Paterson,et al.  A Faster Algorithm Computing String Edit Distances , 1980, J. Comput. Syst. Sci..

[11]  James W. Thatcher,et al.  Characterizing Derivation Trees of Context-Free Grammars through a Generalization of Finite Automata Theory , 1967, J. Comput. Syst. Sci..

[12]  Dana Shapira,et al.  Edit distance with move operations , 2002, J. Discrete Algorithms.

[13]  Rohit Parikh,et al.  On Context-Free Languages , 1966, JACM.

[14]  Frédéric Magniez,et al.  Approximate Satisfiability and Equivalence , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[15]  Frédéric Magniez,et al.  Property Testing of Regular Tree Languages , 2004, ICALP.

[16]  Ronitt Rubinfeld,et al.  Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..

[17]  Frank Neven,et al.  Frontiers of tractability for typechecking simple XML transformations , 2007, J. Comput. Syst. Sci..

[18]  Michael J. Fischer,et al.  The String-to-String Correction Problem , 1974, JACM.