Answering queries using views (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Query caching and optimization in distributed mediator systems
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Infomaster: an information integration system
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
The TSIMMIS Approach to Mediation: Data Models and Languages
Journal of Intelligent Information Systems - Special issue: next generation information technologies and systems
Answering recursive queries using views
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the decidability of query containment under constraints
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Complexity of nonrecursive logic programs with complex values
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Introduction to the Theory of Computation
Introduction to the Theory of Computation
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Complexity of Query Answering in Logic Databases with Complex Values
LFCS '97 Proceedings of the 4th International Symposium on Logical Foundations of Computer Science
A Scalable Algorithm for Answering Queries Using Views
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Querying Heterogeneous Information Sources Using Source Descriptions
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Information Integration: Conceptual Modeling and Reasoning Support
COOPIS '98 Proceedings of the 3rd IFCIS International Conference on Cooperative Information Systems
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Towards heterogeneous multimedia information systems: the Garlic approach
RIDE '95 Proceedings of the 5th International Workshop on Research Issues in Data Engineering-Distributed Object Management (RIDE-DOM'95)
Planning to gather inforrnation
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Logical foundations of peer-to-peer data integration
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Composition of mappings given by embedded dependencies
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Determining source contribution in integration systems
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Query reformulation with constraints
ACM SIGMOD Record
Composition of mappings given by embedded dependencies
ACM Transactions on Database Systems (TODS)
Query rewriting with symmetric constraints
AI Communications
Computing certain answers in the presence of dependencies
Information Systems
Privacy in GLAV information integration
ICDT'07 Proceedings of the 11th international conference on Database Theory
Logical foundations for data integration
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Query answering by rewriting in GLAV data integration systems under constraints
SWDB'04 Proceedings of the Second international conference on Semantic Web and Databases
Query processing under GLAV mappings for relational and graph databases
Proceedings of the VLDB Endowment
Query rewriting under query refinements
Knowledge-Based Systems
Taming the infinite chase: query answering under expressive relational constraints
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
We address the problem of answering queries using expressive symmetric inter-schema constraints which allow to establish mappings between several heterogeneous information systems. This problem is of high relevance to data integration, as symmetric constraints are essential for dealing with true concept mismatch and are generalizations of the kinds of mappings supported by both local-as-view and global-as-view approaches that were previously studied in the literature. Moreover, the flexibility gained by using such constraints for data integration is essential for virtual enterprise and e-commerce applications. We first discuss resolution-based methods for computing maximally contained rewritings and characterize computability aspects. Then we propose an alternative but semantically equivalent perspective based on a generalization of results relating to the database-theoretic problem of answering queries using views. This leads to a fast query rewriting algorithm, which has been implemented and experimentally evaluated.