DBScholar

Back to papers

Towards a Theory of Schema-Mapping Optimization

Summary: Define data-exchange and conjunctive-query (CQ) equivalences as practical relaxations of logical equivalence for schema mappings. Provide characterizations—via bounded cores of universal solutions—of when SO‑tgds or s‑t+target tgds with terminating chase are CQ‑equivalent to finite s‑t tgd sets. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
h7d7949a42856ba67
Venue
PODS
Year
2008
Pagerank
6.4574226e-05
Overall Rank
4,706 | 68.38%
DOI
10.1145/1376916.1376922

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{fagin_pods08,
        address = {New York, NY, USA},
        series = {{PODS} '08},
        title = {{Towards a Theory of Schema-Mapping Optimization}},
        url = {https://dl.acm.org/doi/10.1145/1376916.1376922},
        doi = {10.1145/1376916.1376922},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Fagin, Ronald and Kolaitis, Phokion G. and Nash, Alan and Popa, Lucian},
        year = {2008}
}

Incoming Citations (Sorted by Pagerank)

Showing 12 of 12 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 17 of 17 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers