DocumentCode
2496359
Title
Key equivalence in heterogeneous databases
Author
Pu, Calton
Author_Institution
Dept. of Comput. Sci., Columbia Univ., New York, NY, USA
fYear
1991
fDate
7-9 Apr 1991
Firstpage
314
Lastpage
316
Abstract
Semantic heterogeneity in heterogeneous databases (HDBs) has been recognized as a difficult problem. One of the probable causes of the little progress made in this area is the lack of well-defined subproblems that individual researchers can attack and achieve results. The author formulates the key equivalence problem in HDBs. By its nature there is no single algorithm that can solve the general key equivalence problem, but the author proposes a framework (a meta-algorithm) to approach it. He applies the framework to a concrete instance of the problem, the name matching problem and describes his experience so far
Keywords
database theory; distributed databases; heterogeneous databases; key equivalence; meta-algorithm; name matching; semantic heterogeneity; Artificial intelligence; Computer science; Concrete; Databases; Humans; Instruments; Uncertainty;
fLanguage
English
Publisher
ieee
Conference_Titel
Interoperability in Multidatabase Systems, 1991. IMS '91. Proceedings., First International Workshop on
Conference_Location
Kyoto
Print_ISBN
0-8186-2205-9
Type
conf
DOI
10.1109/IMS.1991.153727
Filename
153727
Link To Document