Skip to main content

User account menu

  • Log in
DBS-Logo

Database Group Leipzig

within the department of computer science

ScaDS-Logo Logo of the University of Leipzig

Main navigation

  • Home
  • Study
    • Exams
      • Hinweise zu Klausuren
    • Courses
      • Current
    • Modules
    • LOTS-Training
    • Abschlussarbeiten
    • Masterstudiengang Data Science
    • Oberseminare
    • Problemseminare
    • Top-Studierende
  • Research
    • Projects
      • Benchmark datasets for entity resolution
      • FAMER
      • HyGraph
      • Privacy-Preserving Record Linkage
      • GRADOOP
    • Publications
    • Prototypes
    • Annual reports
    • Cooperations
    • Graduations
    • Colloquia
    • Conferences
  • Team
    • Erhard Rahm
    • Member
    • Former employees
    • Associated members
    • Gallery

Rewrite Techniques for Performance Optimization of Schema Matching Processes

Breadcrumb

  • Home
  • Research
  • Publications
  • Rewrite Techniques for Performance Optimization of Schema Matching Processes

Peukert, E. ; Berthold, H. ; Rahm, E.

Rewrite Techniques for Performance Optimization of Schema Matching Processes

13th International Conference on Extending Database Technology, EDBT 2010

2010 / 03

Paper

Futher information: http://dl.acm.org/authorize?218033=

Abstract

A recurring manual task in data integration, ontology alignment or model management is finding mappings between complex meta data structures.
In order to reduce the manual effort, many matching algorithms for semi-automatically computing mappings were introduced.
Unfortunately, current matching systems severely lack performance when matching large schemas.
Recently, some systems tried to tackle the performance problem within individual matching approaches.
However, none of them developed solutions on the level of matching processes.
In this paper we introduce a novel rewrite-based optimization technique that is generally applicable to different types of matching processes.
We introduce filter-based rewrite rules similar to predicate push-down in query optimization.
In addition we introduce a modeling tool and recommendation system for rewriting matching processes.
Our evaluation on matching large web service message types shows significant performance improvements without losing the quality of automatically computed results.

Recent publications

  • 2025 / 8: Slice it up: Unmasking User Identities in Smartwatch Health Data
  • 2025 / 6: SecUREmatch: Integrating Clerical Review in Privacy-Preserving Record Linkage
  • 2025 / 5: Federated Learning With Individualized Privacy Through Client Sampling
  • 2025 / 3: Automated Configuration of Schema Matching Tools: A Reinforcement Learning Approach
  • 2025 / 3: Assessing the Impact of Image Dataset Features on Privacy-Preserving Machine Learning

Footer menu

  • Directions
  • Contact
  • Impressum