Efficient Schema Matching Algorithm Based on Pre-Checking

  • KUBO Kengo
    Graduate School of Computer Science and Systems Engineering, Kyushu institute of Technology
  • YAMADA Keizo
    Department of Artificial Intelligence, Kyushu institute of Technology
  • HIRATA Kouichi
    Department of Artificial Intelligence, Kyushu institute of Technology
  • HARAO Masateru
    Department of Artificial Intelligence, Kyushu institute of Technology

Search this article

Description

The matching, which is one of the most essential procedures for knowledge processing, is to instantiate an expression to another expression by applying a substitution. In this paper, we formulate the schema representing the generalized or abstracted knowledge as a second-order formula, and discuss the schema matching between a schema and a first-order formula. First, we introduce the schema matching algorithm based on the second-order matching algorithm consisting of the simplification, the imitation and the projection. However, there exist exponentially large number of matchers for schema matching in general. On the other hand, in knowledge processing, the extraction of the optimum matcher is preferable to the extraction of all matchers. Hence, in this paper, we introduce the pre-checking which labels for the projectability, and design a complete schema matching algorithm that extracts the matcher preserving the syntactical information of schemata efficiently. Finally, we demonstrate the effectiveness of the proposed algorithm based on the experimental results.

Journal

Keywords

Details 詳細情報について

  • CRID
    1570572702511052288
  • NII Article ID
    110003219899
  • NII Book ID
    AA10826272
  • ISSN
    09168532
  • Text Lang
    en
  • Data Source
    • CiNii Articles

Report a problem

Back to top