A Proof Procedure for Data Dependencies
Journal of the ACM (JACM)
Discrete Mathematics - Algebraic graph theory; a volume dedicated to Gert Sabidussi
Answering queries using views (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Data-driven understanding and refinement of schema mappings
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Schema Mapping as Query Discovery
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
ILOG: Declarative Creation and Manipulation of Object Identifiers
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
MiniCon: A scalable algorithm for answering queries using views
The VLDB Journal — The International Journal on Very Large Data Bases
Data exchange: getting to the core
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Data exchange: semantics and query answering
Theoretical Computer Science - Database theory
Composing schema mappings: Second-order dependencies to the rescue
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
Nested mappings: schema mapping reloaded
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Debugging schema mappings with routes
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Putting context into schema matching
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
ACM Transactions on Database Systems (TODS)
Efficient core computation in data exchange
Journal of the ACM (JACM)
Schema mapping verification: the spicy way
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Quasi-inverses of schema mappings
ACM Transactions on Database Systems (TODS)
Towards a theory of schema-mapping optimization
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Comparing and evaluating mapping systems with STBenchmark
Proceedings of the VLDB Endowment
Towards Practical Feasibility of Core Computation in Data Exchange
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Structural characterizations of schema-mapping languages
Proceedings of the 12th International Conference on Database Theory
On keys, foreign keys and nullable attributes in relational mapping systems
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Clip: a Visual Language for Explicit Schema Mappings
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Provenance in Databases: Why, How, and Where
Foundations and Trends in Databases
The recovery of a schema mapping: Bringing exchanged data back
ACM Transactions on Database Systems (TODS)
Concise and expressive mappings with +Spicy
Proceedings of the VLDB Endowment
Laconic schema mappings: computing the core with SQL queries
Proceedings of the VLDB Endowment
Normalization and optimization of schema mappings
Proceedings of the VLDB Endowment
Scalable data exchange with functional dependencies
Proceedings of the VLDB Endowment
EXLEngine: executable schema mappings for statistical data processing
Proceedings of the 16th International Conference on Extending Database Technology
Getting unique solution in data exchange
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
Research has investigated mappings among data sources under two perspectives. On the one side, there are studies of practical tools for schema mapping generation; these focus on algorithms to generate mappings based on visual specifications provided by users. On the other side, we have theoretical researches about data exchange. These study how to generate a solution - i.e., a target instance - given a set of mappings usually specified as tuple generating dependencies. Since the notion of a core solution has been formally identified as an optimal solution, it is very important to efficiently support core computations in mapping systems. In this paper, we introduce several new algorithms that contribute to bridge the gap between the practice of mapping generation and the theory of data exchange. We show how, given a mapping scenario, it is possible to generate an executable script that computes core solutions for the corresponding data exchange problem. The algorithms have been implemented and tested using common runtime engines to show that they guarantee very good performances, orders of magnitudes better than those of known algorithms that compute the core as a post-processing step.