Approximate data exchange

5Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We introduce approximate data exchange, by relaxing classical data exchange problems such as Consistency and Typechecking to their approximate versions based on Property Testing. It provides a natural framework for consistency and safety questions, which first considers approximate solutions and then exact solutions obtained with a Corrector. We consider a model based on transducers of words and trees, and study e-Consistency, i.e., the problem of deciding whether a given source instance I is e-close to a source I', whose image by a transducer is also e-close to a target schema. We prove that e-Consistency has an e-tester, i.e. can be solved by looking at a constant fraction of the input I. We also show that e-Typechecking on words can be solved in polynomial time, whereas the exact problem is PSPACE-complete. Moreover, data exchange settings can be composed when they are close. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

De Rougemont, M., & Vieilleribière, A. (2006). Approximate data exchange. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4353 LNCS, pp. 44–58). https://doi.org/10.1007/11965893_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free