Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Albert Martin

dblp:188/3662 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 2 · 2 first-author · 2 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 · 75% Data mining · 25%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data integration and cleaning
data quality
0.912025
How and Why False Denial Constraints are Discovered · Proc. VLDB Endow. 2025
Data integration and cleaning › integrity constraint discovery
denial constraints
0.912025
How and Why False Denial Constraints are Discovered · Proc. VLDB Endow. 2025
Data integration and cleaning
dependency discovery
0.912025
How and Why False Denial Constraints are Discovered · Proc. VLDB Endow. 2025
Data mining
pattern mining
0.912025
How and Why False Denial Constraints are Discovered · Proc. VLDB Endow. 2025

Methods — techniques the papers use, named apart from their topics

statistical analysis · 0.9
YearPublicationVenuePosition
2026 Discovering Approximate Denial Constraints in Large Databases
Albert Martin, Eduardo C. de Almeida, Oscar Romero 0001, Anna Queralt
Proc. VLDB Endow.1
2025 How and Why False Denial Constraints are Discovered
abstract
Denial Constraints (DCs) are a flexible formalism to express many types of data rules, making them a widely adopted tool for many applications. This flexibility led to the development of numerous algorithms to automatically discover DCs directly from data. However, few studies have been conducted on the quality of the discovered DCs. We experimentally quantify the lack of quality in the results obtained by state-of-the-art algorithms, showing how the proportion of discovered DCs that are false is rarely below 95%. We hypothesize that the common source of these erroneous DCs stems from the adoption of the current DC validity definition. We use a statistical approach to explain the mechanism leading to these results, and propose a redefinition of DC validity properties to avoid the acceptance of false DCs. We validate this redefinition experimentally, showing that it exclusively accepts true constraints of the data, and is reliable enough to discover DCs missed by domain experts. Additionally, we provide curated sets of golden DCs for each dataset used in our study, those generated by domain experts and those discovered using our approach.
Albert Martin, Eduardo C. de Almeida, Oscar Romero 0001, Anna Queralt
Proc. VLDB Endow.1