Towards Practical Feasibility of Core Computation in Data Exchange

Authors:
Reinhard Pichler;Vadim Savenkov
Affiliations:
Vienna University of Technology,;Vienna University of Technology,
Venue:
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Year:
2008

Citing 8
Cited 3

A Proof Procedure for Data Dependencies

Journal of the ACM (JACM)
The core of a graph

Discrete Mathematics - Algebraic graph theory; a volume dedicated to Gert Sabidussi
Horn clauses and database dependencies

Journal of the ACM (JACM)
Reformulation of XML Queries and Constraints

ICDT '03 Proceedings of the 9th International Conference on Database Theory
Data exchange: getting to the core

ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Computing cores for data exchange: new algorithms and practical solutions

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
Data exchange: computing cores in polynomial time

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

Scalable data exchange with functional dependencies

Proceedings of the VLDB Endowment
Core schema mappings: Scalable core computations in data exchange

Information Systems
Getting unique solution in data exchange

Proceedings of the VLDB Endowment

Quantified Score

Hi-index	0.00

Visualization

Abstract

Core computation in data exchange is concerned with materializing the minimal target database for a given source database. Gottlob and Nash have recently shown that the core can be computed in polynomial time under very general conditions. Nevertheless, core computation has not yet been incorporated into existing data exchange tools. The principal aim of this paper is to make a big step forward towards the practical feasibility of core computation in data exchange by developing an improved algorithm and by presenting a prototype implementation of our new algorithm.