Data Exchange: Getting to the Core

Summary: Core of any universal solution is unique (up to isomorphism), is the minimal universal solution, and optimally answers unions of conjunctive queries with inequalities. Complexity: core computation NP-hard in general and core-recognition DP-complete; provide broad data-exchange conditions yielding polynomial-time construction. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: h89d3f9020b2b3482
Venue: PODS
Year: 2003
Pagerank: 0.00019157229
Overall Rank: 393 | 97.37%
DOI: 10.1145/773153.773163

Incoming Non-self Citations Over Time

Authors

1. Ronald Fagin (IBM)
2. Phokion G. Kolaitis (University of California Santa Cruz)
3. Lucian Popa (IBM)

BibTeX Citation

@inproceedings{fagin_pods03,
        address = {New York, NY, USA},
        series = {{PODS} '03},
        title = {{Data Exchange: Getting to the Core}},
        url = {https://dl.acm.org/doi/10.1145/773153.773163},
        doi = {10.1145/773153.773163},
        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 Popa, Lucian},
        year = {2003}
}

Incoming Citations (Sorted by Pagerank)

Showing 5 of 55 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
9,790	Nested Dependencies: Structure and Reasoning	2014	PODS	5.115551e-05
12,619	Getting Unique Solution in Data Exchange	2013	VLDB	4.9605343e-05
12,750	Certain Answers for XML Queries	2010	PODS	4.9605343e-05
12,962	Expressiveness and Complexity of XML Publishing Transducers	2007	PODS	4.9605343e-05
13,063	Determining Source Contribution in Integration Systems	2005	PODS	4.9605343e-05

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
24	Data Integration: A Theoretical Perspective	2002	PODS	0.00055201845
41	Testing Implications Of Data Dependencies	1979	SIGMOD	0.00045733094
184	Schema Mapping as Query Discovery	2000	VLDB	0.00026196483
239	Complexity of Answering Queries Using Materialized Views	1998	PODS	0.00023510465
429	Translating Web Data	2002	VLDB	0.00018417669
1,508	The Complexity of Evaluating Relational Queries	1983	PODS	0.00010416537
2,111	Functional and Inclusion Dependencies: A Graph Theoretic Approach	1984	PODS	9.0184089e-05
2,241	Physical Data Independence, Constraints, and Optimization with Universal Plans	1999	VLDB	8.7710222e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	3,004	Data Exchange and Incomplete Information	2006	PODS
2	4,925	CWA-Solutions for Data Exchange Settings with Target Dependencies	2007	PODS
3	5,762	Answering Aggregate Queries in Data Exchange	2008	PODS
4	7,093	Laconic Schema Mappings: Computing the Core with SQL Queries	2009	VLDB
5	4,392	Locally Consistent Transformations and Query Answering in Data Exchange	2004	PODS
6	2,560	Peer Data Exchange	2005	PODS
7	4,293	Core Schema Mappings	2009	SIGMOD
8	3,572	The Complexity of Data Exchange	2006	PODS
9	2,604	Computing Cores for Data Exchange: New Algorithms and Practical Solutions	2005	PODS
10	3,376	Data Exchange: Computing Cores in Polynomial Time	2006	PODS