By Topic

Database Conceptual Schema Matching

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Casanova, M.A. ; Pontificia Univ. Catolica do Rio de Janeiro, Rio de Janeiro ; Breitman, K.K. ; Brauner, D.F. ; Marins, A.L.A.

A database conceptual schema is a high-level description of how database concepts are organized, which is typically as classes of objects and their attributes. A fundamental operation in many database applications, schema matching involves finding a mapping mu between the concepts in a source scheme S and the concepts in a target schema T such that, if t = mu(s), then s and t have the same meaning. Along with data warehousing, query mediation relies heavily on schema marching. This application uses a mediator to translate user queries, formulated in terms of a common schema M, into queries that local databases can handle. The mediator must therefore be able to match each local schema with M. Query mediation is particularly challenging in the context of the Web, where the number of local databases, over which the mediator has little control, is enormous. We examine three major approaches to schema matching - syntactic, semantic, and a priori - using examples, with a focus on mediator design.

Published in:

Computer  (Volume:40 ,  Issue: 10 )