On the cardinality of schema matching

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationOn the Move to Meaningful Internet Systems 2005
Subtitle of host publicationOTM Workshops - OTM Confederated Int. Workshops and Posters, AWeSOMe, CAMS, GADA, MIOS+INTEROP, ORM, PhDS, SeBGIS, SWWS, and WOSE 2005, Proceedings
Pages947-956
Number of pages10
DOIs
StatePublished - 2005
EventOTM Confederated Internationl Workshops and Posters, AWeSOMe, CAMS, GADA, MIOS+INTEROP, ORM, PhDS, SeBGIS, SWWS, and WOSE 2005 - Agia Napa, Cyprus
Duration: 31 Oct 20054 Nov 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3762 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceOTM Confederated Internationl Workshops and Posters, AWeSOMe, CAMS, GADA, MIOS+INTEROP, ORM, PhDS, SeBGIS, SWWS, and WOSE 2005
Country/TerritoryCyprus
CityAgia Napa
Period31/10/054/11/05

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'On the cardinality of schema matching'. Together they form a unique fingerprint.

Cite this