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 [8], 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.

• Type: Journal
• Year: 2008
• Where: JIIS
• Authors: Michel de Rougemont, Adrien Vieilleribière
• Keywords: Approximate Query Answering, Edit Distance, JIIS 2008, Tree