Sciweavers

Share
JIIS
2008

Approximate schemas, source-consistency and query answering

8 years 10 months ago
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.
Michel de Rougemont, Adrien Vieilleribière
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2008
Where JIIS
Authors Michel de Rougemont, Adrien Vieilleribière
Comments (0)
books