Journal
JOURNAL OF THE ACM
Volume 57, Issue 2, Pages -Publisher
ASSOC COMPUTING MACHINERY
DOI: 10.1145/1667053.1667055
Keywords
Languages; Theory; Schema mapping; instance; complexity; match; data exchange
Categories
Funding
- EPSRC [EP/E010865/1]
- Royal Society Wolfson Research Merit Award
- European Research Council [226513]
- Engineering and Physical Sciences Research Council [EP/E010865/1] Funding Source: researchfish
Ask authors/readers for more resources
We introduce a theoretical framework for discovering relationships between two database instances over distinct and unknown schemata. This framework is grounded in the context of data exchange. We formalize the problem of understanding the relationship between two instances as that of obtaining a schema mapping so that a minimum repair of this mapping provides a perfect description of the target instance given the source instance. We show that this definition yields intuitive results when applied on database instances derived from each other by basic operations. We study the complexity of decision problems related to this optimality notion in the context of different logical languages and show that, even in very restricted cases, the problem is of high complexity.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available