Corrigendum: Burr: A Benchmark for Ontology Learning from Relational Databases [Experiments & Analysis]

This is a corrigendum for the article ''BURR: A Benchmark for Ontology Learning from Relational Databases: [Experiments & Analysis]'' published in Proc. ACM Manag. Data 3, 6 (SIGMOD), Article 305 (December 2025), 27 pages.

Authors

Institutions

Publication Details

Journal
Proceedings of the ACM on Management of Data
Published
2026-04-02
DOI
https://doi.org/10.1145/3803529
Primary Topic
Advanced Graph Neural Networks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Corrigendum: Burr: A Benchmark for Ontology Learning from Relational Databases [Experiments & Analysis]

Fabian Panse, Lukas Laskowski, Jan Portisch, Michael Hladik et al.
Proceedings of the ACM on Management of Data
Advanced Graph Neural Networks
article

Corrigendum: Burr: A Benchmark for Ontology Learning from Relational Databases [Experiments & Analysis]

Fabian Panse, Lukas Laskowski, Jan Portisch, Michael Hladik, Felix Naumann
article en

Abstract

This is a corrigendum for the article ''BURR: A Benchmark for Ontology Learning from Relational Databases: [Experiments & Analysis]'' published in Proc. ACM Manag. Data 3, 6 (SIGMOD), Article 305 (December 2025), 27 pages.

Proceedings of the ACM on Management of DataVol. 4(1)
Hasso Plattner Institute (DE), University of Potsdam (DE), University of Augsburg (DE), Systems, Applications & Products in Data Processing (Germany) (DE)
Openalex Percentile: Top 21%
Advanced Graph Neural Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.