Database Paper Browser

Back to papers

On the Complexity of Deriving Schema Mappings from Database Instances

Summary: Formalizes inferring a schema mapping from source I to target J over different unknown schemata by requiring a minimal repair to produce J as the 'optimal' translation. Proves high decision complexity for finding such mappings across mapping languages—even in restricted fragments—and develops theoretical foundations without providing a synthesis algorithm. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1443
Venue
PODS
Year
2008
Pagerank
6.6238781e-05
Overall Rank
3,922 | 72.75%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

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.

Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
5,299 Scalable Data Exchange with Functional Dependencies 2010 VLDB 5.5751426e-05
4,468 Data Exchange and Schema Mappings in Open and Closed Worlds 2008 PODS 6.1543925e-05
7,072 Laconic Schema Mappings: Computing the Core with SQL Queries 2009 VLDB 4.8378485e-05
7,650 Foundations of Schema Mapping Management 2010 PODS 4.6839185e-05
12,090 Getting Unique Solution in Data Exchange 2013 VLDB 4.1905499e-05
3,647 The Complexity of Data Exchange 2006 PODS 6.8796285e-05
3,872 Designing and Refining Schema Mappings via Data Examples 2011 SIGMOD 6.6737583e-05
4,750 Normalization and Optimization of Schema Mappings 2009 VLDB 5.9424107e-05
818 Composing Schema Mappings: Second-Order Dependencies to the Rescue 2004 PODS 0.00016240185
4,980 Towards a Theory of Schema-Mapping Optimization 2008 PODS 5.7825422e-05