Demo Data from EDBT 2026 / reviewers in the wild / expert
Jakub Maciejewski
dblp:367/1234
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2025
0009-0005-8307-8843ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 2 · 1 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
1 paper |
Data integration and cleaning · 67% Knowledge graphs · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data integration and cleaning › entity resolution
deduplication |
0.9 | 1 | 2025 | Progressive Entity Matching: A Design Space Exploration · Proc. ACM Manag. Data 2025 |
Knowledge graphs
entity linking |
0.9 | 1 | 2025 | Progressive Entity Matching: A Design Space Exploration · Proc. ACM Manag. Data 2025 |
Data integration and cleaning
entity resolution |
0.9 | 1 | 2025 | Progressive Entity Matching: A Design Space Exploration · Proc. ACM Manag. Data 2025 |
Methods — techniques the papers use, named apart from their topics
weighting · 0.9scheduling · 0.9matching · 0.9filtering · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Progressive Entity Matching: A Design Space ExplorationabstractEntity Resolution (ER) is typically implemented as a batch task that processes all available data before identifying duplicate records. However, applications with time or computational constraints, e.g., those running in the cloud, require a progressive approach that produces results in a pay-as-you-go fashion. Numerous algorithms have been proposed for Progressive ER in the literature. In this work, we propose a novel framework for Progressive Entity Matching that organizes relevant techniques into four consecutive steps: (i) filtering, which reduces the search space to the most likely candidate matches, (ii) weighting, which associates every pair of candidate matches with a similarity score, (iii) scheduling, which prioritizes the execution of the candidate matches so that the real duplicates precede the non-matching pairs, and (iv) matching, which applies a complex, matching function to the pairs in the order defined by the previous step. We associate each step with existing and novel techniques, illustrating that our framework overall generates a superset of the main existing works in the field. We select the most representative combinations resulting from our framework and fine-tune them over 10 established datasets for Record Linkage and 8 for Deduplication, with our results indicating that our taxonomy yields a wide range of high performing progressive techniques both in terms of effectiveness and time efficiency. Jakub Maciejewski, Konstantinos Nikoletos, George Papadakis 0001, Yannis Velegrakis |
Proc. ACM Manag. Data | 1 |
| 2023 | Self-configured Entity Resolution with pyJedAIabstractEntity Resolution has been an active research topic for the last three decades, with numerous algorithms proposed in the literature. However, putting them into practice is often a complex task that requires implementing, combining and configuring complementary individual algorithms into comprehensive end-to-end workflows. To facilitate this process, we are developing pyJedAI, a novel system that provides a unifying framework for any type of main works in the field (i.e., both unsupervised and learning-based ones). Our vision is to facilitate both novice and expert users to use and combine these algorithms through a series of principled approaches for automatically configuring and benchmarking end-to-end pipelines. Vasilis Efthymiou, Ekaterini Ioannou, Manos Karvounis, Manolis Koubarakis, Jakub Maciejewski, Konstantinos Nikoletos, George Papadakis 0001, Dimitrios Skoutas 0001, Yannis Velegrakis, Alexandros Zeakis |
IEEE Big Data | 5 |