Hitting Set Enumeration with Partial Information for Unique Column Combination Discovery
Summary: HPIValid treats UCC discovery as hitting-set enumeration in hypergraphs, enabling fast, memory-light mining on wide datasets. By fusing data-profiling techniques with modern enumeration theory, it achieves orders-of-magnitude speedups over prior work. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Johann Birnick (ETH Zurich)
- 2. Thomas Bläsius (Hasso Plattner Institute; University of Potsdam)
- 3. Tobias Friedrich (Hasso Plattner Institute; University of Potsdam)
- 4. Felix Naumann (Hasso Plattner Institute; University of Potsdam)
- 5. Thorsten Papenbrock (Hasso Plattner Institute; University of Potsdam)
- 6. Martin Schirneck (Hasso Plattner Institute; University of Potsdam)
BibTeX Citation
@article{birnick_vldb20,
title = {{Hitting Set Enumeration with Partial Information for Unique Column Combination Discovery}},
author = {Birnick, Johann and Bläsius, Thomas and Friedrich, Tobias and Naumann, Felix and Papenbrock, Thorsten and Schirneck, Martin},
journal = {PVLDB},
series = {{VLDB} '20},
volume = {13},
number = {11},
pages = {2270--2283},
doi = {10.14778/3407790.3407824},
url = {https://doi.org/10.14778/3407790.3407824},
year = {2020}
}Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,982 | Fast Approximate Denial Constraint Discovery | 2023 | VLDB | 5.5138609e-05 |
| 9,780 | Discovering Functional Dependencies through Hitting Set Enumeration | 2024 | SIGMOD | 5.2209769e-05 |
| 10,351 | Burr: A Benchmark for Ontology Learning from Relational Databases | 2026 | SIGMOD | 5.093636e-05 |
| 10,928 | How and Why False Denial Constraints are Discovered | 2025 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 203 | Dependency Inference | 1987 | VLDB | 0.00025381538 |
| 618 | A Hybrid Approach to Functional Dependency Discovery | 2016 | SIGMOD | 0.00015711835 |
| 1,216 | Partition Semantics for Relations | 1985 | PODS | 0.00011633715 |
| 1,741 | Efficient Denial Constraint Discovery with Hydra | 2018 | VLDB | 9.8755846e-05 |
| 2,269 | GORDIAN: Efficient and Scalable Discovery of Composite Keys | 2006 | VLDB | 8.8328424e-05 |
| 2,685 | Approximate Denial Constraints | 2020 | VLDB | 8.2594662e-05 |
| 4,183 | Scalable Discovery of Unique Column Combinations | 2014 | VLDB | 6.8467773e-05 |
| 4,303 | Possible and Certain SQL Keys | 2015 | VLDB | 6.7711902e-05 |
| 8,137 | Discovery and Ranking of Embedded Uniqueness Constraints | 2019 | VLDB | 5.4809275e-05 |
| 8,654 | Finding Candidate Keys For Relational Data Bases | 1975 | SIGMOD | 5.3913497e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,287 | Shape-Agnostic Table Overlap Discovery: A Maximum Common Subhypergraph Approach | 2026 | SIGMOD |
| 2 | 3,456 | Automatic Discovery of Attributes in Relational Databases | 2011 | SIGMOD |
| 3 | 2,854 | Extracting and Analyzing Hidden Graphs from Relational Databases | 2017 | SIGMOD |
| 4 | 1,262 | Discovering Queries based on Example Tuples | 2014 | SIGMOD |
| 5 | 7,203 | On The Recognition Of Coverings Of Acyclic Database Hypergraphs | 1983 | PODS |
| 6 | 618 | A Hybrid Approach to Functional Dependency Discovery | 2016 | SIGMOD |
| 7 | 7,721 | Identifying Insufficient Data Coverage in Databases with Multiple Relations | 2020 | VLDB |
| 8 | 4,183 | Scalable Discovery of Unique Column Combinations | 2014 | VLDB |
| 9 | 9,780 | Discovering Functional Dependencies through Hitting Set Enumeration | 2024 | SIGMOD |
| 10 | 8,137 | Discovery and Ranking of Embedded Uniqueness Constraints | 2019 | VLDB |