Show simple item record

dc.contributor.authorGal, Avigdor
dc.contributor.authorKatz, Michael
dc.contributor.authorSagi, Tomer
dc.contributor.authorWeidlich, Matthias
dc.contributor.authorAberer, Karl
dc.contributor.authorNguyen, Quoc Viet Hung
dc.contributor.authorMiklos, Zoltan
dc.contributor.authorLevy, Eliezer
dc.contributor.authorShafran, Victor
dc.date.accessioned2017-10-16T06:16:06Z
dc.date.available2017-10-16T06:16:06Z
dc.date.issued2013
dc.identifier.issn0302-9743
dc.identifier.doi10.1007/978-3-642-41030-7_15
dc.identifier.urihttp://hdl.handle.net/10072/348255
dc.description.abstractGiven a schema and a set of concepts, representative of entities in the domain of discourse, schema cover defines correspondences between concepts and parts of the schema. Schema cover aims at interpreting the schema in terms of concepts and thus, vastly simplifying the task of schema integration. In this work we investigate two properties of schema cover, namely completeness and ambiguity. The former measures the part of a schema that can be covered by a set of concepts and the latter examines the amount of overlap between concepts in a cover. To study the tradeoffs between completeness and ambiguity we define a cover model to which previous frameworks are special cases. We analyze the theoretical complexity of variations of the cover problem, some aim at maximizing completeness while others aim at minimizing ambiguity. We show that variants of the schema cover problem are hard problems in general and formulate an exhaustive search solution using integer linear programming. We then provide a thorough empirical analysis, using both real-world and simulated data sets, showing empirically that the integer linear programming solution scales well for large schemata. We also show that some instantiations of the general schema cover problem are more effective than others.
dc.description.peerreviewedYes
dc.languageEnglish
dc.language.isoeng
dc.publisherSpringer
dc.relation.ispartofpagefrom241
dc.relation.ispartofpageto258
dc.relation.ispartofjournalLecture Notes in Computer Science
dc.relation.ispartofvolume8185
dc.subject.fieldofresearchDatabase Management
dc.subject.fieldofresearchcode080604
dc.titleCompleteness and Ambiguity of Schema Cover
dc.typeJournal article
dc.type.descriptionC1 - Articles
dc.type.codeC - Journal Articles
dc.description.versionAccepted Manuscript (AM)
gro.rights.copyright© 2013 Springer International Publishing AG. This is the author-manuscript version of this paper. Reproduced in accordance with the copyright policy of the publisher. The original publication is available at www.springerlink.com.
gro.hasfulltextFull Text
gro.griffith.authorNguyen, Henry


Files in this item

This item appears in the following Collection(s)

  • Journal articles
    Contains articles published by Griffith authors in scholarly journals.

Show simple item record