Logic programming and databases
Logic programming and databases
Journal of the ACM (JACM)
Stable models and non-determinism in logic programs with negation
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Foundations of Logic Programming
Foundations of Logic Programming
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Data exchange: getting to the core
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Privacy-preserving data integration and sharing
Proceedings of the 9th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery
Locally consistent transformations and query answering in data exchange
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Data exchange: getting to the core
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Data exchange: computing cores in polynomial time
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Design and implementation of aggregate functions in the dlv system*
Theory and Practice of Logic Programming
Generalized schema-mappings: from termination to tractability
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Laconic schema mappings: computing the core with SQL queries
Proceedings of the VLDB Endowment
Privacy-preserving data publishing: A survey of recent developments
ACM Computing Surveys (CSUR)
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
| Hi-index | 0.00 |
Data exchange is the problem of migrating a data instance from a source schema to a target schema such that the materialized data on the target schema satisfies the integrity constraints specified by: TGDs (Tuple Generating Dependencies), which are universal quantified formulas with additional existential quantifiers, and EGDs (Equality Generating Dependencies), which are universal quantified formulas enforcing the equality of two variables. This paper presents a formulation of the data exchange problem using DATALOG with choice, which is a non deterministic construct based on stable model semantics. TGDs are represented by rules and a choice predicate is used to non-deterministically select values for the existential variables. Every EGD can be naturally represented by a goal rule. However, as in general it expresses a functional dependency, in this case the goal rule can be replaced by a choice predicate defining the functional dependency inside one of TGD rules. Although classical certainty semantics for query answering in a data exchange setting can be also defined for DATALOG with choice, this paper explores another direction: searching for a solution for which a number of given "sensible" queries have uncertainty-guaranteed answers. The paper discusses properties of privacy-preserving data exchange and illustrates its complexity. Finally, EGDs are extended to express count constraints (e.g, an employee may manage at most k departments instead of only one) and the choice construct is therefore extended to implement count constraints. The resulting setting can be used to define the exchange of aggregate data.