Approximate Data Exchange

  • Michel de Rougemont
  • Adrien Vieilleribière
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4353)


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.


Edit Distance Target Schema Query Answering Tree Transducer Target Instance 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Alon, N., Fischer, E., Krivelevich, M., Szegedy, M.: Efficient testing of large graphs. Combinatorica 20, 451–476 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    Arenas, M., Libkin, L.: Xml data exchange: Consistency and query answering. In: ACM Principles on Databases Systems (2005)Google Scholar
  4. 4.
    Boobna, U., de Rougemont, M.: Correctors for XML data. In: XML Database Symposium, pp. 97–111 (2004)Google Scholar
  5. 5.
    Broder, A.: On the resemblance and containment of documents. In: Compression and Complexity of Sequences, pp. 21–29 (1997)Google Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    Fischer, E., Magniez, F., de Rougemont, M.: Approximate satisfiability and equivalence. In: Proceedings of 21st IEEE Symposium on Logic in Computer Science (2006)Google Scholar
  10. 10.
    Garofalakis, M., Kumar, A.: Xml stream processing using tree-edit distance embeddings. ACM Transactions on Database Systems 30(1), 279–332 (2005)CrossRefGoogle Scholar
  11. 11.
    Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. Journal of the ACM 45(4), 653–750 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Magniez, F., de Rougemont, M.: Property testing of regular tree languages. In: International Colloquium on Automata Languages and Programming, pp. 932–944 (2004)Google Scholar
  13. 13.
    Martens, W., Neven, F.: Frontiers of tractability for typechecking simple XML transformations. In: ACM Principles on Databases Systems, pp. 23–34 (2004)Google Scholar
  14. 14.
    Parikh, R.J.: On context-free languages. Journal of the ACM 13(4), 570–581 (1966)zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Rubinfeld, R., Sudan, M.: Robust characterizations of polynomials with applications to program testing. SIAM Journal on Computing 25(2), 23–32 (1996)CrossRefMathSciNetGoogle Scholar
  16. 16.
    Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time(Preliminary Report). In: ACM Symposium on Theory of Computing, pp. 1–9 (1973)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Michel de Rougemont
    • 1
  • Adrien Vieilleribière
    • 2
  1. 1.University Paris II & LRI CNRS 
  2. 2.University Paris-Sud & LRI CNRS 

Personalised recommendations