Automated resolution of semantic heterogeneity in multidatabases

  • Authors:
  • M. W. Bright;A. R. Hurson;S. Pakzad

  • Affiliations:
  • IBM, Gaithersburg, MD;Pennsylvania State Univ., University Park;Pennsylvania State Univ., University Park

  • Venue:
  • ACM Transactions on Database Systems (TODS)
  • Year:
  • 1994

Quantified Score

Hi-index 0.00

Visualization

Abstract

A multidatabase system provides integrated access to heterogeneous, autonomous local databases in a distributed system. An important problem in current multidatabase systems is identification of semantically similar data in different local databases. The Summary Schemas Model (SSM) is proposed as an extension to multidatabase systems to aid in semantic identification. The SSM uses a global data structure to abstract the information available in a multidatabase system. This abstracted form allows users to use their own terms (imprecise queries) when accessing data rather than being forced to use system-specified terms. The system uses the global data structure to match the user's terms to the semantically closest available system terms. A simulation of the SSM is presented to compare imprecise-query processing with corresponding query-processing costs in a standard multidatabase system. The costs and benefits of the SSM are discussed, and future research directions are presented.