The objective of entity identification is to determine the correspondence between object instances from more than one database. This paper examines the problem at the instance level assuming that schema level heterogeneity has been resolved a priori. Soundness and completeness are defined as the desired properties of any entity identification technique. To achieve soundness, a set of identity and distinctness rules are established for entities in the integrated world. We propose the use of extended key, which is the union of keys (and possibly other attributes) from the relations to be matched, and its corresponding identity rule, to determine the equivalence between tuples from relations which may not share any common key. Instance level functional dependencies (ILFD), a form of semantic constraint information about the real-world entities, are used to derive the missing extended key attribute values of a tuple.
|Original language||English (US)|
|Title of host publication||1993 IEEE 9th International Conference on Data Engineering|
|Publisher||Publ by IEEE|
|Number of pages||8|
|State||Published - 1993|
|Event||1993 IEEE 9th International Conference on Data Engineering - Vienna, Austria|
Duration: Apr 19 1993 → Apr 23 1993
|Name||Proceedings - International Conference on Data Engineering|
|Other||1993 IEEE 9th International Conference on Data Engineering|
|Period||4/19/93 → 4/23/93|
Bibliographical noteFunding Information:
in part by contract F30602-91-C-0128 from Rome Laboratory of the U.S.
Copyright 2004 Elsevier B.V., All rights reserved.