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 ε-Consistency, i.e., the problem of deciding whether a given source instance I is ε-close to a source I′, whose image by a transducer is also ε-close to a target schema. We prove that ε-Consistency has an ε-tester, i.e. can be solved by looking at a constant fraction of the input I. We also show that ε-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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alon, N., Fischer, E., Krivelevich, M., Szegedy, M.: Efficient testing of large graphs. Combinatorica 20, 451–476 (2000)
Alon, N., Krivelich, M., Newman, I., Szegedy, M.: Regular languages are testable with a constant number of queries. SIAM Journal on Computing 30(6) (2000)
Arenas, M., Libkin, L.: Xml data exchange: Consistency and query answering. In: ACM Principles on Databases Systems (2005)
Boobna, U., de Rougemont, M.: Correctors for XML data. In: XML Database Symposium, pp. 97–111 (2004)
Broder, A.: On the resemblance and containment of documents. In: Compression and Complexity of Sequences, pp. 21–29 (1997)
Cormode, G., Muthukrishnan, S.: The string edit distance matching problem with moves. In: Symposium on Society for Industrial and Applied Mathematics, pp. 667–676 (2002)
Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: Semantics and query answering. In: International Conference on Database Theory, pp. 207–224 (2002)
Fagin, R., Kolaitis, P.G., Popa, L., Tan, W.C.: Composing schema mappings: Second-order dependencies to the rescue. In: ACM Principles on Databases Systems, pp. 83–94 (2004)
Fischer, E., Magniez, F., de Rougemont, M.: Approximate satisfiability and equivalence. In: Proceedings of 21st IEEE Symposium on Logic in Computer Science (2006)
Garofalakis, M., Kumar, A.: Xml stream processing using tree-edit distance embeddings. ACM Transactions on Database Systems 30(1), 279–332 (2005)
Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. Journal of the ACM 45(4), 653–750 (1998)
Magniez, F., de Rougemont, M.: Property testing of regular tree languages. In: International Colloquium on Automata Languages and Programming, pp. 932–944 (2004)
Martens, W., Neven, F.: Frontiers of tractability for typechecking simple XML transformations. In: ACM Principles on Databases Systems, pp. 23–34 (2004)
Parikh, R.J.: On context-free languages. Journal of the ACM 13(4), 570–581 (1966)
Rubinfeld, R., Sudan, M.: Robust characterizations of polynomials with applications to program testing. SIAM Journal on Computing 25(2), 23–32 (1996)
Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time(Preliminary Report). In: ACM Symposium on Theory of Computing, pp. 1–9 (1973)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Rougemont, M., Vieilleribière, A. (2006). Approximate Data Exchange. In: Schwentick, T., Suciu, D. (eds) Database Theory – ICDT 2007. ICDT 2007. Lecture Notes in Computer Science, vol 4353. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11965893_4
Download citation
DOI: https://doi.org/10.1007/11965893_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69269-0
Online ISBN: 978-3-540-69270-6
eBook Packages: Computer ScienceComputer Science (R0)