Analyzing and Revising Mediated Schemas to Improve Their Matchability

Abstract

Data integration systems often provide a uniform interface, called a mediated schema, to a multitude of disparate data sources. To answer user queries posed over the mediated schema, such systems employ a set of semantic matches be-tween this schema and the local schemas of the data sources. Finding such matches is well known to be difficult. Hence much work has focused on developing semi-automatic techniques to efficiently find the matches. In this paper, how-ever, we consider the complementary problem of improving the mediated schema, to make finding such matches easier. Specifically, a mediated schema S will typically be matched with many source schemas. Thus, can the developer of S analyze and revise S in a way that preserves Ss semantics, and yet makes it easier to match with in the future?

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 2005
Accession Number
AD1107413

Entities

People

  • Anhai Doan
  • Arnon Rosenthal
  • Len Seligman
  • Mayssam Sayyadian
  • Xiaoyong Chai

Organizations

  • MITRE Corporation

Tags

Communities of Interest

  • Ground and Sea Platforms

DTIC Thesaurus Topics

  • Accuracy
  • Air Traffic
  • Algorithms
  • Automatic
  • Best Practices
  • Computing-Related Activities
  • Data Integration
  • Errors
  • Generators
  • Information Exchange
  • Information Theory
  • Inventory
  • Iterations
  • Large Scale Integration
  • Real Estate
  • Sequences
  • Workload

Fields of Study

  • Computer science

Readers

  • Distributed Systems and Data Platform Development
  • Game Theory.
  • Team-Based Human-Centered Cognitive Task Decision Making and Information Performance.