Sets and negation in a logic data base language (LDL1)
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
F-logic: a higher-order language for reasoning about objects, inheritance, and scheme
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Object identity as a query language primitive
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
A grammar-based approach towards unifying hierarchical data models
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
ILOG: declarative creation and manipulation of object identifiers
Proceedings of the sixteenth international conference on Very large databases
The SGML handbook
ACM Transactions on Database Systems (TODS)
From structured documents to novel query facilities
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Logical foundations of object-oriented and frame-based languages
Journal of the ACM (JACM)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A database interface for file update
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
IEEE Transactions on Knowledge and Data Engineering
Object Exchange Across Heterogeneous Information Sources
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Correspondence and Translation for Heterogeneous Data
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Querying and Updating the File
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
A Data Transformation System for Biological Data Sources
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Amalgame: A Tool for Creating Interoperating, Persistent, Heterogeneous Components
Advanced Database Systems
Linear time algorithm for isomorphism of planar graphs (Preliminary Report)
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Promptdiff: a fixed-point algorithm for comparing ontology versions
Eighteenth national conference on Artificial intelligence
Ontology mapping: the state of the art
The Knowledge Engineering Review
Journal of Biomedical Informatics
Malan: a mapping language for the data manipulation
Proceedings of the eighth ACM symposium on Document engineering
A solution for an unified vision of the enterprise informations
Proceedings of the 2006 conference on Leading the Web in Concurrent Engineering: Next Generation Concurrent Engineering
Schema and data translation: a personal perspective
ADBIS'07 Proceedings of the 11th East European conference on Advances in databases and information systems
Reasoning on data models in schema translation
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
Data translation between taxonomies
CAiSE'06 Proceedings of the 18th international conference on Advanced Information Systems Engineering
Data model descriptions and translation signatures in a multi-model framework
Annals of Mathematics and Artificial Intelligence
Parameterized regular expressions and their languages
Theoretical Computer Science
Information Resources Management Journal
| Hi-index | 5.23 |
Data integration often requires a clean abstraction of the different formats in which data are stored, and means for specifying the correspondences/relationships between data in different worlds and for translating data from one world to another. For that, we introduce in this paper a middleware data model that serves as a basis for the integration task, and a declarative rules language for specifying the integration. We show that using the language, correspondences between data elements can be computed in polynomial time in many cases, and may require exponential time only when insensitivity to order or duplicates are considered. Furthermore, we show that in most practical cases the correspondence rules can be automatically turned into translation rules to map data from one representation to another. Thus, a complete integration task (derivation of correspondences, transformation of data from one world to the other, incremental integration of a new bulk of data, etc.) can be specified using a single set of declarative rules.