Usage-Based Schema Matching

  • Authors:

  • Hazem Elmeleegy;Mourad Ouzzani;Ahmed Elmagarmid

  • Affiliations:

  • Department of Computer Science, Purdue University, West Lafayette, IN. hazem@cs.purdue.edu;Cyber Center, Purdue University, West Lafayette, IN. mourad@cs.purdue.edu;Department of Computer Science, Purdue University, West Lafayette, IN/ Cyber Center, Purdue University, West Lafayette, IN. ake@cs.purdue.edu

  • Venue:
  • ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Existing techniques for schema matching are classified as either schema-based, instance-based, or a combination of both. In this paper, we define a new class of techniques, called usage-based schema matching. The idea is to exploit information extracted from the query logs to find correspondences between attributes in the schemas to be matched. We propose methods to identify co-occurrence patterns between attributes in addition to other features such as their use in joins and with aggregate functions. Several scoring functions are considered to measure the similarity of the extracted features, and a genetic algorithm is employed to find the highest-score mappings between the two schemas. Our technique is suitable for matching schemas even when their attribute names are opaque. It can further be combined with existing techniques to obtain more accurate results. Our experimental study demonstrates the effectiveness of the proposed approach and the benefit of combining it with other existing approaches.