CWA-Solutions for Data Exchange Settings with Target Dependencies
Summary: Extend Libkin's CWA-solutions to settings with target dependencies: for weakly acyclic targets the core is the unique minimal CWA-solution, and CWA-solutions and positive-query certain answers are PTIME-computable though maximal CWA-solutions may not be unique. Certain answers for CQs with one inequality are co-NP-hard; Existence-of-CWA-Solutions is PTIME for weakly acyclic settings but undecidable in general, implying undecidability of Existence-of-Universal-Solutions. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. André Hernich (Humboldt University of Berlin)
- 2. Nicole Schweikardt (Humboldt University of Berlin)
BibTeX Citation
@inproceedings{hernich_pods07,
address = {New York, NY, USA},
series = {{PODS} '07},
title = {{CWA-Solutions for Data Exchange Settings with Target Dependencies}},
url = {https://dl.acm.org/doi/10.1145/1265530.1265547},
doi = {10.1145/1265530.1265547},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Hernich, André and Schweikardt, Nicole},
year = {2007}
}Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,599 | Update Exchange with Mappings and Provenance | 2007 | VLDB | 0.00010241307 |
| 4,320 | Normalization and Optimization of Schema Mappings | 2009 | VLDB | 6.762853e-05 |
| 4,353 | Chase Termination for Guarded Existential Rules | 2015 | PODS | 6.7490677e-05 |
| 4,377 | Data Exchange and Schema Mappings in Open and Closed Worlds | 2008 | PODS | 6.7358004e-05 |
| 5,624 | Answering Aggregate Queries in Data Exchange | 2008 | PODS | 6.145135e-05 |
Previous
Page 1 / 1
Next
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 |
|---|---|---|---|---|
| 377 | Data Exchange: Getting to the Core | 2003 | PODS | 0.00019643793 |
| 506 | Schema Mappings, Data Exchange, and Metadata Management | 2005 | PODS | 0.0001728171 |
| 1,426 | Inverting Schema Mappings | 2006 | PODS | 0.00010814403 |
| 2,049 | XML Data Exchange: Consistency and Query Answering | 2005 | PODS | 9.255274e-05 |
| 2,934 | Data Exchange and Incomplete Information | 2006 | PODS | 7.9451055e-05 |
| 3,302 | Data Exchange: Computing Cores in Polynomial Time | 2006 | PODS | 7.5406585e-05 |
| 3,485 | The Complexity of Data Exchange | 2006 | PODS | 7.3703451e-05 |
| 4,281 | Locally Consistent Transformations and Query Answering in Data Exchange | 2004 | PODS | 6.7848108e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,377 | Data Exchange and Schema Mappings in Open and Closed Worlds | 2008 | PODS |
| 2 | 4,281 | Locally Consistent Transformations and Query Answering in Data Exchange | 2004 | PODS |
| 3 | 12,279 | Getting Unique Solution in Data Exchange | 2013 | VLDB |
| 4 | 2,550 | Computing Cores for Data Exchange: New Algorithms and Practical Solutions | 2005 | PODS |
| 5 | 5,624 | Answering Aggregate Queries in Data Exchange | 2008 | PODS |
| 6 | 377 | Data Exchange: Getting to the Core | 2003 | PODS |
| 7 | 3,302 | Data Exchange: Computing Cores in Polynomial Time | 2006 | PODS |
| 8 | 2,510 | Peer Data Exchange | 2005 | PODS |
| 9 | 2,934 | Data Exchange and Incomplete Information | 2006 | PODS |
| 10 | 3,485 | The Complexity of Data Exchange | 2006 | PODS |