An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
Hypertree decompositions and tractable queries
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Consistent query answers in inconsistent databases
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The Recursive Unsolvability of the Decision Problem for the Class of Definite Formulas
Journal of the ACM (JACM)
Using Semi-Joins to Solve Relational Queries
Journal of the ACM (JACM)
Data integration: a theoretical perspective
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Inductive Logic Programming: Techniques and Applications
Inductive Logic Programming: Techniques and Applications
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Data Exchange: Semantics and Query Answering
ICDT '03 Proceedings of the 9th International Conference on Database Theory
RoadRunner: Towards Automatic Data Extraction from Large Web Sites
Proceedings of the 27th International Conference on Very Large Data Bases
On the Complexity of Some Inductive Logic Programming Problems
ILP '97 Proceedings of the 7th International Workshop on Inductive Logic Programming
A survey of approaches to automatic schema matching
The VLDB Journal — The International Journal on Very Large Data Bases
Properties of acyclic database schemes
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Composing schema mappings: second-order dependencies to the rescue
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Schema mappings, data exchange, and metadata management
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Clio grows up: from research prototype to industrial tool
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Quasi-inverses of schema mappings
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Algorithms for acyclic database schemes
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
On the data mapping problem
On the complexity of deriving schema mappings from database instances
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Reducing the size of NFAs by using equivalences and preorders
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
On the inapproximability of vertex cover on k-partite k-uniform hypergraphs
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Designing and refining schema mappings via data examples
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Nearly optimal NP-hardness of vertex cover on k-uniform k-partite hypergraphs
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Characterizing schema mappings via data examples
ACM Transactions on Database Systems (TODS)
Foundational aspects of semantic web optimization
PhD '12 Proceedings of the on SIGMOD/PODS 2012 PhD Symposium
Proceedings of the 15th International Conference on Database Theory
Schema mappings and data examples
Proceedings of the 16th International Conference on Extending Database Technology
Learning queries for relational, semi-structured, and graph databases
Proceedings of the 2013 Sigmod/PODS Ph.D. symposium on PhD symposium
ACM Transactions on Database Systems (TODS) - Invited papers issue
| Hi-index | 0.00 |
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.