Skip to main content
Conference Proceedings

On the cardinality of schema matching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2005) 3762 LNCS 947-956
DOI: 10.1007/11575863_116
6Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we discuss aspects of cardinality constraints in schema matching. A new cardinality classification is proposed, emphasizing the challenges in schema matching that evolve from cardinality constraints. We also offer a new research direction for automating schema matching to manage cardinality constraints. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Gal, A. (2005). On the cardinality of schema matching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3762 LNCS, pp. 947–956). https://doi.org/10.1007/11575863_116

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free