World's Best Scientists 2026 revealed!
Award Badge
Computer Science
Germany
2025

D-Index & Metrics

Computer Science

D-Index
63
Citations
28399
World Ranking
2680
National Ranking
116

Research.com Recognitions

  • 2025 - Research.com Computer Science in Germany Leader Award
  • 2023 - Research.com Computer Science in Germany Leader Award
  • 2022 - Research.com Computer Science in Germany Leader Award

Overview

Erhard Rahm is affiliated with Leipzig University in Germany and has an extensive body of research within the field of Computer Science, contributing 78 publications. Their work predominantly spans several subfields including Artificial Intelligence, Management Science and Operations Research, Computer Networks and Communications, Computer Vision and Pattern Recognition, as well as Sociology and Political Science.

Their research covers a broad spectrum of topics, focusing mainly on Data Quality and Management, Privacy-Preserving Technologies in Data, Topic Modeling, Advanced Graph Neural Networks, Semantic Web and Ontologies, Graph Theory and Algorithms, and Biomedical Text Mining and Ontologies.

Frequently publishing in venues such as arXiv (Cornell University), Zenodo (CERN European Organization for Nuclear Research), SN Computer Science, Gesellschaft für Informatik (GI), and Data & Knowledge Engineering, Rahm's research output includes both journal articles and conference papers.

Recent publications include:

  • Construction of Knowledge Graphs: Current State and Challenges, 2024, Information
  • Distributed temporal graph analytics with GRADOOP, 2021, The VLDB Journal
  • Optimization of the Mainzelliste software for fast privacy-preserving record linkage, 2021, Journal of Translational Medicine
  • Physics-informed deep learning to quantify anomalies for real-time fault mitigation in 3D printing, 2024, Applied Intelligence
  • Construction of Knowledge Graphs: Current State and Challenges, 2023, SSRN Electronic Journal

The scientist collaborates regularly with several coauthors, most notably Daniel Obraczka, Victor Christen, Christopher Rost, Martin Franke, and Marvin Hofer, with collaboration counts ranging from 6 to 14 joint works.

Best Publications

  • A survey of approaches to automatic schema matching

    Erhard Rahm;Philip A. Bernstein

  • Data Cleaning: Problems and Current Approaches.

    Erhard Rahm;Hong Hai Do

  • Similarity flooding: a versatile graph matching algorithm and its application to schema matching

    S. Melnik;H. Garcia-Molina;E. Rahm

  • Generic Schema Matching with Cupid

    Jayant Madhavan;Philip A. Bernstein;Erhard Rahm

  • COMA: a system for flexible combination of schema matching approaches

    Hong-Hai Do;Erhard Rahm

  • Schema and ontology matching with COMA

    David Aumueller;Hong-Hai Do;Sabine Massmann;Erhard Rahm

  • Comparison of Schema Matching Evaluations

    Hong Hai Do;Sergey Melnik;Erhard Rahm

  • Schema Matching and Mapping

    Zohra Bellahsene;Angela Bonifati;Erhard Rahm

  • Evaluation of entity resolution approaches on real-world match problems

    Hanna Köpcke;Andreas Thor;Erhard Rahm

  • Frameworks for entity matching: A comparison

    Hanna Köpcke;Erhard Rahm

  • Rondo: a programming platform for generic model management

    Sergey Melnik;Erhard Rahm;Philip A. Bernstein

  • AGENT WORK: a workflow system supporting rule-based workflow adaptation

    Robert Müller;Ulrike Greiner;Erhard Rahm

  • Generic schema matching, ten years later

    Philip A. Bernstein;Jayant Madhavan;Erhard Rahm

  • Comparison of schema matching evaluations

    Hong-Hai Do;Sergey Melnik;Erhard Rahm

  • Matching large schemas: Approaches and evaluation

    Hong-Hai Do;Erhard Rahm

  • A survey of current Link Discovery frameworks

    Markus Nentwig;Michael Hartung;Axel-Cyrille Ngonga Ngomo;Erhard Rahm

  • Towards Large-Scale Schema and Ontology Matching

    Erhard Rahm

  • Load Balancing for MapReduce-based Entity Resolution

    Lars Kolb;Andreas Thor;Erhard Rahm

  • Dedoop: efficient deduplication with Hadoop

    Lars Kolb;Andreas Thor;Erhard Rahm

  • On Matching Schemas Automatically

    Erhard Rahm;Philip A. Bernstein

Frequent Co-Authors

Philip A. Bernstein
Philip A. Bernstein Microsoft (United States)
Gunter Saake
Gunter Saake Otto-von-Guericke University Magdeburg
Peter Christen
Peter Christen Australian National University
Gerhard Weikum
Gerhard Weikum Max Planck Institute for Informatics
Axel-Cyrille Ngonga Ngomo
Axel-Cyrille Ngonga Ngomo University of Paderborn
Thomas Seidl
Thomas Seidl Ludwig-Maximilians-Universität München
Matthias Jarke
Matthias Jarke RWTH Aachen University
Hector Garcia-Molina
Hector Garcia-Molina Stanford University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Studying Computer Science opens the door to diverse online degree options and career paths in related STEM fields. Many students look for the online degree for mechanical engineering to combine computational skills with real-world design and manufacturing expertise.

Those with a passion for discovery often consider the cheapest online physics degree, which merges theory with practical applications for future research roles. Data-driven careers are booming, so it’s common to ask, what is the cheapest data science course in the us?—ideal for aspiring analysts or AI specialists.

Finally, the tech industry highly values electrical engineering skills. Choosing from the best online electrical engineering programs USA expands options in robotics, communications, and beyond.

Exploring these degrees empowers students to tailor their studies to evolving interests and future job markets while maintaining the flexibility of online learning.

Best Scientists Citing Erhard Rahm

Trending Scientists