Abstract
Global-as-view (GAV) constraints form a class of database constraints that has been widely used in the study of data exchange and data integration. Specifically, relationships between different database schemas are commonly described by a schema mapping consisting of a finite set of GAV constraints. Such schema mappings can be viewed as representations of an infinite set of data examples. We study the following problem: when is finite set of GAV constraints uniquely characterizable via a finite set of data examples? By establishing a tight connection between this problem and homomorphism dualities, we obtain a simple criterion for unique characterizability. We also pinpoint the computational complexity of the corresponding decision problem. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Ten Cate, B., Kolaitis, P. G., & Tan, W. C. (2010). Database constraints and homomorphism dualities. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6308 LNCS, pp. 475–490). Springer Verlag. https://doi.org/10.1007/978-3-642-15396-9_38
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
