Computing cores for data exchange: new algorithms and practical solutions

@inproceedings{Gottlob2005ComputingCF,
  title={Computing cores for data exchange: new algorithms and practical solutions},
  author={Georg Gottlob},
  booktitle={PODS},
  year={2005}
}
Data Exchange is the problem of inserting data structured under a source schema into a target schema of different structure (possibly with integrity constraints), while reflecting the source data as accurately as possible. We study computational issues related to data exchange in the setting of Fagin, Kolaitis, and Popa(PODS'03). We use the technique of hypertree decompositions to derive improved algorithms for computing the core of a relational instance with labeled nulls, a problem we show to… CONTINUE READING
Highly Cited
This paper has 51 citations. REVIEW CITATIONS
36 Citations
4 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Ph

  • R. Fagin
  • Kolaitis, and L. Popa, Data Exchange: Getting to…
  • 2003
Highly Influential
15 Excerpts

Similar Papers

Loading similar papers…