DocumentCode :
3657306
Title :
Matching techniques in global schema design
Author :
Michael V. Mannino;Wolfgang Effelsberg
Author_Institution :
University of Florida, Gainesville, FL 32611
fYear :
1984
fDate :
4/1/1984 12:00:00 AM
Firstpage :
418
Lastpage :
425
Abstract :
A global schema is an integrated view of heterogeneous databases. Identifying common types of information from the various local Schemas is an important part of designing a global schema. After matching the entity types and attributes, the designer constructs the global schema by applying a set of integration operators. In this paper, we propose two types of matching techniques and discuss their use in global schema design. Entity type matching partitions the entity types of the local Schemas into subsets with common information. Attributes within each entity type cluster are then matched according to the similarity of their meaning and scope. We define assertion types for both kinds of matching and provide an algorithm to check the consistency and completeness of attribute assertions.
Keywords :
"Algorithm design and analysis","Semantics","Data models","Distributed databases","Labeling","Database systems"
Publisher :
ieee
Conference_Titel :
Data Engineering, 1984 IEEE First International Conference on
Print_ISBN :
978-0-8186-0533-8
Type :
conf
DOI :
10.1109/ICDE.1984.7271301
Filename :
7271301
Link To Document :
بازگشت