Database constraints and homomorphism dualities

Authors:
Balder Ten Cate;Phokion G. Kolaitis;Wang-Chiew Tan
Affiliations:
University of California Santa Cruz;University of California Santa Cruz and IBM Research-Almaden;University of California Santa Cruz and IBM Research-Almaden
Venue:
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Year:
2010

Citing 11
Cited 5

The core of a graph

Discrete Mathematics - Algebraic graph theory; a volume dedicated to Gert Sabidussi
On bounded treewidth duality of graphs

Journal of Graph Theory
Data integration: a theoretical perspective

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Undirected ST-connectivity in log-space

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Schema mappings, data exchange, and metadata management

Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Data exchange: semantics and query answering

Theoretical Computer Science - Database theory
Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism Duality

SIAM Journal on Discrete Mathematics
Generalised dualities and maximal finite antichains in the homomorphism order of relational structures

European Journal of Combinatorics
Structural characterizations of schema-mapping languages

Proceedings of the 12th International Conference on Database Theory
Logical foundations of relational data exchange

ACM SIGMOD Record
Characterizing schema mappings via data examples

Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

Designing and refining schema mappings via data examples

Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Characterizing schema mappings via data examples

ACM Transactions on Database Systems (TODS)
Efficient approximations of conjunctive queries

PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Learning schema mappings

Proceedings of the 15th International Conference on Database Theory
Learning schema mappings

ACM Transactions on Database Systems (TODS) - Invited papers issue

Quantified Score

Hi-index	0.00

Visualization

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.