DBScholar

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
1442
Venue
PODS
Year
2008
Pagerank
7.0063604e-05
Overall Rank
3,942 | 72.96%
DOI
10.1145/1376916.1376921

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{senellart_pods08,
        address = {New York, NY, USA},
        series = {{PODS} '08},
        title = {{On the Complexity of Deriving Schema Mappings from Database Instances}},
        url = {https://dl.acm.org/doi/10.1145/1376916.1376921},
        doi = {10.1145/1376916.1376921},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Senellart, Pierre and Gottlob, Georg},
        year = {2008}
}

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